A New Truck-Drone Routing Problem for Parcel Delivery Services Aided by Parking Lots

摘要

Collaborative routing aided by drones in last-mile delivery (LMD) has been an extensively studied topic in recent years. In this article, a new optimization problem for collaborative routing with a truck and a fleet of drones in LMD is introduced. The problem proposes a new strategy to coordinate a truck and a fleet of drones to serve a given set of customers. The plan is based on identifying the locations where the truck can park and where the drones fly to serve the customers. A procedure to locate these parking lots conveniently is given. For the transportation network, which includes these points, a mixed linear integer programming formulation is provided, which aims to minimize the makespan of serving all the customers. Computational experiments on a set of problem instances were conducted to analyze the model solutions’ characteristics and find their computational limits. The experiments showed that the proposed model could significantly improve the results obtained when only the truck delivers. Additionally, we propose a GRASP metaheuristic to solve instances of greater size. Its computational performance was studied when applied to a set of instances with different characteristics. The paper discusses some insights obtained from the computational experimentation and presents future research directions.