An Exact Algorithm for Heterogeneous Drone-Truck Routing Problem
研究了多架不同特性的无人机与卡车协同配送问题，目标是最小化卡车行驶与等待无人机返回的总时间，并提出了基于逻辑Benders分解的精确算法。
Recently, there are attempts to utilize drones in the logistic application. We consider the case in which there are multiple drones with different characteristics, such as speed and battery capacity. The truck and drone collaborate the delivery to serve all customers, while the drones are carried by and dispatched from the truck. The multiple drones can be deployed simultaneously; however, the truck must wait until all drones return. Therefore, the goal is to minimize the total sum of truck travel and waiting times for drones to return after deliveries. We call the proposed model a heterogeneous drone-truck routing problem (HDTRP), and a mixed-integer programming formulation for the problem is presented. We develop an exact algorithm based on the logic-based Benders decomposition approach, which outperforms the state-of-the-art solvers.