IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v637y2024ics0378437124000918.html
   My bibliography  Save this article

A scenario model for enhancing the resilience of an urban rail transit network by adding new links

Author

Listed:
  • Yin, Yong
  • Chen, Jinqu
  • Chen, Zhuo
  • Du, Bo
  • Li, Baowen

Abstract

Adding new links to an existing urban rail transit (URT) network helps improve its operations by shortening passenger travel time under normal operations and disruptions. However, only a few studies have considered the impact of uncertain disruption occurrence stations on URT network design. This paper addresses this gap by proposing and solving a scenario model for determining the optimal scheme for adding new links to an existing URT network while considering the uncertainty of disruption occurrence stations. Numerical experiments are conducted on the Chengdu subway system to verify the effectiveness of the proposed model. Results indicate that disruptions occurring at a station result in an average performance loss of 0.61%. The scheme for adding new links obtained from this model helps improve network performance under normal operations and disruptions. The cumulative improved normal operating performance during the entire day and the ratio of improved weighted resilience metric are 1.638 and 24.59%, respectively. The solution of the proposed model is greatly affected by several parameters such as the total length of new links. Some useful suggestions for guiding URT network extensions are proposed based on the results of the sensitivity analysis of the above parameters.

Suggested Citation

  • Yin, Yong & Chen, Jinqu & Chen, Zhuo & Du, Bo & Li, Baowen, 2024. "A scenario model for enhancing the resilience of an urban rail transit network by adding new links," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 637(C).
    • Handle: RePEc:eee:phsmap:v:637:y:2024:i:c:s0378437124000918
    DOI: 10.1016/j.physa.2024.129583
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437124000918
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2024.129583?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Lebing Wang & Jian Gang Jin & Gleb Sibul & Yi Wei, 2023. "Designing Metro Network Expansion: Deterministic and Robust Optimization Models," Networks and Spatial Economics, Springer, vol. 23(1), pages 317-347, March.
    2. Jicun Zhang & Jiyou Fei & Xueping Song & Jiawei Feng, 2021. "An Improved Louvain Algorithm for Community Detection," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-14, November.
    3. T. L. Magnanti & R. T. Wong, 1984. "Network Design and Transportation Planning: Models and Algorithms," Transportation Science, INFORMS, vol. 18(1), pages 1-55, February.
    4. Linyuan Lü & Yi-Cheng Zhang & Chi Ho Yeung & Tao Zhou, 2011. "Leaders in Social Networks, the Delicious Case," PLOS ONE, Public Library of Science, vol. 6(6), pages 1-9, June.
    5. Farahani, Reza Zanjirani & Miandoabchi, Elnaz & Szeto, W.Y. & Rashidi, Hannaneh, 2013. "A review of urban transportation network design problems," European Journal of Operational Research, Elsevier, vol. 229(2), pages 281-302.
    6. Canca, David & De-Los-Santos, Alicia & Laporte, Gilbert & Mesa, Juan A., 2019. "Integrated Railway Rapid Transit Network Design and Line Planning problem with maximum profit," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 1-30.
    7. Laporte, Gilbert & Mesa, Juan A. & Perea, Federico, 2010. "A game theoretic framework for the robust railway transit network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 447-459, May.
    8. Zhang, Jianhua & Zhao, Mingwei & Liu, Haikuan & Xu, Xiaoming, 2013. "Networked characteristics of the urban rail transit networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(6), pages 1538-1546.
    9. Li, Qian & Zhou, Tao & Lü, Linyuan & Chen, Duanbing, 2014. "Identifying influential spreaders by weighted LeaderRank," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 404(C), pages 47-55.
    10. Pan, Shouzheng & Yan, Hai & He, Jia & He, Zhengbing, 2021. "Vulnerability and resilience of transportation systems: A recent literature review," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 581(C).
    11. Jin, Kun & Wang, Wei & Li, Xinran & Chen, Siyuan & Qin, Shaoyang & Hua, Xuedong, 2023. "Cascading failure in urban rail transit network considering demand variation and time delay," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 630(C).
    12. Guihaire, Valérie & Hao, Jin-Kao, 2008. "Transit network design and scheduling: A global review," Transportation Research Part A: Policy and Practice, Elsevier, vol. 42(10), pages 1251-1273, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Federico Perea & Mozart B. C. Menezes & Juan A. Mesa & Fernando Rubio-Del-Rey, 2020. "Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 442-474, July.
    2. Siying Zhu & Feng Zhu, 2020. "Multi-objective bike-way network design problem with space–time accessibility constraint," Transportation, Springer, vol. 47(5), pages 2479-2503, October.
    3. Javier Durán-Micco & Pieter Vansteenwegen, 2022. "A survey on the transit network design and frequency setting problem," Public Transport, Springer, vol. 14(1), pages 155-190, March.
    4. Javier Duran & Lorena Pradenas & Victor Parada, 2019. "Transit network design with pollution minimization," Public Transport, Springer, vol. 11(1), pages 189-210, June.
    5. Zhong Wang & Fengmin Lan & Zijing Lin & Lian Lian, 2021. "A Heuristic Method for Bus Rapid Transit Planning Based on the Maximum Trip Service," Sustainability, MDPI, vol. 13(11), pages 1-12, June.
    6. Arbex, Renato Oliveira & da Cunha, Claudio Barbieri, 2015. "Efficient transit network design and frequencies setting multi-objective optimization by alternating objective genetic algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 355-376.
    7. Weckström, Christoffer & Mladenović, Miloš N. & Kujala, Rainer & Saramäki, Jari, 2021. "Navigability assessment of large-scale redesigns in nine public transport networks: Open timetable data approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 147(C), pages 212-229.
    8. Tong, Lu & Zhou, Xuesong & Miller, Harvey J., 2015. "Transportation network design for maximizing space–time accessibility," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 555-576.
    9. Cancela, Héctor & Mauttone, Antonio & Urquhart, María E., 2015. "Mathematical programming formulations for transit network design," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 17-37.
    10. Jose L. Walteros & Andrés L. Medaglia & Germán Riaño, 2015. "Hybrid Algorithm for Route Design on Bus Rapid Transit Systems," Transportation Science, INFORMS, vol. 49(1), pages 66-84, February.
    11. Szeto, W.Y. & Jiang, Y., 2014. "Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 235-263.
    12. Evert Vermeir & Javier Durán-Micco & Pieter Vansteenwegen, 2022. "The grid based approach, a fast local evaluation technique for line planning," 4OR, Springer, vol. 20(4), pages 603-635, December.
    13. Loder, Allister & Bliemer, Michiel C.J. & Axhausen, Kay W., 2022. "Optimal pricing and investment in a multi-modal city — Introducing a macroscopic network design problem based on the MFD," Transportation Research Part A: Policy and Practice, Elsevier, vol. 156(C), pages 113-132.
    14. Xing Tang & Qiguang Miao & Shangshang Yu & Yining Quan, 2016. "A Data-Based Approach to Discovering Multi-Topic Influential Leaders," PLOS ONE, Public Library of Science, vol. 11(7), pages 1-14, July.
    15. Liang, Jinpeng & Wu, Jianjun & Gao, Ziyou & Sun, Huijun & Yang, Xin & Lo, Hong K., 2019. "Bus transit network design with uncertainties on the basis of a metro network: A two-step model framework," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 115-138.
    16. David Canca & Belén Navarro-Carmona & Gabriel Villa & Alejandro Zarzo, 2023. "A Multilayer Network Approach for the Bimodal Bus–Pedestrian Line Planning Problem," Mathematics, MDPI, vol. 11(19), pages 1-36, October.
    17. Elnaz Miandoabchi & Reza Farahani & W. Szeto, 2012. "Bi-objective bimodal urban road network design using hybrid metaheuristics," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(4), pages 583-621, December.
    18. Chaocheng He & Jiang Wu & Qingpeng Zhang, 2021. "Characterizing research leadership on geographically weighted collaboration network," Scientometrics, Springer;Akadémiai Kiadó, vol. 126(5), pages 4005-4037, May.
    19. Khooban, Zohreh & Farahani, Reza Zanjirani & Miandoabchi, Elnaz & Szeto, W.Y., 2015. "Mixed network design using hybrid scatter search," European Journal of Operational Research, Elsevier, vol. 247(3), pages 699-710.
    20. Hadi Karimi & Bahador Ghadirifaraz & Seyed Nader Shetab Boushehri & Seyyed-Mohammadreza Hosseininasab & Narges Rafiei, 2022. "Reducing traffic congestion and increasing sustainability in special urban areas through one-way traffic reconfiguration," Transportation, Springer, vol. 49(1), pages 37-60, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:637:y:2024:i:c:s0378437124000918. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.