The vehicle routing problem with drones: Extended models and connections. Issue 1 (7th June 2017)

• Record Type: Journal Article
• Authors: Poikonen, Stefan; Wang, Xingyin; Golden, Bruce
• Is Part Of: Networks. Volume 70:Issue 1(2017)
• Page Start: 34
• Page End: 43
• Publication Date: 2017-06-07
• Subjects: vehicle routing -- drones -- close enough routing -- bounds -- worst‐case analysis -- package delivery -- parallelization; Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21746
• Languages: English
• ISSNs: 0028-3045

Abstract

Abstract : The vehicle routing problem with drones (VRPD) is inspired by the increasing interest in commercial drone delivery by companies such as Amazon, Google, DHL, and Walmart. In our model, a fleet of m homogeneous trucks each carries k drones with a speed of α times that of the truck. Each drone may dispatch from the top of the truck and carry a package to a customer location. The drone then returns to the top of its truck to recharge or swap batteries (we assume instantaneously). The truck itself is allowed to move and deliver packages, but must be stationary at a delivery location or the depot when launching or retrieving drones. The goal is to minimize the completion time to deliver all packages and return all vehicles back to the central depot. In this article, we review and extend several worst‐case results from an earlier paper and we make connections with another practical variant of the vehicle routing problem and with Amdahl's Law. We find that the VRPD model offers some important practical advantages. The drones allow the truck to parallelize tasks and they are able to take advantage of crow‐fly distances. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 70(1), 34–43 2017