Abstract
K-shortest path is of great significance for urban rail mass transit operation and management especially in large-scale network. The paper has analyzed composite structure characteristics and proposed the route features of the network. According to the former analyses, the author put forward a new method to build a double-layer network model based on the train operation with the corresponding double-layer searching algorithm to solve the model in order to obtain the k-shortest paths. Finally, the rationality and effectiveness of the algorithm had been verified through the examples, which prove that it could provide a new method to get the optimal k-shortest path between different O-D pairs in large scale network, and the search efficiency could be increased more than 13%. As a path searching algorithm based on the train running timetable, it demonstrate decision support for the operation of urban rail mass transit.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
