A Coordinated Vehicle-Drone Arc Routing Approach Based on Improved Adaptive Large Neighborhood Search

被引:5
作者
Wu, Guohua [1 ]
Zhao, Kexin [1 ]
Cheng, Jiaqi [1 ]
Ma, Manhao [2 ]
机构
[1] Cent South Univ, Sch Traff & Transportat Engn, Changsha 410075, Peoples R China
[2] Natl Univ Def Technol, Coll Syst Engn, Changsha 410073, Peoples R China
基金
中国国家自然科学基金;
关键词
vehicle-drone; arc routing problem; traffic patrol; routing optimization; adaptive large neighborhood search; TRAVELING SALESMAN PROBLEM; RURAL POSTMAN PROBLEM; OPTIMIZATION; ALGORITHM;
D O I
10.3390/s22103702
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
Through urban traffic patrols, problems such as traffic congestion and accidents can be found and dealt with in time to maintain the stability of the urban traffic system. The most common way to patrol is using ground vehicles, which may be inflexible and inefficient. The vehicle-drone coordination maximizes utilizing the flexibility of drones and addresses their limited battery capacity issue. This paper studied a vehicle-drone arc routing problem (VD-ARP), consisting of one vehicle and multiple drones. Considering the coordination mode and constraints of the vehicle-drone system, a mathematical model of VD-ARP that minimized the total patrol time was constructed. To solve this problem, an improved, adaptive, large neighborhood search algorithm (IALNS) was proposed. First, the initial route planning scheme was generated by the heuristic rule of "Drone-First, Vehicle-Then". Then, several problem-based neighborhood search strategies were embedded into the improved, adaptive, large neighborhood search framework to improve the quality of the solution. The superiority of IALNS is verified by numerical experiments on instances with different scales. Several critical factors were tested to determine the effects of coordinated traffic patrol; an example based on a real road network verifies the feasibility and applicability of the algorithm.
引用
收藏
页数:22
相关论文
共 49 条
[11]   EUCLIDEAN DISTANCE MAPPING [J].
DANIELSSON, PE .
COMPUTER GRAPHICS AND IMAGE PROCESSING, 1980, 14 (03) :227-248
[12]   A variable neighborhood search for flying sidekick traveling salesman problem [J].
de Freitas, Julia Carta ;
Vaz Penna, Puca Huachi .
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2020, 27 (01) :267-290
[13]  
Dijkstra EW., 1959, Numerische Mathematik, V1, P269, DOI [10.1007/BF01386390, DOI 10.1007/BF01386390]
[14]   Vehicle Routing Problems for Drone Delivery [J].
Dorling, Kevin ;
Heinrichs, Jordan ;
Messier, Geoffrey G. ;
Magierowski, Sebastian .
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2017, 47 (01) :70-85
[15]   ARC ROUTING-PROBLEMS .1. THE CHINESE POSTMAN PROBLEM [J].
EISELT, HA ;
GENDREAU, M ;
LAPORTE, G .
OPERATIONS RESEARCH, 1995, 43 (02) :231-242
[16]  
Erdos Paul, 1959, Canadian Journal of Mathematics, V11, P34, DOI [10.4153/CJM-1959-003-9, DOI 10.4153/CJM-1959-003-9]
[17]   A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem [J].
Fernandez, Elena ;
Laporte, Gilbert ;
Rodriguez-Pereira, Jessica .
TRANSPORTATION SCIENCE, 2018, 52 (02) :353-369
[18]   Metaheuristic algorithm for solving the multi-objective vehicle routing problem with time window and drones [J].
Han, Yun-qi ;
Li, Jun-qing ;
Liu, Zhengmin ;
Liu, Chuang ;
Tian, Jie .
INTERNATIONAL JOURNAL OF ADVANCED ROBOTIC SYSTEMS, 2020, 17 (02)
[19]   Improvement procedures for the undirected rural postman problem [J].
Hertz, A ;
Laporte, G ;
Hugo, PN .
INFORMS JOURNAL ON COMPUTING, 1999, 11 (01) :53-62
[20]   On the joint design of routing and scheduling for Vehicle-Assisted Multi-UAV inspection [J].
Hu, Menglan ;
Liu, Weidong ;
Lu, Junqiu ;
Fu, Rui ;
Peng, Kai ;
Ma, Xiaoqiang ;
Liu, Jiangchuan .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2019, 94 :214-223