Collaborative Truck-Drone Routing With Multivisit via Surrogate-Assisted Bi-Level Optimization

View at publisher
Authors: Ruonan Zhai, Xi Zhang, Yi Mei, Wenbo Du, Tong Guo, Tao Song
Cited by: 1
References: 60

Abstract

The development of drone techniques has extensive applications to fields like last-mile parcel delivery. For economic and efficiency advantages, collaborative truck-drone systems have attracted great attention and formulated as truck-drone routing problems. In this paper, a multi-visit traveling salesman problem with drones 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 solvethe bi-level model, we propose a novel surrogate-assisted bi-level optimization 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-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 problem (DLR), 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.

Fields of Study & Subjects

UAV Applications and Optimization Vehicle Routing Optimization Methods Air Traffic Management and Optimization

Publication details

Journal / source
IEEE Transactions on Artificial Intelligence
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Volume
7
Issue
8
Pages
4376–4391
Publication date
10 February 2026