定向运动
布线(电子设计自动化)
弧形布线
实时计算
线路规划
运输工程
运筹学
计算机科学
数学优化
工程类
计算机网络
数学
作者
Ke Wang,Qi‐Hui Wu,Xiangting He,Chuli Hu,Nengcheng Chen
标识
DOI:10.1080/13658816.2022.2045605
摘要
Dynamic changes in traffic conditions cause spatiotemporal variation in traffic monitoring demand. It is, therefore, necessary to conduct efficient road monitoring to identify dynamic abnormal situations, especially in peak traffic periods. Recently, unmanned aerial vehicles (UAVs) have become an attractive solution to this problem. However, UAV monitoring routes suffer from time limitations during peak traffic hours. To optimize UAV monitoring routes during rush hours, we develop a route planning method incorporating spatiotemporal variations in monitoring demand, in which we introduce a team orienteering arc routing problem with time-varying profits (TOARP-TP) and construct a corresponding mathematical model. The TOARP-TP is an extension of an already existing routing problem, team orienteering arc routing problem (TOARP). An iterated local search (ILS)-based algorithm is designed to solve the large instances of this problem. To verify the proposed method, we conduct sets of numerical experiments with the Sioux Falls road network in South Dakota, US, and a case study is applied using Wuhan, Hubei, PRC. The results demonstrate the efficiency and practicality of our method in optimizing UAV traffic monitoring routes during rush hours. Furthermore, we discuss a strategy for scenario determination and method selection in UAV route planning.
科研通智能强力驱动
Strongly Powered by AbleSci AI