Dynamic programming approaches for the traveling salesman problem with drone

By P. Bouman, Niels A. H. Agatz, M. Schmidt. Networks, 2017

334 citations recorded by the source corpus.

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 approaches. 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.

Subfields: Aerospace Engineering, Computer Vision and Pattern Recognition, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/d35813d918793ea40209154d212ff9421308fd92

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Aerospace Engineering

  1. M. Moshref-Javadi
  2. Matthias Winkenbach

In Computer Vision and Pattern Recognition

  1. M. Moshref-Javadi
  2. Tom Van Woensel
  3. Matthias Winkenbach

In Industrial and Manufacturing Engineering

  1. M. Moshref-Javadi
  2. Tom Van Woensel
  3. Matthias Winkenbach

Citations in the corpus