Passenger trip planning in urban rail transit based on time geography

Passenger's trip is influenced by not only space constraints, but also time budget due to the operation characteristics of urban rail transit (URT). Time variation can cause such problems that some planned paths are impractical for not coordinating with the last trains on schedule, seriously affecting rail passenger's trip. A passenger's travel path generation algorithm is proposed to solve the problem under both space and time constraints. It is developed on the basis of train search algorithm for URT and space-time prism, the core of time geography. By searching the Train Time-space Diagram forwardly from origin and then backwardly from destination, passenger's accessible region and passing region could be obtained. Then a set of admissible paths is calculated from the intersection of those regions. It can be used for passenger trip planning in URT. Finally, Shanghai Metro is taken as an example to illustrate the effectiveness of the algorithm.

[1]  Sohail S. Chaudhry,et al.  Finding the K shortest paths in a schedule-based transit network , 2012, Comput. Oper. Res..

[2]  Shing Chung Josh Wong,et al.  Estimation of time-dependent origin–destination matrices for transit networks , 1998 .

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

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

[5]  Mei-Po Kwan,et al.  Network-based constraints-oriented choice set formation using GIS , 1998 .

[6]  Nicos Christofides,et al.  An efficient implementation of an algorithm for finding K shortest simple paths , 1999, Networks.

[7]  Zhong-Ren Peng,et al.  Schedule-Based Path-Finding Algorithms for Transit Trip-Planning Systems , 2002 .

[8]  Tijs Neutens,et al.  A three-dimensional network-based space–time prism , 2008, J. Geogr. Syst..

[9]  Torsten Hägerstraand.  WHAT ABOUT PEOPLE IN REGIONAL SCIENCE , 1970 .

[10]  H. Miller.  Societies and cities in the age of instant access , 2007 .

[11]  Harvey J. Miller,et al.  Modelling accessibility using space-time prism concepts within geographical information systems , 1991, Int. J. Geogr. Inf. Sci..

[12]  Toshihide Ibaraki,et al.  An efficient algorithm for K shortest simple paths , 1982, Networks.

[13]  Shing Chung Josh Wong,et al.  A stochastic transit assignment model using a dynamic schedule-based network , 1999 .

[14]  Zhifeng Cheng,et al.  A Calculation Method and Its Application of Bus Isochrones , 2013 .

[15]  Gabriel Y. Handler,et al.  A dual algorithm for the constrained shortest path problem , 1980, Networks.

[16]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[17]  Douglas R. Shier,et al.  On algorithms for finding the k shortest paths in a network , 1979, Networks.

[18]  Mei-Po Kwan,et al.  Choice set formation with multiple flexible activities under space–time constraints , 2012, Int. J. Geogr. Inf. Sci..

[19]  Markus Friedrich,et al.  Timetable-Based Transit Assignment Using Branch and Bound Techniques , 2001 .