A variable neighborhood search for flying sidekick traveling salesman problem.

Abstract

The efficiency and dynamism of unmanned aerial vehicles, or drones, have presented substantial application opportunities in several industries in the last years. Notably, logistic companies have given close attention to these vehicles to reduce delivery time and operational cost. A variant of the traveling salesman problem (TSP), called the flying sidekick traveling salesman problem, was introduced involving drone-assisted parcel delivery. The drone launches from the truck, proceeds to deliver parcels to a customer, and then is recovered by the truck at a third location. While the drone travels through a trip, the truck delivers parcels to other customers as long as the drone has enough battery to hover waiting for the truck. This work proposes a hybrid heuristic where the initial solution is created from the optimal TSP solution reached by a TSP solver. Next, an implementation of the general variable neighborhood search is employed to obtain the delivery routes of truck and drone. Computational experiments show the potential of the algorithm to improve significantly delivery time. Furthermore, we provide a new set of instances based on the well-known traveling salesman problem library instances.