Modelling bus-based substitution capabilities for metro systems using bipartite graphs

被引:0
|
作者
Kopsidas, Athanasios [1 ]
Kepaptsoglou, Konstantinos [1 ]
机构
[1] Natl Tech Univ Athens, Sch Rural Surveying & Geoinformat Engn, 9 Iroon Polytech Str,Zografou Campus, Zografos 15780, Greece
关键词
complex networks; bipartite graph; metro service disruptions; bus system; network robustness; RAIL TRANSIT NETWORKS; COMPLEX NETWORKS; VULNERABILITY ANALYSIS; TRANSPORT NETWORK; ROBUSTNESS; SHANGHAI; CAPACITY;
D O I
10.1093/comnet/cnad050
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A disruption of metro services can have a negative impact in the performance of a city's transportation system and hinder mobility needs of travellers. Investigating the vulnerability of metro systems is required for planning mitigation actions, such as bus substitution services. This study develops a model, which consists of a bipartite graph and its projection to represent the bus substitution capabilities for metro networks. The proposed methodology effectively identifies significant substitution elements (bus lines), evaluates the robustness of alternative options in terms of both connectedness and connectivity, and suggests effective strategies for enhancing bus line capacity to improve network robustness. By applying the methodology to a real-world metro network, valuable insights are gained regarding important bus lines and substitution robustness. Study findings suggest that approaches based on the weighted degree exhibit the greatest effectiveness when it comes to connectivity and the overall efficiency of the network. These findings can assist public transport operators in proactively managing disruptions and improving their services.
引用
收藏
页数:17
相关论文
共 50 条
  • [31] Modelling gas turbine systems for transient performance using bond graphs
    Pedersen, E
    SIMULATION IN INDUSTRY 2001, 2001, : 785 - 791
  • [32] Energy-based advection modelling using bond graphs
    Gawthrop, Peter J.
    Pan, Michael
    JOURNAL OF THE ROYAL SOCIETY INTERFACE, 2022, 19 (195)
  • [33] Estimating control delays at signalised intersections using low-resolution transit bus-based global positioning system data
    Wang, Hua
    Zhang, Guohui
    Zhang, Zhisong
    Wang, Yinhai
    IET INTELLIGENT TRANSPORT SYSTEMS, 2016, 10 (02) : 73 - 78
  • [34] XPoint Cache: Scaling Existing Bus-Based Coherence Protocols for 2D and 3D Many-Core Systems
    Dreslinski, Ronald G.
    Manville, Thomas
    Sewell, Korey
    Das, Reetuparna
    Pinckney, Nathaniel
    Satpathy, Sudhir
    Blaauw, David
    Sylvester, Dennis
    Mudge, Trevor
    PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES (PACT'12), 2012, : 75 - 85
  • [35] Street-centric routing scheme using ant colony optimization-based clustering for bus-based vehicular ad-hoc network
    Khan, Zahid
    Fang, Sangsha
    Koubaa, Anis
    Fan, Pingzhi
    Abbas, Fakhar
    Farman, Haleem
    COMPUTERS & ELECTRICAL ENGINEERING, 2020, 86
  • [36] Unified aggregate component modelling of dynamic mechatronic systems using Bond Graphs
    Dickinson, SJ
    INTERNATIONAL JOURNAL OF ELECTRICAL ENGINEERING EDUCATION, 2004, 41 (04) : 328 - 340
  • [37] Modelling of switching systems in bond graphs using the concept of switched power junctions
    Umarikar, AC
    Umanand, L
    JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 2005, 342 (02): : 131 - 147
  • [38] Port-based modelling of multidomain physical systems in terms of bond graphs
    Breedveld, Peter
    SIMULATION TECHIQUES FOR APPLIED DYNAMICS, 2008, 507 : 141 - 190
  • [39] Recognizing Real-Time Transfer Patterns between Metro and Bus Systems Based on Spatial-Temporal Constraints
    Wu, Pan
    Xu, Lunhui
    Li, Jinlong
    Guo, Hengcong
    Huang, Zilin
    JOURNAL OF TRANSPORTATION ENGINEERING PART A-SYSTEMS, 2022, 148 (09)
  • [40] Towards the Modelling of Veillance based Citizen Profiling using Knowledge Graphs
    Munir, Siraj
    Jami, Syed Imran
    Wasi, Shaukat
    OPEN COMPUTER SCIENCE, 2021, 11 (01) : 294 - 304