Journal
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
Volume 122, Issue -, Pages 350-364Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trb.2019.03.005
Keywords
Vehicle routing problem with drones; Branch and price; Column generation
Categories
Funding
- NSF of China [71421001, 71531002]
- Ministry of Science and Technology of Taiwan, Republic of China [MOST 106-2410-H-002-055-MY3]
- Chang Jiang Scholars Program of China
Ask authors/readers for more resources
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. (C) 2019 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available