TY - GEN
T1 - Van and Unmanned-Aerial-Vehicle Cooperative Routing Problem with Time Windows
AU - Li, Hongqi
AU - Zhan, Zhuopeng
AU - Wang, Zhiqi
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - Because of the significant real-world benefits of using cargo vans with unmanned aerial vehicles (UAVs) for deliveries, we define the van and unmanned-aerial-vehicle cooperative routing problem with time windows (VURP-TW). The VURP-TW is characterized by synchronization in route, classified customers, direct delivery, time windows, multiple vans, and multiple UAVs carried by each van. Customers along van routes, which are named satellites in this paper, are selected for vans dispatching or retrieving the carried UAVs. A satellite means a UAV launch/retrieval location. The synchronization in route enables UAVs launching from vans to return to paired vans at satellites instead of the depot. We develop mixed integer linear programming formulations to obtain optimal solutions for small- and medium-scale instances. We propose an adaptive large neighborhood search (ALNS) heuristic. The results of the computational experiments prove the effectiveness of the model and the heuristic.
AB - Because of the significant real-world benefits of using cargo vans with unmanned aerial vehicles (UAVs) for deliveries, we define the van and unmanned-aerial-vehicle cooperative routing problem with time windows (VURP-TW). The VURP-TW is characterized by synchronization in route, classified customers, direct delivery, time windows, multiple vans, and multiple UAVs carried by each van. Customers along van routes, which are named satellites in this paper, are selected for vans dispatching or retrieving the carried UAVs. A satellite means a UAV launch/retrieval location. The synchronization in route enables UAVs launching from vans to return to paired vans at satellites instead of the depot. We develop mixed integer linear programming formulations to obtain optimal solutions for small- and medium-scale instances. We propose an adaptive large neighborhood search (ALNS) heuristic. The results of the computational experiments prove the effectiveness of the model and the heuristic.
KW - Adaptive large neighborhood search
KW - Mixed integer linear programming
KW - Routing
KW - Time windows
KW - Van-UAV combination
UR - https://www.scopus.com/pages/publications/85177452278
U2 - 10.1109/CoDIT58514.2023.10284483
DO - 10.1109/CoDIT58514.2023.10284483
M3 - 会议稿件
AN - SCOPUS:85177452278
T3 - 9th 2023 International Conference on Control, Decision and Information Technologies, CoDIT 2023
SP - 269
EP - 274
BT - 9th 2023 International Conference on Control, Decision and Information Technologies, CoDIT 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 9th International Conference on Control, Decision and Information Technologies, CoDIT 2023
Y2 - 3 July 2023 through 6 July 2023
ER -