期刊文献+

基于路网压缩的城市路网脆弱路段识别 被引量:5

Identification of Urban Road Vulnerability Based on Road Network Compression
下载PDF
导出
摘要 为了更高效地识别出突发环境下城市道路网络中的脆弱路段,首先通过网络特性分析,运用网络效率变化量与最大连通子图变化量这两类鲁棒性指标筛选出道路网络的潜在脆弱路段集合,并在此路段集合的基础上设计出一种基于可达性原理的路网矩阵压缩算法,该算法可将原始路网压缩成若干个彼此连通且相互独立的子路网。然后在压缩后的各个子路网上,考虑不同类型出行者对路段阻抗的随机估计偏差以及对应的路径选择行为,推导出一个多用户随机均衡配流模型并用MSA算法进行求解。最后通过改进原有的网络效率指标,构建出一个新的融合交通流随机分布特性的路网脆弱性指标,用来识别各子路网中的脆弱路段,再结合实测数据进行了模型验证。结果表明:相较于传统的遍历法,基于路网压缩的脆弱路段识别模型能够真实地刻画出突发环境下城市路网交通流分布的随机特性,而且求解模型所耗时间明显缩短(计算过程仅约2~3 min);该模型的求解结果对各个子路网中的脆弱路段有着更好的区分(区分度比传统的遍历法高出24.46%),这能够有效地降低传统识别方法对城市网络脆弱路段误判的可能性,并能够及时地为突发环境下的城市交通管理部门提供关于应急救援与人员疏散的决策支持。 In order to more effectively identify the vulnerable links on urban road network under sudden environment, first, by the network characteristic analysis, 2 robust indicators ( network efficiency variation and maximum connected sub-graph variation) are used to screen out the potential vulnerable link set of the road network, and a road network's matrix compression algorithm based on the accessibility principle is designed accordingly. This algorithm can compress the original road network into several interconnected and independent sub road networks. Then, on each compressed sub-network, considering the random estimation bias and path selection behavior of different travelers to the link impedance, a multi-user stochastic equilibrium flow assignment model is derived and the MSA algorithm is adopted to solve it. Finally, by improving the original network efficiency indicator, a new road network vulnerability indicator which combines the random distribution characteristics of traffic flow is constructed to identify the vulnerable links on each sub network, and the model is verified with the measured data. The result shows that ( 1 ) compared with the traditional traversing method, the vulnerable link identification model which is based on road network compression can truly depict the stochastic characteristics of traffic flow distribution on urban road network under sudden environment, and the time consumed to solve the model is significantly shortened ( the calculation process is only about 2-3 min);(2) the result of the model can better distinguish the vulnerable links on each road sub-network (its discrimination degree is 24. 46% higher than that of the traditional traversal method), which can effectively reduce the traditional method's misjudgement possibility of the vulnerable links on urban network, and can timely provide decision support about emergency rescue and evacuation for urban traffic management departments under sudden environment.
作者 李彦瑾 罗霞 LI Yan-jin;LUO Xia(School of Transportation and Logistic, Southwest Jiaotong University, Chengdu Sichuan 610031 , China)
出处 《公路交通科技》 CAS CSCD 北大核心 2019年第5期104-112,共9页 Journal of Highway and Transportation Research and Development
基金 国家自然科学基金项目(61673321) 四川省科技厅项目(2017JY0072)
关键词 城市交通 道路网络 脆弱性 路网压缩 算法复杂度 urban traffic road network vulnerability road network compression algorithm complexity
  • 相关文献

参考文献6

二级参考文献56

  • 1侯立文,蒋馥.城市道路网中路段相对重要性研究[J].系统工程理论方法应用,2004,13(5):425-428. 被引量:9
  • 2王晓丽,温冬海,张利分.交通网络重要路段确定方法研究[J].山西科技,2007(1):91-92. 被引量:3
  • 3Michael A. P. Taylor: Applying interactive colour graphics in traffic planning[J]. Computers & Graphics, 2007,11(3) : 241-248.
  • 4Michael G H Bell , Yasunori Iida. Transportation network analysis[M]. John Wiley & Son Inc,1997.
  • 5Yasunori Iida. Basic concepts and future directions of road network reliability analysis [J]. Journal of Advanced Transportation ,1999,33 (2) :125-134.
  • 6陈小峰,史忠科.交通控制系统导论[M].北京:科学出版社.
  • 7汪涛 方志耕.城市地铁网络的复杂性分析.军事交通学院学报,2008,2(10):42-48.
  • 8李志纯,朱道立.能力约束下的停车行为模型及其求解算法[J].中国公路学报,2007,20(5):89-94. 被引量:7
  • 9BERDICA K. An Introduction to Road Vulnerability: What Has Been Done, Is Done and Should Be Done [J]. Transport Policy, 2002,9(2) : 117-127.
  • 10SAREWITZ D,PIELKE J R R,KEYKHAH M. Vul- nerability and Risk: Some Thoughts from a Political and Policy Perspective [J]. Risk Analysis, 2003, 23 (4) ,805-810.

共引文献76

同被引文献52

引证文献5

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部