Traveling Salesman Problem with Multiple Drones

Abstract

Combining trucks and drones in delivering parcels is an emerging research in recent years. In this paper, we investigate an extension of the TSP-D problem in which a truck travels with m (m > 1) drones (called TSP-mD) instead of one drone in TSP-D. We adapt the greedy randomized adaptive search procedure (GRASP) (proposed by Ha et al.) and propose an adaptive large neighborhood search (ALNS) heuristic to the resolution of this problem. Experimental results on different instances show that by combining a truck with more than one drone, the GRASP can bring more efficient solution. Moreover, the ALNS is more efficient than the GRASP in this context.