A Modified K-Shortest Paths Algorithm for Solving the Earliest Arrival Problem on the Time-Dependent Model of Transportation Systems

arrival problem on the timetable information-based public transportation systems. The problem is like this: given a departure time window at station A, find K best itineraries from station A to station B in terms of the earliest arrival time at station B. There are two typical models for the timetable information, the time-expanded and the time-dependent models. The K-earliest arrival problem can be solved on the time-expanded model by using the classical K-shortest paths algorithms for static networks. In this paper, we modified one of these algorithms proposed by Martins and Santos and applied it to the time-dependent model. The experimental results on the Chinese railway system show that the modified algorithm is nearly 3 times faster than its original version on the time-expanded model.

[1]  Jose Luis Esteves dos Santos,et al.  A New Shortest Paths Ranking Algorithm , 1999 .

[2]  Marta M. B. Pascoal,et al.  A new implementation of Yen’s ranking loopless paths algorithm , 2003, 4OR.

[3]  D. Wagner,et al.  Timetable Information Updating in Case of Delays : Modeling Issues ⋆ , 2008 .

[4]  Christos D. Zaroliagis,et al.  Efficient models for timetable information in public transportation systems , 2008, JEAL.

[5]  Marta M. B. Pascoal,et al.  Labeling Algorithms For Ranking Shortest Paths , 1999 .

[6]  Christos D. Zaroliagis,et al.  Timetable Information: Models and Algorithms , 2004, ATMOS.

[7]  Ernesto de Queirós Vieira Martins,et al.  A Shortest Paths Ranking Algorithm , 1990 .

[8]  Christos D. Zaroliagis,et al.  Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach , 2004, Electron. Notes Theor. Comput. Sci..

[9]  Andrés Marzal,et al.  A Lazy Version of Eppstein's K Shortest Paths Algorithm , 2003, WEA.

[10]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[11]  Gerth Stølting Brodal,et al.  Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries , 2004, ATMOS.

[12]  Andrés Marzal,et al.  Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison , 1999, WAE.

[13]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[14]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[15]  Marta M. B. Pascoal,et al.  The Optimal Path Problem , 1999 .

[16]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[17]  Marta M. B. Pascoal,et al.  Deviation Algorithms for Ranking Shortest Paths , 1999, Int. J. Found. Comput. Sci..