Valid Path Searching of an Interrupted Urban Rail Transit Network

Abstract

AbstractA 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.