The vehicle routing problem with drones: Several worst-case results

Wang, X., Poikonen, S., & Golden, B. · 2017

abstract

This paper bounds, in the worst case, how much adding drones can shorten a truck-only operation. It is the theoretical starting point for the name vehicle routing problem with drones. The formulas were not re-derived for this card.

It introduces a simplified vehicle routing problem with drones in which aircraft may be dispatched and recovered at the depot or at customers. Worst-case results tie the maximum saving to the number of drones per truck and to drone speed relative to the truck. It is not an estimate of average savings in a particular city.

The worst-case ratios sit on idealized geometry and operating assumptions. A tight endurance limit means operations will not reach the theoretical bound. This card does not restate the ratio formulas, because an unremembered formula should not be invented.