Simulation on Survivability and Cascading Failure Propagation of Urban Subway-Bus Compound Network
-
摘要: 为研究城市公共交通复合网络的拓扑结构特性，在构建多方式、多层次拓扑网络的基础上，对以成都市为例的地铁-公交复合网络在袭击与拥堵下的有效性进行了分析.运用复杂网络理论，首先测度地铁-公交复合网络在不同袭击模式下的静态抗毁性，以评判复合网络中节点与连边的重要度；其后对突发性事故下地铁客流拥堵的传播扩散现象与级联失效过程进行仿真分析，通过对受阻客流在复合网络中传播性的分析，评判复合网络中地铁线路与沿线公交线路应急协调能力的匹配度.研究结果表明：在随机、蓄意两种袭击下，地铁-公交复合网络的最大连通度与网络效率的降幅与降速均低于地铁子网络与地面公交子网络，复合网络整体效能优于单一网络；基于有无容量限制下成都市8条地铁线路的拥堵失效仿真结果，能够评估其沿线既有公交线路的应急疏运能力，从而制定具有针对性的策略措施，以应对突发性事故下复合网络的过载情况.Abstract: To study the topological characteristics of urban public transit compound network, the validity of urban subway-bus compound network in Chengdu under attack&congestion was analyzed by constructing multimode topology network. Through the complex network theory, firstly, the static invulnerability of urban subway-bus compound network under different attack modes was tested to judge the importance degree of relevant nodes and lines. Then, the propagation of network overload and/or congestion, the cascading failure process under subway emergency were measured, so as to estimate the emergency coordinative performance of the ground public transportation system adjacent to metro lines. The results indicate that compound network has better overall efficiency than single network according to the lower decreasing amplitude and speed droop of the indices of network efficiency under random and intentional attack. In the opinion of the simulation results of cascading failure features of eight metro lines in Chengdu under the emergency episode with&without restrictive capacity, the emergency response capability of the bus lines system along the metro lines can be measured and judged effectively, in order to implementing pointed and efficient strategies&measures to handle the flow overload of the compound network arising from sudden accidents.
-
Key words:
- urban traffic /
- complex network /
- subway-bus compound network /
- survivability /
- cascading failure
-
图 2 成都市地铁-公交复合网络拓扑结构示意图
Figure 2. Topological diagram of Chengdu subway-bus compound networks
图 4 复合网络与子网络最大连通度对比
Figure 4. Comparison of maximal connected degree of compound network and its two sub-networks under random attack
图 5 复合网络与子网络全局效率对比
Figure 5. Comparison of global efficiency of compound network and its two sub-networks under random attack
图 6 复合网络与子网络最大连通度对比
Figure 6. Comparison of maximal connected degree of compound network and its two sub-networks under intentional attack
图 7 复合网络与子网络全局效率对比
Figure 7. Comparison of global efficiency of compound network and its two sub-networks under intentional attack
图 8 有无容量限制下的网络失效度对比
Figure 8. Network failure degree comparison with&without restrictive capacity
图 9 有无容量限制下的平均超负荷系数对比
Figure 9. Average overload factor comparison with&without restrictive capacity
表 1 非容量限制下与容量限制下的仿真实验结果
Table 1. Simulation results without&with restrictive capacity
线路序号 失效线路 非容量限制下仿真 容量限制下仿真 节点失效度 平均超负荷系数 连边失效数/条 节点失效度 平均超负荷系数 连边失效数/条 总流量
/(人·次)未分配流量/(人·次) 1 1号线 0.003 9 0.591 7 51 0.003 2 0.558 1 41 120 573 5 413 2 2号线 0.005 1 0.636 9 66 0.005 5 0.596 6 72 137 501 14 845 3 3号线 0.008 9 0.643 9 115 0.007 7 0.610 3 100 136 672 7 737 4 4号线 0.005 6 0.670 4 73 0.005 0 0.597 6 65 101 145 16 269 5 5号线 0.003 5 0.560 6 46 0.002 5 0.547 3 33 112 916 22 482 6 6号线 0.001 8 0.529 2 24 0.001 5 0.524 1 20 103 494 6 588 7 7号线 0.003 8 0.567 1 49 0.003 0 0.566 0 39 146 372 214 8 10号线 0.000 0 0.449 0 0 0.000 0 0.442 4 0 1 593 0 
下载: 导出CSV
-
ALBERT R, JEONG H, BARABASI A L. Attack and error tolerance in complex networks[J]. Nature, 2000, 406(6794):387-482. http://d.old.wanfangdata.com.cn/OAPaper/oai_arXiv.org_cond-mat%2f0008064 ALBERT R, BARABÁSI A L. Statistical mechanics of complex networks[J]. Lecture Notes in Physics, 2001, 74(1):1-54. http://d.old.wanfangdata.com.cn/OAPaper/oai_arXiv.org_cond-mat%2f0106096 HOLME P, KIM B J, YOON C N, et al. Attack vulnerability of complex networks[J]. Physical Review E Statistical Nonlinear & Soft Matter Physics, 2004, 65(5):634-643. doi: 10.1103-PhysRevE.65.056109/ LATORA V, MARCHIORI M. Is the Boston subway a small world network?[J]. Physical A, 2002, 314(1/2/3/4):109-113. http://d.old.wanfangdata.com.cn/OAPaper/oai_arXiv.org_cond-mat%2f0202299 SEATON K A, HACKETT L M.Stations, trains and small world networks[J]. Physical A, 2004, 339(3/4):635-644. http://d.old.wanfangdata.com.cn/OAPaper/oai_arXiv.org_cond-mat%2f0311254 SIENKIEWIEZ J, HOLYST J A. Statistical analysis of 22 public transport networks in Poland[J]. Physical Review E Statistical Nonlinear & Soft Matter Physics, 2005, 72(4):046127/1-046127/11. doi: 10.1103-PhysRevE.72.046127/ MOTTER A E. Cascade control and defense in complex networks[J]. Physical Review Letters, 2004, 93(9):098701/1-098701/4. doi: 10.1103-PhysRevLett.93.098701/ ZHAO L, PARK K, LAI Y C. Attack vulnerability of scale-free networks due to cascading breakdown[J]. Physical Review E Statistical Nonlinear & Soft Matter Physics, 2004, 70(3):035101/1-035101/4. doi: 10.1103-PhysRevE.70.066617/ ZHAO L, PARK K, LAI Y C, et al.Tolerance of scale-free networks against attack-induced cascades[J]. Physical Review E Statistical Nonlinear & Soft Matter Physics, 2005, 72(2):986-1023. http://www.wanfangdata.com.cn/details/detail.do?_type=perio&id=9ad23823c5b20cc9434b31c4d4acbc32 CRUCITTI P, LATORA V, MARCHIORI M. Model for cascading failures in complex networks[J]. Physical Review E Statistical Nonlinear & Soft Matter Physics, 2004, 69(2):266-289. http://d.old.wanfangdata.com.cn/Periodical/xtfzxb201107034 高洁, 施其洲.城市轨道网络抗毁可靠性定义及评价指标模型研究[J].铁道学报, 2007, 29(3):29-33. doi: 10.3321/j.issn:1001-8360.2007.03.006GAO Jie, SHI Qizhou. Definition and evaluation modeling of metro network invulnerability[J]. Journal of the China Railway Society, 2007, 29(3):29-33. doi: 10.3321/j.issn:1001-8360.2007.03.006 ZHANG J H, XU X M, HONG L, et al. Networked analysis of the Shanghai subway network in China[J]. Physica A:Statistical Mechanics&its Applications, 2011, 390(23):4562-4570. http://www.wanfangdata.com.cn/details/detail.do?_type=perio&id=3b6dee450ea5746e775b74c546ab08ff 欧雯.恐怖袭击下城市轨道交通网络抗毁性分析[D].成都: 西南交通大学, 2014. http://cdmd.cnki.com.cn/Article/CDMD-10613-1014252459.htm 汪涛, 吴琳丽.基于复杂网络的城市公交网络抗毁性分析[J].计算机应用研究, 2010, 27(11):4084-4086. http://d.old.wanfangdata.com.cn/Periodical/jsjyyyj201011020WANG Tao, WU Linli. Research on invulnerability of urban transit network based on complex network[J]. Application Research of Computers, 2010, 27(11):4084-4086. http://d.old.wanfangdata.com.cn/Periodical/jsjyyyj201011020 陈静, 孙林夫.复杂网络中节点重要度评估[J].西南交通大学学报, 2009, 44(3):426-429. doi: 10.3969/j.issn.0258-2724.2009.03.021CHEN Jing, SUN Linfu. Evaluation of node importance in complex networks[J]. Journal of Southwest Jiaotong University, 2009, 44(3):426-429. doi: 10.3969/j.issn.0258-2724.2009.03.021 范文礼, 刘志刚.基于传输效率矩阵的复杂网络节点重要度排序方法[J].西南交通大学学报, 2014, 49(2):337-342. doi: 10.3969/j.issn.0258-2724.2014.02.023FAN Wenli, LIU Zhigang. Ranking method for node importance based on efficiency matrix[J]. Journal of Southwest Jiaotong University, 2014, 49(2):337-342. doi: 10.3969/j.issn.0258-2724.2014.02.023 谢丰, 程苏琦, 陈冬青, 等.基于级联失效的复杂网络抗毁性[J].清华大学学报:自然科学版, 2011, 51(10):1252-1257. http://d.old.wanfangdata.com.cn/Conference/7597768XIE Feng, CHENG Suqi, CHEN Dongqing, et al. Cascade-based attack vulnerability in complex networks[J]. Journal of Tsinghua University:Sci & Tech, 2011, 51(10):1252-1257. http://d.old.wanfangdata.com.cn/Conference/7597768 窦炳琳, 张世永.复杂网络上级联失效的负载容量模型[J].系统仿真学报, 2011(7):1459-1463. http://d.old.wanfangdata.com.cn/Periodical/xtfzxb201107034DOU Binglin, ZHANG Shiyong. Load-capacity model for cascading failures of complex networks[J]. Journal of System Simulation, 2011(7):1459-1463. http://d.old.wanfangdata.com.cn/Periodical/xtfzxb201107034 陈世明, 庞少鹏, 邹小群, 等.面向级联失效的加权网络负载容量非线性模型鲁棒性优化[J].控制与决策, 2013, 28(7):1041-1045. http://d.old.wanfangdata.com.cn/Periodical/kzyjc201307015CHEN Shiming, PANG Shaopeng, ZOU Xiaoqun, et al. Robustness optimization of load-capacity nonlinear model in weighted network for cascading failure[J]. Control and Decision, 2013, 28(7):1041-1045. http://d.old.wanfangdata.com.cn/Periodical/kzyjc201307015 金键, 梅丽, 周家中, 等.成都市城市快速轨道交通建设规划(2012-2017)客流预测研究[R].成都: 西南交通大学, 2011. 段凡丁.关于最短路径的SPFA快速算法[J].西南交通大学学报, 1994, 29(2):207-212. http://manu19.magtech.com.cn/Jweb_xnjd/CN/abstract/abstract10224.shtmlDUAN Fanding. A faster algorithm for shortest-path SPFA[J]. Journal of Southwest Jiaotong University, 1994, 29(2):207-212. http://manu19.magtech.com.cn/Jweb_xnjd/CN/abstract/abstract10224.shtml -
下载:
点击查看大图
图(9) / 表(1)
计量
- 文章访问数: 710
- HTML全文浏览量: 247
- PDF下载量: 182
- 被引次数: 0