A valid path searching method was applied in an interrupted urban rail transit network line to determine a rapid, accurate, and easy path for evacuating stranded passengers. The method is based on the established urban rail transit network model and considers the characteristics of interrupted rail networks. Valid paths were redefined with constraint conditions, such as fault points, maximum transfer times, and generalized cost. The depth-first algorithm was also improved, and the valid path searching model for interrupted urban rail transit network lines was established. The model was validated in Shanghai Metro Network, an interrupted urban rail transit, by using the C# programming language. Results show that when People Square station is interrupted, five valid paths can be searched between Shanghai West Railway station and Pudong International Airport station with constraints.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Valid Path Searching of an Interrupted Urban Rail Transit Network


    Contributors:
    Han, Xue (author) / Wang, Di (author) / Liu, Ying-shun (author) / Guo, Tang-yi (author)


    Publication date :

    2016-05-16


    Size :

    52016-01-01 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown



    Topology transformation-based multi-path algorithm for urban rail transit network

    Hao, Yuanyuan / Si, Bingfeng / Zhao, Chunliang | Elsevier | 2021


    Urban Rail Transit Network Fare Analysis

    Yang, Ke ;Jia, Jun Fang | Trans Tech Publications | 2014


    Controllability of Urban Rail Transit Network

    Zeng, Lu / Qin, Yong / Liu, Jun et al. | British Library Conference Proceedings | 2018


    Path planning method based on urban rail transit information

    WANG LEI / ZHANG ZHANFENG / ZHU ZHENDE et al. | European Patent Office | 2024

    Free access

    URBAN RAIL TRANSIT VEHICLE

    SUN BANGCHENG / HUANG LIEWEI / LI MINGGAO et al. | European Patent Office | 2017

    Free access