TY - JOUR
T1 - Collaborative Truck-Drone Routing with Multivisit via Surrogate-Assisted Bi-Level Optimization
AU - Zhai, Ruonan
AU - Zhang, Xuejun
AU - Mei, Yi
AU - Du, Wenbo
AU - Guo, Tong
AU - Song, Tao
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2026/8/1
Y1 - 2026/8/1
N2 - The development of drone techniques has extensive applications to fields such as last-mile parcel delivery. For economic and efficiency advantages, collaborative truck-drone systems have attracted great attention and formulated as truck-drone routing problems (TDRPs). In this article, a multivisit traveling salesman problem with drones (MTSP-D) is investigated. We decompose it into a two-layer structure and formulate it as a new bi-level model (Bi-MTSPD). The major advantage of the bi-level model is its ability to represent the complex interactions between truck and drone routes by dispatching the drones under the premise of truck routes. To solve the bi-level model, we propose a novel surrogate-assisted bi-level optimization (SaBO) method. The upper level subproblem can be treated as a traveling salesman problem with customer assignment, and high-quality truck routes are identified by the K-nearest neighbor (KNN)-based surrogate model with newly proposed features in order to allocate more computational resources to promising upper level solutions. For the lower level drone location routing (DLR) problem, a customized memetic algorithm is developed to optimize the drone routes for the corresponding truck route. Comprehensive experimental results show that the proposed algorithm significantly outperforms the existing state-of-the-art algorithms across most benchmark instances. Further analysis verifies the congruence of the bi-level optimization for MTSP-D and the effectiveness of upper level and lower level solvers.
AB - The development of drone techniques has extensive applications to fields such as last-mile parcel delivery. For economic and efficiency advantages, collaborative truck-drone systems have attracted great attention and formulated as truck-drone routing problems (TDRPs). In this article, a multivisit traveling salesman problem with drones (MTSP-D) is investigated. We decompose it into a two-layer structure and formulate it as a new bi-level model (Bi-MTSPD). The major advantage of the bi-level model is its ability to represent the complex interactions between truck and drone routes by dispatching the drones under the premise of truck routes. To solve the bi-level model, we propose a novel surrogate-assisted bi-level optimization (SaBO) method. The upper level subproblem can be treated as a traveling salesman problem with customer assignment, and high-quality truck routes are identified by the K-nearest neighbor (KNN)-based surrogate model with newly proposed features in order to allocate more computational resources to promising upper level solutions. For the lower level drone location routing (DLR) problem, a customized memetic algorithm is developed to optimize the drone routes for the corresponding truck route. Comprehensive experimental results show that the proposed algorithm significantly outperforms the existing state-of-the-art algorithms across most benchmark instances. Further analysis verifies the congruence of the bi-level optimization for MTSP-D and the effectiveness of upper level and lower level solvers.
KW - Artificial intelligence in transportation
KW - Uncrewed aerial vehicles
KW - computational intelligence
KW - evolutionary optimization
UR - https://www.scopus.com/pages/publications/105030206617
U2 - 10.1109/TAI.2026.3662657
DO - 10.1109/TAI.2026.3662657
M3 - Article
AN - SCOPUS:105030206617
SN - 2691-4581
VL - 7
SP - 4376
EP - 4391
JO - IEEE Transactions on Artificial Intelligence
JF - IEEE Transactions on Artificial Intelligence
IS - 8
ER -