IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v11y2019i22p6275-d284880.html
   My bibliography  Save this article

Partial Node Failure in Shortest Path Network Problems

Author

Listed:
  • Qian Ye

    (Department of Geography, University of Tennessee, Knoxville, TN 37996, USA)

  • Hyun Kim

    (Department of Geography, University of Tennessee, Knoxville, TN 37996, USA)

Abstract

This paper investigates the impact of partial node failure from the perspective of shortest path network problems. We propose a network model that we call shortest path network problems for partial node failure, designed to examine the influence of partial node failures in a flow-based network using a set of indicators. The concept of partial node failure was applied to a special type of hub station, a mandatory transfer in subway or railway systems where multiple lines are arranged for the transfer of passengers. Numerical experiments were carried out on the Washington Metropolitan Area Transit Authority network (WMATA). The results or analysis detail how changes in flow distribution in the network were measured when a station partially failed, as well as ways of identifying heavily impacted stations with respect to different indicators. Various partial node failure scenarios were simulated for origin–destination (OD) flows by days, providing comprehensive information with which to evaluate plans for partial node failures, such as those related to scheduling maintenance, along with insights with which to make contingent plans for potential closure of stations. A major finding emphasizes that the rankings of station criticality are highly sensitive to the different OD flows by days when partial node failures are assumed in network modeling.

Suggested Citation

  • Qian Ye & Hyun Kim, 2019. "Partial Node Failure in Shortest Path Network Problems," Sustainability, MDPI, vol. 11(22), pages 1-21, November.
    • Handle: RePEc:gam:jsusta:v:11:y:2019:i:22:p:6275-:d:284880
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/11/22/6275/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/11/22/6275/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Qian Ye & Hyun Kim, 2019. "Assessing network vulnerability of heavy rail systems with the impact of partial node failures," Transportation, Springer, vol. 46(5), pages 1591-1614, October.
    2. Paola Cappanera & Maria Paola Scaparra, 2011. "Optimal Allocation of Protective Resources in Shortest-Path Networks," Transportation Science, INFORMS, vol. 45(1), pages 64-80, February.
    3. Tony H. Grubesic & Timothy C. Matisziw & Alan T. Murray & Diane Snediker, 2008. "Comparative Approaches for Assessing Network Vulnerability," International Regional Science Review, , vol. 31(1), pages 88-112, January.
    4. Wang, Li & Yang, Lixing & Gao, Ziyou, 2016. "The constrained shortest path problem with stochastic correlated link travel times," European Journal of Operational Research, Elsevier, vol. 255(1), pages 43-57.
    5. Shi, Ning & Zhou, Shaorui & Wang, Fan & Tao, Yi & Liu, Liming, 2017. "The multi-criteria constrained shortest path problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 101(C), pages 13-29.
    6. Morton E O'Kelly & Hyun Kim & Changjoo Kim, 2006. "Internet Reliability with Realistic Peering," Environment and Planning B, , vol. 33(3), pages 325-343, June.
    7. Santos, Luis & Coutinho-Rodrigues, João & Current, John R., 2007. "An improved solution algorithm for the constrained shortest path problem," Transportation Research Part B: Methodological, Elsevier, vol. 41(7), pages 756-771, August.
    8. Hanif D. Sherali & Antoine G. Hobeika & Sasikul Kangwalklai, 2003. "Time-Dependent, Label-Constrained Shortest Path Problems with Applications," Transportation Science, INFORMS, vol. 37(3), pages 278-293, August.
    9. Sullivan, J.L. & Novak, D.C. & Aultman-Hall, L. & Scott, D.M., 2010. "Identifying critical road segments and measuring system-wide robustness in transportation networks with isolating links: A link-based capacity-reduction approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 44(5), pages 323-336, June.
    10. Hyun Kim & Megan S. Ryerson, 2017. "The q-Ad Hoc Hub Location Problem for Multi-modal Networks," Networks and Spatial Economics, Springer, vol. 17(3), pages 1015-1041, September.
    11. Haywood, Luke & Koning, Martin, 2015. "The distribution of crowding costs in public transport: New evidence from Paris," Transportation Research Part A: Policy and Practice, Elsevier, vol. 77(C), pages 182-201.
    12. Timothy Matisziw & Alan Murray & Tony Grubesic, 2010. "Strategic Network Restoration," Networks and Spatial Economics, Springer, vol. 10(3), pages 345-361, September.
    13. Timothy Matisziw & Alan Murray & Tony Grubesic, 2009. "Exploring the vulnerability of network infrastructure to disruption," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 43(2), pages 307-321, June.
    14. Chen, Yen-Liang & Yang, Hsu-Hao, 2000. "Shortest paths in traffic-light networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(4), pages 241-253, May.
    15. Strehler, Martin & Merting, Sören & Schwan, Christian, 2017. "Energy-efficient shortest routes for electric and hybrid vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 111-135.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Qingjie Qi & Yangyang Meng & Xiaofei Zhao & Jianzhong Liu, 2022. "Resilience Assessment of an Urban Metro Complex Network: A Case Study of the Zhengzhou Metro," Sustainability, MDPI, vol. 14(18), pages 1-19, September.

    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. Aybike Ulusan & Ozlem Ergun, 2018. "Restoration of services in disrupted infrastructure systems: A network science approach," PLOS ONE, Public Library of Science, vol. 13(2), pages 1-28, February.
    2. Shen, Liang & Shao, Hu & Wu, Ting & Fainman, Emily Zhu & Lam, William H.K., 2020. "Finding the reliable shortest path with correlated link travel times in signalized traffic networks under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    3. Gokhan Karakose & Ronald G. McGarvey, 2019. "Optimal Detection of Critical Nodes: Improvements to Model Structure and Performance," Networks and Spatial Economics, Springer, vol. 19(1), pages 1-26, March.
    4. Karakose, Gokhan & McGarvey, Ronald G., 2018. "Capacitated path-aggregation constraint model for arc disruption in networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 225-238.
    5. Novak, D.C. & Sullivan, J.F. & Sentoff, K. & Dowds, J., 2020. "A framework to guide strategic disinvestment in roadway infrastructure considering social vulnerability," Transportation Research Part A: Policy and Practice, Elsevier, vol. 132(C), pages 436-451.
    6. Rodríguez-Núñez, Eduardo & García-Palomares, Juan Carlos, 2014. "Measuring the vulnerability of public transport networks," Journal of Transport Geography, Elsevier, vol. 35(C), pages 50-63.
    7. Chaya Losada & M. Scaparra & Richard Church & Mark Daskin, 2012. "The stochastic interdiction median problem with disruption intensity levels," Annals of Operations Research, Springer, vol. 201(1), pages 345-365, December.
    8. Victor Cantillo & Luis F. Macea & Miguel Jaller, 2019. "Assessing Vulnerability of Transportation Networks for Disaster Response Operations," Networks and Spatial Economics, Springer, vol. 19(1), pages 243-273, March.
    9. Kashin Sugishita & Yasuo Asakura, 2021. "Vulnerability studies in the fields of transportation and complex networks: a citation network analysis," Public Transport, Springer, vol. 13(1), pages 1-34, March.
    10. Starita, Stefano & Scaparra, Maria Paola, 2016. "Optimizing dynamic investment decisions for railway systems protection," European Journal of Operational Research, Elsevier, vol. 248(2), pages 543-557.
    11. Ghavami, Seyed Morsal, 2019. "Multi-criteria spatial decision support system for identifying strategic roads in disaster situations," International Journal of Critical Infrastructure Protection, Elsevier, vol. 24(C), pages 23-36.
    12. David Corredor-Montenegro & Nicolás Cabrera & Raha Akhavan-Tabatabaei & Andrés L. Medaglia, 2021. "On the shortest $$\alpha$$ α -reliable path problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 287-318, April.
    13. Hyun Kim & Yena Song, 2018. "An integrated measure of accessibility and reliability of mass transit systems," Transportation, Springer, vol. 45(4), pages 1075-1100, July.
    14. Zhao, Chen & Li, Nan & Fang, Dongping, 2018. "Criticality assessment of urban interdependent lifeline systems using a biased PageRank algorithm and a multilayer weighted directed network model," International Journal of Critical Infrastructure Protection, Elsevier, vol. 22(C), pages 100-112.
    15. Morton O’Kelly, 2015. "Network Hub Structure and Resilience," Networks and Spatial Economics, Springer, vol. 15(2), pages 235-251, June.
    16. Federico Rupi & Silvia Bernardi & Guido Rossi & Antonio Danesi, 2015. "The Evaluation of Road Network Vulnerability in Mountainous Areas: A Case Study," Networks and Spatial Economics, Springer, vol. 15(2), pages 397-411, June.
    17. Annunziata Esposito Amideo & Stefano Starita & Maria Paola Scaparra, 2019. "Assessing Protection Strategies for Urban Rail Transit Systems: A Case-Study on the Central London Underground," Sustainability, MDPI, vol. 11(22), pages 1-21, November.
    18. Shi, Ning & Zhou, Shaorui & Wang, Fan & Tao, Yi & Liu, Liming, 2017. "The multi-criteria constrained shortest path problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 101(C), pages 13-29.
    19. Elías Escobar-Gómez & J.L. Camas-Anzueto & Sabino Velázquez-Trujillo & Héctor Hernández-de-León & Rubén Grajales-Coutiño & Eduardo Chandomí-Castellanos & Héctor Guerra-Crespo, 2019. "A Linear Programming Model with Fuzzy Arc for Route Optimization in the Urban Road Network," Sustainability, MDPI, vol. 11(23), pages 1-18, November.
    20. Richard Connors & David Watling, 2015. "Assessing the Demand Vulnerability of Equilibrium Traffic Networks via Network Aggregation," Networks and Spatial Economics, Springer, vol. 15(2), pages 367-395, June.

    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:gam:jsusta:v:11:y:2019:i:22:p:6275-:d:284880. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.