Dynamic programming approaches for the traveling salesman problem with drone

A promising new delivery model involves the use of a delivery truck that collaborates with a drone to make deliveries. Effectively combining a truck and a drone gives rise to a new planning problem that is known as the Traveling Salesman Problem with Drone (TSP-D). This paper presents exact solution approaches for the TSP-D based on dynamic programming and provides an experimental comparison of these approach. Our numerical experiments show that our approach can solve larger problems than the mathematical programming approaches that have been presented in the literature thus far. Moreover, we show that restrictions on the number of locations the truck can visit while the drone is away can help significantly reduce the solution times while having relatively little impact on the overall solution quality.

[1]  Tolga Bektas,et al.  Path and Speed Optimization for Conflict-Free Pickup and Delivery Under Time Windows , 2018, Transp. Sci..

[2]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .

[3]  RaphaelBertram,et al.  Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths" , 1972 .

[4]  Chryssi Malandraki,et al.  A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem , 1996 .

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

[6]  Yves Deville,et al.  Heuristic methods for the Traveling Salesman Problem with Drone , 2015, ArXiv.

[7]  John Gunnar Carlsson,et al.  Coordinated Logistics with a Truck and a Drone , 2018, Manag. Sci..

[8]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[9]  Rina Dechter,et al.  Generalized best-first search strategies and the optimality of A* , 1985, JACM.

[10]  Marie Schmidt,et al.  Dynamic Programming Approaches for the Traveling Salesman Problem with Drone , 2017 .

[11]  Lucio Bianco,et al.  Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints , 1997, Oper. Res..

[12]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[13]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[14]  Andrea Ponza.  Optimization of Drone-assisted parcel delivery , 2016 .

[15]  Marie Schmidt,et al.  Optimization Approaches for the Traveling Salesman Problem with Drone , 2016, Transp. Sci..

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

[17]  Chryssi Malandraki,et al.  Time dependent vehicle routing problems : formulations, solution algorithms and computational experiments , 1989 .

[18]  Herbert Kopfer,et al.  A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation , 2010, Transp. Sci..

[19]  Hrvoje Gold,et al.  Vehicle Routing Problem , 2008, Encyclopedia of GIS.

[20]  Richard Bellman,et al.  Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.

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

[22]  N PsaraftisHarilaos.  A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .

[23]  Mark S. Daskin,et al.  Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms , 1992, Transp. Sci..

[24]  Robert H. Sturges,et al.  Optimization of a truck-drone in tandem delivery network using K-means and genetic algorithm , 2016 .

[25]  Bruce L. Golden,et al.  The vehicle routing problem with drones: Extended models and connections , 2017, Networks.