Temporal path searching algorithm of urban rail transit network
ZHOU Weiteng
HAN Baoming
Abstract：A new method on searching the dynamic and temporal k-shortest paths in the urban rail transit network is put forward in this paper,which can be used to solved the dynamic path searching problem in huge scale network.The algorithm can be divided into two part:firstly,the static k-shortest path of the network can be searched based on depth-first deletion algorithm;then the temporal path can be obtained and sorted by the train arrival and departure time expanding in the schedule.The effectiveness of the algorithm proposed in this paper is verified in comparison with the existing algorithm through the case study in Beijing subway network,and the temporal k-shortest path in the network based on the train schedule can be obtained accurately,which demonstrates that it could provide decision support for the operation and travel guidance of path management in urban rail transit network.
Keywords：urban rail transitpath searchingk-shortest pathtemporal pathscheduleexpand
Publication Date：2017-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：8( 115-122 )