交通运输系统工程与信息 ›› 2026, Vol. 26 ›› Issue (4): 89-100.DOI: 10.16097/j.cnki.1009-6744.2026.04.008

• 综合交通运输体系 • 上一篇    下一篇

考虑拥堵风险集聚性的交警空地协同巡逻路径优化

牛学军,刘啸,张珂*   

  1. 中国人民公安大学,交通管理学院,北京 100038
  • 收稿日期:2026-04-08 修回日期:2026-06-03 接受日期:2026-06-22 出版日期:2026-08-25 发布日期:2026-08-21
  • 作者简介:牛学军(1974— ),男,山东阳信人,副教授
  • 基金资助:
    国家重点研发计划项目 (2023YFC3009700);国家自然科学基金 (52502404)

Traffic Police Air-Ground Collaborative Patrol Routing Optimization Considering Congestion Risk Agglomeration

NIU Xuejun, LIU Xiao, ZHANG Ke*   

  1. School of Traffic Management, People's Public Security University of China, Beijing 100038, China
  • Received:2026-04-08 Revised:2026-06-03 Accepted:2026-06-22 Online:2026-08-25 Published:2026-08-21
  • Supported by:
    National Key Research and Development Program of China (2023YFC3009700); National Natural Science Foundation of China (52502404)

摘要: 城市交警常态化巡逻勤务中,地面警车受路网拓扑约束与交通拥堵影响,机动能力受限,难以同时满足全域见警率与拥堵点位快速响应的双重目标。为此,本文提出面向空地协同交警巡逻的双目标混合整数规划模型,以拥堵风险捕获量与巡逻节点覆盖规模最大化为联合优化目标,系统刻画地面警车与警用无人机的不同运动约束及“空中发现-地面处置-任务重分配”的协同任务逻辑。针对大规模路网下的求解难题,本文设计一种改进的自适应大邻域搜索算法,提出融合空间距离与拥堵风险差值双重权重的改进Shaw移除算子,增强算法对风险集聚区域的整体识别能力;设计统一贪婪修复算子实现空地资源动态适配;推导时间成本局部增量评估公式以降低计算开销。依托杭州市跨江区的真实路网开展实验验证,结果表明:所提算法在捕获风险总分、覆盖节点数和综合得分方面均优于遗传算法、第二代非支配排序遗传算法(NSGA-II)和禁忌搜索基准,其中,综合得分较禁忌搜索提高19.3%,覆盖节点数提高24.7%;消融实验表 明,在含有统一贪婪修复算子的自适应大领域搜索算法(ALNS-G)基础上,进一步引入改进Shaw移除算子后,所提算法较ALNS-G综合得分提高4.5%,捕获风险提高12.5%,运行时间降低21.6%;帕累托前沿分析表明,所提算法在风险捕获与覆盖规模双目标空间中对禁忌搜索形成明显支配,为决策者提供了不同勤务偏好下的巡逻方案选择依据。

关键词: 城市交通, 空地协同巡逻, 自适应大邻域搜索, 路径优化, 帕累托前沿

Abstract: In the routine patrol operations of urban traffic police, ground patrol vehicles are constrained by the road network topology and traffic congestion, which limits their mobility and makes it difficult to simultaneously achieve full-area patrol visibility and rapid response at congested locations. This paper proposes a bi-objective mixed-integer programming model for air-ground collaborative traffic police patrol routing, with the joint objective to maximize the risk capture of congestion and the scale of covered patrol nodes. The model characterizes the heterogeneous motion constraints of ground patrol vehicles and police UAVs, as well as incorporates a collaborative task logic of "airborne detection- ground response- task reassignment". To address the computational challenges over large-scale road networks, an improved adaptive large neighborhood search algorithm is developed: an improved Shaw removal operator incorporating dual weights of spatial distance and congestion risk difference is proposed to enhance identification of risk-clustered zones; a unified greedy repair operator is designed to enable dynamic air-ground resource allocation; and a local incremental time evaluation formula is derived to reduce computational overhead. Experiments are conducted on a real road network in the cross-river district of Hangzhou. Results show that the proposed algorithm outperforms the genetic algorithm, NSGA- II, and tabu search baselines in terms of captured risk score, number of covered nodes, and composite score. Compared with the tabu search, the proposed algorithm improves the composite score by 19.3% and the number of covered nodes by 24.7%. The ablation study shows that, after incorporating the improved Shaw operator, the proposed algorithm improves the composite score by 4.5%, the captured risk score by 12.5%, and reduces the running time by 21.6% compared with ALNS-G; Pareto frontier analysis shows that the proposed algorithm clearly dominates the tabu search in the bi-objective space of risk capture and node coverage, which provides decision-makers with patrol scheme options under different operational preferences.

Key words: urban transportation, air- ground collaborative patrol, adaptive large neighborhood search, route optimization, Pareto frontier

中图分类号: