成都地铁网络的关键节点识别方法及性能分析
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Identification of key nodes in Chengdu metro network and analysis of network performance
  • 作者:薛锋 ; 何传磊 ; 黄倩
  • 英文作者:XUE Feng;HE Chuanlei;HUANG Qian;School of Transportation and Logistics, Southwest Jiaotong University;National United Engineering Laboratory of Integrated and Intelligent Transportation, Southwest Jiaotong University;
  • 关键词:城市轨道交通 ; 复杂网络 ; 拓扑结构 ; 关键节点 ; 网络性能
  • 英文关键词:urban rail transit;;complex network;;topology structure;;key node;;network performance
  • 中文刊名:ZAQK
  • 英文刊名:China Safety Science Journal
  • 机构:西南交通大学交通运输与物流学院;综合交通运输智能化国家地方联合工程实验室;
  • 出版日期:2019-01-15
  • 出版单位:中国安全科学学报
  • 年:2019
  • 期:v.29
  • 基金:国家重点研发计划项目(2017YFB1200702);; 成都市软科学研究项目(2017-RK00-00388-ZF);; 西南交通大学“双一流”建设项目(交通软科学类)(JDSYLYB2018030)
  • 语种:中文;
  • 页:ZAQK201901016
  • 页数:7
  • CN:01
  • ISSN:11-2865/X
  • 分类号:97-103
摘要
为提高地铁网络性能分析的精度,基于复杂网络理论分析成都地铁网络的拓扑特性,构建节点重要度评价指标体系,应用灰色关联和逼近理想解法(TOPSIS)综合评价排序136个节点,完成关键节点的识别;采用网络效率等4个参数作为网络性能衡量指标,观察30个关键节点被蓄意攻击、106个普通节点被随机攻击后的网络性能变化趋势。结果表明:成都地铁网络在Space L模型下平均度为2.147,平均路径长度为13.146 5,网络介数、连通度、效率等指标较低,并识别出以成都东客站为首的30个关键节点;蓄意、随机攻击下网络效率与自然连通度下降趋势较慢,网络连通度与最大连通子图的下降趋势较快。
        In order to improve the accuracy of metro network performance analysis, topological structures of Chengdu metro network were studied based on complex network theory, an evaluation index system of node importance was constructed, 136 nodes were evaluated by using grey correlation and Technique for Order Preference by Similarity to an Ideal Solution(TOPSIS) method to identify key nodes. Four parameters such as network efficiency were used as network performance indicators. Trends in network performance were observed after 30 key nodes were attacked maliciously and 106 common nodes randomly. The results show that the average degree of the Chengdu metro network is 2.147, the average path length is 13.146 5 under the Space L model, the network betweenness, connectivity and efficiency are low, and the East Passenger Station(56) ranks first in 30 key nodes, and that both malicious and random attacks will make the network efficiency and the natural connectivity decrease slowly, but will make both the network connectivity and the maximal connected subgraph decrease faster.
引文
[1] 叶青.基于复杂网络理论的轨道交通网络脆弱性分析[J].中国安全科学学报,2012,22(2):122-126.YE Qing. Vulnerability analysis of rail transit based on complex network theory [J]. China Safety Science Journal, 2012, 22(2): 122-126.
    [2] 张晋,梁青槐,贺晓彤.北京市地铁网络拓扑结构复杂性研究[J].北京交通大学学报,2013,37(6):78-84.ZHANG Jin, LIANG Qinghuai, HE Xiaotong. Study on the complexity of Beijing metro network [J]. Journal of Beijing Jiaotong University, 2013, 37(6): 78-84.
    [3] 徐青刚.铁路运输系统的网络模型及其抗毁性研究[D].南昌:华东交通大学,2015.XU Qinggang. Network model and research on invulnerability for the railway transportation system [D]. Nanchang: East China Jiaotong University, 2015.
    [4] 殷勇,刘杰.铁路网络的抗毁性分析研究[J].综合运输,2017(4):55-59.YIN Yong, LIU Jie. The survivability of railway network [J]. China Transportation Review, 2017(4): 55-59.
    [5] YANG Yuhao, LIU Yongxue, ZHOU Minxi, et al. Robustness assessment of urban rail transit based on complex network theory: a case study of the Beijing subway[J]. Safety Science, 2015, 79: 149-162.
    [6] 于宝,冯春,朱倩,等.中国高速铁路网络脆弱性分析[J].中国安全科学学报,2017,27(9):110-115.YU Bao, FENG Chun, ZHU Qian, et al. Vulnerability analysis of China's high speed railway network [J]. China Safety Science Journal, 2017, 27(9): 110-115.
    [7] 吴建军.城市交通网络拓扑结构复杂性研究[D].北京: 北京交通大学,2008.WU Jianjun. Studies on the complexity of topology structure in the urban traffic network [D]. Beijing: Beijing Jiaotong University, 2008.
    [8] 赵德.多方式公共交通资源耦合效能评价[D].南京: 东南大学,2016.ZHAO De. Evaluation on multimodal public transit resources integration [D]. Nanjing: Southeast University, 2016.
    [9] 彭景新.南京市区公交、地铁加权复合网络建模与实证分析[D].南京:南京邮电大学,2017.PENG Jingxin. Modeling and empirical analysis of bus and subway weighted composite network in Nanjing [D]. Nanjing: Nanjing University of Posts and Telecommunications, 2017.
    [10] 王班,马润年,王刚.基于自然连通度的复杂网络抗毁性研究[J].计算机仿真,2015,32(8):315-318.WANG Ban, MA Runnian, WANG Gang. Research on invulnerability of complex networks based on natural connectivity [J]. Computer Simulation, 2015, 32(8): 315-318.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700