.png){kind=icon}
.png){kind=icon}
Return
An Exact Algorithm for Heterogeneous Drone-Truck Problem
.png){kind=icon}
PRE
AI
DOI：10.1287/trsc.2021.1055.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
vehicle routing problem
drone logistics
Benders decomposition
Journal
IF:
4.8
Papers:
1.9K
Citations:
8.4K