An Integer Programming Approach to Multi-Trip Routing of Delivery Drones at Load-Dependent Flight Speed

In recent years, there has been a growing interest in utilizing drones for parcel delivery among companies, aiming to address logistical challenges. However, effective optimization of delivery routes is essential. A theoretical framework termed the Flight Speed-aware Vehicle Routing Problem (FSVRP) has emerged to address the variability in drone flight speed based on payload weight. Several approximate methods have been proposed to solve the FSVRP. Our research endeavors to optimize parcel delivery efficiency and reduce delivery times by introducing a novel delivery problem. This problem accounts for multiple deliveries while considering the variability in flight speed due to diverse payloads. Through experimentation, we evaluate the efficacy of our proposed method compared to existing approaches. Specifically, we assess total flight distance and flight time. Our findings indicate that even in cases where the payload exceeds maximum capacity, all parcels can be delivered through multiple trips. Furthermore, employing a multi-trip FSVRP approach results in an average reduction of 10% in total flight time, even when payload capacities are not exceeded.