A Heuristic Approach for Truck and Drone Delivery System

Abstract

In the rapidly evolving landscape of logistics and last-mile delivery, optimizing efficiency and minimizing costs are paramount. This paper introduces a novel heuristic approach designed to enhance the efficiency of a truck-and-drone delivery system. Our method addresses the complex challenge of coordinating the movements of a truck, which serves as a mobile depot, and an unmanned aerial vehicle (UAV or drone), which performs rapid, short-distance deliveries. Our system proposes a two-step heuristic. For truck routes, we utilized the Concorde Solver to determine the optimal path, based on real-world road distances between locations in Bacău County, Romania. This data was meticulously collected and processed as a Traveling Salesman Problem (TSP) instance with precise geographical information. Concurrently, a drone is deployed for specific deliveries, with routes calculated using the Haversine formula to determine accurate distances based on geographical coordinates. A crucial aspect of our model is the integration of the drone’s limited autonomy, ensuring that each mission adheres to its operational capacity. Computational experiments conducted on a real-world dataset including 93 localities from Bacău County, Romania, demonstrate the effectiveness of the proposed two-stage heuristic. Compared to the optimal truck-only route, the hybrid truck-and-drone system achieved up to 15.59% cost reduction and 38.69% delivery time savings, depending on the drone’s speed and autonomy parameters. These results confirm that the proposed approach can substantially enhance delivery efficiency in realistic distribution scenarios.