Vehicle Routing Problem with Drones for Last Mile Delivery

摘要

E-commerce and retail companies are seeking ways to cut delivery times and costs by exploring opportunities to use drones for making last mile delivery deliveries. In recent years, drone routing and scheduling has become a highly active area of research. This research addresses the delivery concept of a truck-drone combination along with the idea of allowing autonomous drones to fly from delivery trucks, make deliveries, and fly to delivery trucks nearby. The proposed model considers the synchronized truck drone routing model by allowing multiple drones to fly from a truck, serve customers and immediately return to the same truck for the battery swap and package retrieval. The model also takes into account both trucks and drones capacities to ensure that the amount of loads carried by each drone must not exceed its capacity and the total amount of loads in each delivery route must be less than truck’s capacity. The goal is to find the optimal routes of both trucks and drones which minimize the total arrival time of both trucks and drones at the depot after completing the deliveries. The problem can be solved by the formulated mixed integer programming (MIP) for the small size problem. Numerical results in the case study and benchmark problems are presented to show the delivery time improvement over the delivery time from other delivery types.