Vehicle routing problem with drones

By Z. Wang, Jiuh‐Biing Sheu. Transportation Research Part B: Methodological, 2019

494 citations recorded by the source corpus.

Abstract The vehicle routing problem with drones (VRPD) is an extension of the classic capacitated vehicle routing problem, where not only trucks but drones are used to deliver parcels to customers. One distinctive feature of the VRPD is that a drone may travel with a truck, take off from its stop to serve customers, and land at a service hub to travel with another truck as long as the flying range and loading capacity limitations are satisfied. Routing trucks and drones in an integrated manner makes the problem much more challenging and different from classical vehicle routing literature. We propose a mixed integer programming model, and develop a branch-and-price algorithm. Extensive experiments are conducted on the instances randomly generated in a practical setting, and the results demonstrate the good computational performance of the proposed algorithm. We also conduct sensitivity analysis on a key factor that may affect the total cost of a solution.

Subfields: Automotive Engineering, Building and Construction, Industrial and Manufacturing Engineering

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

How researchers see this paper

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

In Automotive Engineering

  1. M. Moshref-Javadi
  2. Matthias Winkenbach

In Building and Construction

  1. M. Moshref-Javadi
  2. Matthias Winkenbach

In Industrial and Manufacturing Engineering

  1. M. Moshref-Javadi
  2. Matthias Winkenbach

Citations in the corpus