路网应急疏散理想与保守疏散时间流研究

交通运输系统工程与信息 ›› 2015, Vol. 15 ›› Issue (1): 167-172.

路网应急疏散理想与保守疏散时间流研究

马毅¹，严余松^*2

1. 西南交通大学交通运输与物流学院，成都610031；2. 四川师范大学计算机科学学院，成都610068

收稿日期:2014-06-30 修回日期:2014-12-16 出版日期:2015-02-25 发布日期:2016-02-25
作者简介:马毅（1986-），男，重庆合川人，博士生.
基金资助:
国家自然科学基金(61104175).

Research on Ideal and Conservative Time Flow for Emergency Evacuation on Road Network

MAYi¹, YAN Yu-song²

1. School of Transportation and Logistics, Southwest Jiaotong University, Chengdu 610031, China; 2. School of Computer Science, Sichuan Normal University, Chengdu 610068, China

Received:2014-06-30 Revised:2014-12-16 Online:2015-02-25 Published:2016-02-25

摘要/Abstract

摘要：

研究应急疏散问题的理想疏散时间流及保守疏散时间流对于估计真实突发事件下的疏散时间具有重要的指导意义.为此构建了理想疏散时间流与保守疏散时间流问题的数学规划模型，并借鉴经典网络流理论的最短路、最长路、最小费用流算法原理，设计了求解理想疏散时间流与保守疏散时间流的两个增广路算法.该算法不但可以求得理想疏散情况及最坏疏散情况下的流量分布，还可以计算出各自对应的理想疏散时间和保守疏散时间，从而识别出应急疏散总时间的范围域.最后通过算例演示了理想疏散时间流及保守疏散时间流的求解过程，并讨论了他们的变化特征.

关键词: 交通工程, 应急疏散时间, 时间流算法, 理想疏散时间, 保守疏散时间, 最小费用流

Abstract:

Studying ideal evacuation time flow and conservative evacuation time flow for emergency evacuation problem is significant to predict the evacuation time in the situation of emergency. In view of this objective, a mathematical programming model for ideal and conservative time flow is built, meanwhile, two flow- augmenting algorithm to solve this model is developed by means of theory of the shortest path, the longest path and the minimum profit flow, the algorithm can not only calculate the flow assignment in ideal and worst evacuation situation, but also can calculate the corresponding value of evacuation time respectively, further, identify the range of total evacuation time. Finally a demonstration example is used to demonstrate the calculation process of ideal and conservative time flow, as well as discussing its evolution properties.

Key words: traffic engineering, emergency evacuation time, time flow algorithm, ideal evacuation time, conservative evacuation time, minimum profit flow

中图分类号:

U491
O157.6

马毅，严余松. 路网应急疏散理想与保守疏散时间流研究[J]. 交通运输系统工程与信息, 2015, 15(1): 167-172.

MAYi, YAN Yu-song. Research on Ideal and Conservative Time Flow for Emergency Evacuation on Road Network[J]. Journal of Transportation Systems Engineering and Information Technology, 2015, 15(1): 167-172.

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

链接本文: http://www.tseit.org.cn/CN/abstract/abstract18940.shtml

http://www.tseit.org.cn/CN/Y2015/V15/I1/167

参考文献

[1] Chen C K, Li J, Zhang D. Study on evacuation behaviors at a T-shaped intersection by a force-driving cellular automata model[J]. Physica A: Statistical Mechanics and its Applications, 2012, 391(7): 2408-2420.

[2] Zheng Y, Jia B, Li X G, et al. Evacuation dynamics with fire spreading based on cellular automaton[J]. Physica A: Statistical Mechanics and its Applications, 2011, 390 (18): 3147-3156.

[3] Wang L, Liu M, Meng B. Incorporating topography in a cellular automata model to simulate residents evacuation in a mountain area in China[J]. Physica A: Statistical Mechanics and its Applications, 2013, 392 (3): 520-528.

[4] T J Cova, J P Johnson. A network flow model for lanebased evacuation routing[J]. Transportation Research Part A: Policy and Practice, 2003, 37(7): 579-604.

[5] Stevanus A，Tjandra. Earliest arrival flow with time dependent capacity approach to the evacuation problems[C]. Pedestrian and Evacuation Dynamics 2002, Berlin, Springer press, 2002: 267-276.

[6] Campos V B G, da Silva. Evacuation transportation planning: A method of identifying optimal independent routes[C]// Proceedings of Urban Transport V: Urban Transport and the Environment for the 21st Century, Southampton, WIT press, 2000: 555-564.

[7] H W Hamacher, S A Tjandra. Mathematical modelling of evacuation problems: A state of art[C]. Pedestrian and Evacuation Dynamics 2002, Berlin, Springer press, 2002: 227-266.

[8] Brachman M L, Dragicevic S. A spatially explicit network science model for emergency evacuations in an urban context[J]. Computers, Environment and Urban Systems, 2014, 312(44): 15-26.

[9] 高明霞, 贺国光. 考虑交叉口延误和通行能力优化疏散救援路线的最小费用流模型[J]. 系统工程, 2006, 24(9): 6-10. [GAO M X, HE G G. Using minimum cost flow model to optimize evacuation routes considering delays and capacity at intersections[J]. Systems Engineering, 2006, 24(9): 6-10.]

[10] 袁媛, 汪定伟. 灾害扩散实时影响下的应急疏散路径选择模型[J]. 系统仿真学报, 2008, 20(6): 1563-1566. [YUAN Y, WANG D W. Route selection model in emergency evacuation under real time effect of disaster extension[J]. Journal of System Simulation, 2008, 20(6): 1563-1566.]

[11] 宁宣熙. 阻塞流理论及其应用(第二版)[M]. 北京: 科学出版社, 2009. [NING X X. Blocking flow theory and its application (the second edition) [M]. Beijing: Science press, 2009.]

[1]	林建新, 刘博, 赵霞, 张蕾. 基于混合约束自编码器的机动车工况智能构建方法[J]. 交通运输系统工程与信息, 2022, 22(2): 109-116.
[2]	戢晓峰, 耿昭师. 山区双车道公路货车碰撞预测的双变量冲突极值模型[J]. 交通运输系统工程与信息, 2022, 22(2): 230-238.
[3]	张建波, 孙建平, 徐春玲, 郭镜霞, 温慧敏, 宋国华. 考虑交通运行条件影响的驾驶员特征聚类[J]. 交通运输系统工程与信息, 2022, 22(2): 330-336.
[4]	马景峰, 任刚, 李豪杰, 曹奇, 杜建玮. 电动自行车与机动车事故严重性影响因素分析[J]. 交通运输系统工程与信息, 2022, 22(2): 337-348.
[5]	宗芳, 王猛, 贺正冰. 考虑多车影响的分子动力学智能网联跟驰模型[J]. 交通运输系统工程与信息, 2022, 22(1): 37-48.
[6]	马小龙, 余强, 刘建蓓. 基于路侧毫米波雷达的车辆碰撞概率计算方法[J]. 交通运输系统工程与信息, 2022, 22(1): 57-66.
[7]	廖鹏, 唐铁桥. 基于车辆动力传动和转向系统的换道轨迹优化策略[J]. 交通运输系统工程与信息, 2022, 22(1): 98-105.
[8]	刘永红, 罗霞, 胡剑鹏. 考虑临时和预约需求的共享泊位动态分配方法[J]. 交通运输系统工程与信息, 2022, 22(1): 171-181.
[9]	袁振洲, 郭曼泽, 彭泳鑫, 杨洋. 基于梯度关联规则的老年行人交通事故风险识别[J]. 交通运输系统工程与信息, 2022, 22(1): 195-208.
[10]	张玉婷, 陈波佑, 张双焱, 闫学东, 李晓梦. 抵近信控交叉口分心驾驶识别模型[J]. 交通运输系统工程与信息, 2022, 22(1): 217-224.
[11]	宋浪, 王健, 杨滨毓, 安实. 连续流交叉口左转非机动车交通组织创新设计[J]. 交通运输系统工程与信息, 2022, 22(1): 225-233.
[12]	白婧荣, 唐伯明, 孙宗元, 毕辉云, 向恬君. 毗邻互通立交特长隧道驾驶负荷研究[J]. 交通运输系统工程与信息, 2022, 22(1): 301-310.
[13]	郭彦茹, 罗志雄, 王家川, 何方. 数据驱动的共享单车停放区规划方法研究[J]. 交通运输系统工程与信息, 2021, 21(6): 9-16.
[14]	李君羡, 沈宙彪, 童文聪, 吴志周. 基于分类车头时距的城市道路大型车影响分析[J]. 交通运输系统工程与信息, 2021, 21(6): 55-62.
[15]	卢凯, 周志洁, 张勇刚, 赵世杰, 徐广辉. 面向单向交通路网的绿波协调设计方法[J]. 交通运输系统工程与信息, 2021, 21(6): 74-83.