Dynamic Programming Approaches for the Traveling Salesman Problem with Drone

24 Pages Posted: 13 Sep 2017 Last revised: 6 Jun 2018

See all articles by Paul Bouman

Paul Bouman

Erasmus Research Institute of Management (ERIM)

Niels Agatz

Erasmus University Rotterdam (EUR) - Rotterdam School of Management (RSM)

Marie Schmidt

Erasmus Research Institute of Management (ERIM)

Date Written: September 11, 2017

Abstract

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.

Keywords: Traveling salesman problem, Vehicle routing, Drones, Dynamic Programming

Suggested Citation

Bouman, Paul and Agatz, Niels A.H. and Schmidt, Marie, Dynamic Programming Approaches for the Traveling Salesman Problem with Drone (September 11, 2017). Available at SSRN: https://ssrn.com/abstract=3035323 or http://dx.doi.org/10.2139/ssrn.3035323

Paul Bouman (Contact Author)

Erasmus Research Institute of Management (ERIM) ( email )

P.O. Box 1738
3000 DR Rotterdam
Netherlands

Niels A.H. Agatz

Erasmus University Rotterdam (EUR) - Rotterdam School of Management (RSM) ( email )

P.O. Box 1738
Room T08-21
3000 DR Rotterdam, 3000 DR
Netherlands

Marie Schmidt

Erasmus Research Institute of Management (ERIM) ( email )

P.O. Box 1738
3000 DR Rotterdam
Netherlands

Register to save articles to
your library

Register

Paper statistics

Downloads
264
rank
111,248
Abstract Views
826
PlumX Metrics