Optimization Approaches for the Traveling Salesman Problem with Drone

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 drones 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 integer program 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 compared to truck-only delivery. The online appendix is available at https://doi.org/10.1287/trsc.2017.0791 .

[1]  Daniel J. Rosenkrantz,et al.  An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[2]  John E. Beasley,et al.  Route first--Cluster second methods for vehicle routing , 1983 .

[3]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[4]  José-Manuel Belenguer,et al.  A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots , 2016, Transp. Sci..

[5]  Jonathan Cole Smith,et al.  An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem , 2014, INFORMS J. Comput..

[6]  Chase C. Murray,et al.  The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery , 2015 .

[7]  Michael Drexl.  Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments , 2014, Networks.

[8]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[9]  Paolo Toth,et al.  The Generalized Covering Salesman Problem , 2012, INFORMS J. Comput..

[10]  Seokcheon Lee,et al.  Response Threshold Model Based UAV Search Planning and Task Allocation , 2014, J. Intell. Robotic Syst..

[11]  Stephan Scheuerer,et al.  A tabu search heuristic for the truck and trailer routing problem , 2006, Comput. Oper. Res..

[12]  Michael Drexl,et al.  Synchronization in Vehicle Routing - A Survey of VRPs with Multiple Synchronization Constraints , 2012, Transp. Sci..

[13]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[14]  Shuo-Yan Chou,et al.  Solving the truck and trailer routing problem based on a simulated annealing heuristic , 2009, Comput. Oper. Res..

[15]  Marie Schmidt,et al.  Instances for the TSP with Drone , 2015 .

[16]  Carter C. Price,et al.  The Close Enough Traveling Salesman Problem: A Discussion of Several Heuristics , 2006 .

[17]  William J. Cook,et al.  TSP Cuts Which Do Not Conform to the Template Paradigm , 2000, Computational Combinatorial Optimization.

[18]  John R. Current,et al.  The Covering Salesman Problem , 1989, Transp. Sci..

[19]  Michael Drexl.  Branch-and-price and heuristic column generation for the generalized truck-and-trailer routing problem , 2011 .

[20]  Bruce L. Golden,et al.  Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network , 2008 .

[21]  George J. Vachtsevanos,et al.  UAV Applications: Introduction , 2015 .

[22]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  M. Shamos.  Problems in computational geometry , 1975 .

[25]  Nubia Velasco,et al.  A GRASP with evolutionary path relinking for the truck and trailer routing problem , 2011, Comput. Oper. Res..

[26]  Twan Dollevoet,et al.  Robust UAV mission planning , 2011, Ann. Oper. Res..

[27]  Bruce L. Golden,et al.  The vehicle routing problem with drones: several worst-case results , 2017, Optim. Lett..

[28]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .