The vehicle routing problem with drones: several worst-case results

Wang, Xingyin; Poikonen, Stefan; Golden, Bruce L.

doi:10.1007/s11590-016-1035-3

Cited by 386 publications

(216 citation statements)

References 4 publications

Supporting

Mentioning

177

Contrasting

Unclassified

Order By: Relevance

“…Murray and Chu [2015] investigate the "Flying Sidekick Traveling Salesman Problem" which is very similar to the TSP-D. To solve the problem, they propose a mixed integer programming formulation for two variants of the problem and consider two simple heuristics which we compare to our heuristic approaches in our computational experiments. Wang et al [2016] derive a number of worst-case results for the vehicle routing problem with drones, in which a fleet of trucks equipped with drones delivers packages to customers.…”

Section: Related Literaturementioning

confidence: 99%

Optimization Approaches for the Traveling Salesman Problem with Drone

Agatz

Bouman²,

Schmidt³

2015

SSRN Journal

View full text Add to dashboard Cite

The fast and cost-efficient home delivery of goods ordered online is logistically challenging. Many companies are looking for new ways to cross the last-mile to their customers. One technology-enabled opportunity that recently has received much attention is the use of a drone to support deliveries. An innovative last-mile delivery concept in which a truck collaborates with a drone to make deliveries gives rise to a new variant of the traveling salesman problem (TSP) that we call the TSP with drone. In this paper, we model this problem as an IP and develop several fast route first-cluster second heuristics based on local search and dynamic programming. We prove worst-case approximation ratios for the heuristics and test their performance by comparing the solutions to the optimal solutions for small instances. In addition, we apply our heuristics to several artificial instances with different characteristics and sizes. Our experiments show that substantial savings are possible with this concept in comparison to truck-only delivery.

show abstract

Section: Related Literaturementioning

confidence: 99%

Optimization Approaches for the Traveling Salesman Problem with Drone

Agatz

Bouman²,

Schmidt³

2015

SSRN Journal

View full text Add to dashboard Cite

show abstract

“…They model this as a mixed integer program of a travelling salesman type. Computational issues associated with this model have been discussed by [23]. Related models have been given by Ponza [15], Agatz et.…”

Section: Model Developmentmentioning

confidence: 99%

Drone Delivery Models for Healthcare

Scott

2017

Proceedings of the Annual Hawaii International Conference on System Sciences

222

View full text Add to dashboard Cite

show abstract

“…It can carry large and heavy cargo with a diversity of size, but it is also heavy, 15 slow and has much higher transportation cost.…”

Section: Introductionmentioning

confidence: 99%

“…Additionally, Wang et al [15], in a recent research, introduced a more general problem that copes with multiple trucks and drones with the goal of 80 minimizing the completion time. The authors named the problem "The vehicle routing problem with drone" (VRP-D) and conducted the analysis on several worst-case scenarios, from which they propose bounds on the best possible savings in time when using drones and trucks instead of trucks alone.…”

Section: Introductionmentioning

confidence: 99%