无人机
模因算法
渡线
旅行商问题
车辆路径问题
计算机科学
布线(电子设计自动化)
卡车
代表(政治)
过程(计算)
遗传算法
运筹学
工程类
人工智能
局部搜索(优化)
机器学习
计算机网络
航空航天工程
算法
生物
遗传学
政治
法学
政治学
操作系统
作者
Ruonan Zhai,Yi Mei,Tong Guo,Wenbo Du
出处
期刊:IEEE transactions on systems, man, and cybernetics
[Institute of Electrical and Electronics Engineers]
日期:2024-03-21
卷期号:54 (6): 3618-3630
被引量:1
标识
DOI:10.1109/tsmc.2024.3371471
摘要
With technological breakthroughs, drone deliveries have become increasingly popular, especially during the COVID-19 pandemic. Driven by both economical benefit and efficiency, drone-truck combined deliveries are in demand. However, it is very challenging to handle the collaboration between trucks and drones. Existing methods for truck-only routing cannot be directly applied, since their solution representations and search operators cannot consider the drone-truck collaborations effectively. In this article, we model the system as traveling salesman problem with drones (TSP-Ds), and propose a new Memetic algorithm named MATSP-D for solving it. Specifically, we design a new drone-truck solution representation and develop new crossover and local search operators under the new representation, which can modify the drone services effectively. MATSP-D conducts exploration by crossover, and exploitation by a variable neighborhood search process. The experimental results show that the proposed MATSP-D significantly outperforms the state-of-the-art algorithms for most test instances, especially the large instances with more complex collaborations between the truck and drone. Further analysis verifies the effectiveness of the newly developed local search operators in searching for better-drone-truck collaborations.
科研通智能强力驱动
Strongly Powered by AbleSci AI