应急车辆动态路径选择的两阶段优化模型

doi:10.16097/j.cnki.1009-6744.2022.03.010

交通运输系统工程与信息 ›› 2022, Vol. 22 ›› Issue (3): 84-92.DOI: 10.16097/j.cnki.1009-6744.2022.03.010

• 智能交通系统与信息技术 • 上一篇下一篇

应急车辆动态路径选择的两阶段优化模型

杨枫^a，种大双^{* b}

河南中医药大学，a. 管理学院；b. 信息技术学院，郑州 450046

收稿日期:2022-01-21 修回日期:2022-02-16 接受日期:2022-03-07 出版日期:2022-06-25 发布日期:2022-06-22
作者简介:杨枫(1978- )，男，河南新县人，副教授，博士。
基金资助:
教育部人文社会科学研究青年基金;河南省哲学社会科学规划项目;河南中医药大学博士科研基金

Emergency Vehicle Dynamic Path Selection Based on Two-stage Objective Optimization Model

YANG Feng^a , CHONG Da-shuang^{* b}

a. College of Management; b. School of Information Technology, Henan University of Chinese Medicine, Zhengzhou 450046, China

Received:2022-01-21 Revised:2022-02-16 Accepted:2022-03-07 Online:2022-06-25 Published:2022-06-22
Supported by:
Ministry of Education Humanities and Social Sciences Research Youth Fund Project(18YJCZH216)；Henan Philosophy and Social Science Planning Project(2021BZH009)； Doctoral Research Fund of Henan University of Chinese Medicine(BSJJ2020-11)。

摘要/Abstract

摘要： 为研究突发事件情境下交通路网动态变化时的应急车辆路径选择问题，提出应急车辆动态路径选择的两阶段调度优化模型。通过结合路网动态状况和应急救援特征，建立基于最大路径可靠度和最短行程时间的两阶段优化模型；通过混沌搜索改进布谷鸟算法初始种群，并加入蛙跳算法改进局部搜索操作，设计混合布谷鸟算法，改善全局寻优能力；以某市某区部分区域路网为例，将该区域路网实时交通数据应用于模型和求解算法中。实验表明，利用两阶段优化模型和算法编码方案能成功获得出发点到救援点的动态可靠路径，相同行驶路径情况下模型与算法求解的最短行程时间与实地驾车获得的最短行程时间最大误差不超过8%，说明优化模型可行。3 种不同算法求解K最短路径的结果发现，混合布谷鸟算法得到的最短行程时间比粒子群算法和经典布谷鸟算法得到的结果都要小，且计算时间最短，表明混合布谷鸟算法求解的结果最优，性能最好。

关键词: 智能交通, 应急车辆, 动态路径, 混合布谷鸟算法, 两阶段模型

Abstract: This paper investigates the emergency vehicle routing problem when the traffic network changes dynamically and proposes a two-stage scheduling optimization model for emergency vehicle routing. The two-stage optimization model with the maximum path reliability and the shortest travel time is developed by combining the dynamic situation of the road network and the characteristics of emergency rescue. The initial population of Cuckoo algorithm is improved by chaotic search and the frog leaping algorithm is added to improve the local search operation. The hybrid Cuckoo algorithm is designed to improve the global optimization ability. Taking a regional road network in a city as an example, the real-time traffic data of the regional road network and the data obtained from field driving are applied to the model and solution algorithm. The results show that the dynamic reliable path from the starting point to the rescue point can be successfully obtained using the proposed model and algorithm. For the same driving path, the maximum error of the shortest travel time solved by the proposed method and the shortest travel time obtained by field driving is no more than 8%, indicating good feasibility of the method. Compared to the particle swarm optimization algorithm and the classical Cuckoo algorithm to solve the K shortest path, the hybrid Cuckoo algorithm can obtain the shortest travel time with fastest calculation speed, which shows that the hybrid Cuckoo algorithm has the best solution and performance.

Key words: intelligent transportation, emergency vehicles, dynamic path, hybrid Cuckoo algorithm, two-stage model

中图分类号:

U121

杨枫, 种大双. 应急车辆动态路径选择的两阶段优化模型[J]. 交通运输系统工程与信息, 2022, 22(3): 84-92.

YANG Feng , CHONG Da-shuang. Emergency Vehicle Dynamic Path Selection Based on Two-stage Objective Optimization Model[J]. Journal of Transportation Systems Engineering and Information Technology, 2022, 22(3): 84-92.

导出引用管理器 EndNote|Ris|BibTeX

链接本文: http://www.tseit.org.cn/CN/10.16097/j.cnki.1009-6744.2022.03.010

http://www.tseit.org.cn/CN/Y2022/V22/I3/84

参考文献

[1] 何雅琴, 容煜伦, 柳祖鹏. 基于分位速度的城市突发事件交通影响等级划分方法[J]. 交通运输系统工程与信息, 2019, 19(6): 163-167, 175. [HE Y Q, RONG Y L, LIU Z P. Classification method of traffic impact grade of urban traffic emergency based on percentile speed[J]. Journal of Transportation Systems Engineering and Information Technology, 2019, 19(6): 163-167, 175.]

[2] GU J, LI M, YU L, et al. Analysis on link travel time estimation considering time headway based on urban road RFID data[J]. Journal of Advanced Transportation, 2021, 2021(3): 1-19.

[3] ZHANG D, ZHU H. Optimization of urban transportation network path[M]. Singapore: Springer Nature Singapore Pte Ltd, 2020.

[4] JABALLAH R, MARJOLEIN V, et al. The timedependent shortest path and vehicle routing problem[J]. INFOR: Information Systems and Operational Research, 2021, 59(4): 592-622.

[5] 段宗涛, WANG W X, 等. 面向城市交通网络的K最短路径集合算法[J]. 交通运输系统工程与信息, 2014, 14 (3): 194-200. [DUAN Z T, WANG W X, et al. A K-th shortest path set algorithm for urban traffic network[J]. Journal of Transportation Systems Engineering and Information Technology, 2014, 14(3): 194-200.]

[6] ZHI, L P, ZHOU X Z, et al. Vehicle routing for dynamic road network based on travel time reliability[J]. IEEE Access, 2020, 8(10): 190596-190604.

[7] 赖元文, 张杰. 基于模拟退火-自适应布谷鸟算法的城市公交调度优化研究[J]. 交通运输系统工程与信息, 2021, 21(1): 183-189. [LAI Y W, ZHANG J. Urban bus scheduling optimization based on simulated annealadaptive Cuckoo search algorithm[J]. Journal of Transportation Systems Engineering and Information Technology, 2021, 21(1): 183-189.]

[8] NANDA S J, PANDA G. A survey on nature inspired metaheuristic algorithms for partitional clustering[J]. Swarm and Evolutionary Computation, 2014, 16(6): 1-18.

[9] SONEJI H R, SANGHVI R C. Towards the improvement of Cuckoo search algorithm[J]. International Journal of Computer Information Systems and Industrial Management Applications, 2014, 6: 77-88.

[10] LI X, YIN M. Modified Cuckoo search algorithm with self adaptive parameter method[J]. Information Sciences, 2015, 298: 80-97.

[11] PINTO A R, CREPALGI A F, et al. A genetic algorithm applied to pick sequencing for billing[J]. Journal of Intelligent Manufacturing, 2018, 29(2): 405-422.

[12] 杨景明, 马明明, 车海军, 等. 多目标自适应混沌粒子群优化算法[J]. 控制与决策, 2015, 30(12): 2168-2174. [YANG J M, MA M M,CHE H J, et al. Multi-objective adaptive chaotic particle swarm optimization algorithm [J]. Control and Decision, 2015, 30(12): 2168-2174.]

[13] ZHANG L, TANG Y, et al. A new particle swarm optimization algorithm with adaptive inertia weight based on Bayesian techniques[J]. Applied Soft Computing, 2015, 28: 138-149.

[1]	赵建东, 赵志敏, 屈云超, 谢东繁, 孙会君. 轨迹数据驱动的车辆换道意图识别研究[J]. 交通运输系统工程与信息, 2022, 22(4): 63-71.
[2]	陈喜群, 曹震, 莫栋. 融合卡尔曼滤波的高速公路状态估计误差界限分析[J]. 交通运输系统工程与信息, 2022, 22(4): 72-78.
[3]	张佩瑜, 周建山, 田大新. 网联车辆编队的鲁棒模型预测控制方法[J]. 交通运输系统工程与信息, 2022, 22(4): 268-274.
[4]	秦严严, 朱宜文, 朱立, 唐鸿辉. 智能网联卡车车队混合流通行能力分析方法[J]. 交通运输系统工程与信息, 2022, 22(4): 275-282.
[5]	齐尧, 朱彦齐, 李永乐, 徐友春. 面向动静态混合环境的智能车运动规划方法[J]. 交通运输系统工程与信息, 2022, 22(4): 293-301.
[6]	张仕杰, 唐涛, 刘金涛, 李辰岭. 基于复杂网络的列车辅助驾驶危险致因传播模型[J]. 交通运输系统工程与信息, 2022, 22(4): 129-136.
[7]	李熙莹, 陈丽娟. 一种基于融合网络的慢行交通速度计算方法[J]. 交通运输系统工程与信息, 2022, 22(4): 186-193.
[8]	刘宜成, 李志鹏, 吕淳朴, 张涛, 刘彦. 基于动态时间调整的时空图卷积路网交通流量预测[J]. 交通运输系统工程与信息, 2022, 22(3): 147-157.
[9]	姚荣涵, 王荣贇, 张文松, 叶劲松, 孙锋. 基于生成对抗网络的交通流参数实时估计模型[J]. 交通运输系统工程与信息, 2022, 22(3): 158-167.
[10]	谢东繁, 贾惠迪, 李春艳, 赵小梅. 基于网格交通状态分类的行程时间规律挖掘与计算[J]. 交通运输系统工程与信息, 2022, 22(3): 168-178.
[11]	谢济铭, 彭博, 秦雅琴. 基于换道概率分布的多车道交织区元胞自动机模型[J]. 交通运输系统工程与信息, 2022, 22(3): 276-285.
[12]	郭烈, 胥林立, 秦增科, 王旭. 自动驾驶接管影响因素分析与研究进展[J]. 交通运输系统工程与信息, 2022, 22(2): 72-90.
[13]	徐猛, 刘涛, 钟绍鹏, 姜宇. 城市智慧公交研究综述与展望[J]. 交通运输系统工程与信息, 2022, 22(2): 91-108.
[14]	程君, 张立炎, 陈启宏. 一种基于地图辅助的自动驾驶视-惯融合定位方法[J]. 交通运输系统工程与信息, 2022, 22(2): 117-126.
[15]	王国栋, 刘立, 孟宇, 马智萍, 郑淏清, 顾青, 白国星. 一体式车辆避撞轨迹规划与跟踪控制[J]. 交通运输系统工程与信息, 2022, 22(2): 127-136.

应急车辆动态路径选择的两阶段优化模型

Emergency Vehicle Dynamic Path Selection Based on Two-stage Objective Optimization Model

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics