A Schedule-based Pathfinding Algorithm for Transit Networks Using Pattern First Search

The lack of effective and efficient schedule-based pathfinding algorithms for transit networks has limited the application of GIS in transit trip planning services. This paper introduces a schedule-based path finding algorithm for transit networks. Based on a pattern-centered spatiotemporal transit network model, the algorithm searches the network by following route patterns. A pattern is a spatial layout of a route in transit terminology. A route usually has many patterns to serve various locations at different times. This path search algorithm is significantly different from traditional shortest path algorithms that are based on adjacent node search. By establishing a set of lemmas and theorems the paper proves that paths generated by the PFS algorithm are schedule-coordinated fastest paths for trips with given constraints. After analyzing computation and database query complexities of the algorithm the paper indicates that the PFS is efficient in computation and database query. Finally, effectiveness and efficiency of the algorithm are demonstrated by implementations in GIS-based online transit trip planners in Wisconsin, US.

[1]  Shimon Even,et al.  Graph Algorithms , 1979 .

[2]  Jia Hao Wu,et al.  Transit Equilibrium Assignment: A Model and Solution Algorithms , 1994, Transp. Sci..

[3]  Zhong-Ren Peng,et al.  A spatiotemporal data model for dynamic transit networks , 2008, Int. J. Geogr. Inf. Sci..

[4]  Michael Florian,et al.  Optimal strategies: A new assignment model for transit networks , 1989 .

[5]  F P Clerq.  A PUBLIC TRANSPORT ASSIGNMENT METHOD , 1972 .

[6]  Horst A. Eiselt,et al.  Integer Programming and Network Models , 2000 .

[7]  Francesco Russo.  Schedule-Based Dynamic Assignment Models for Public Transport Networks , 2004 .

[8]  James Evans,et al.  Optimization algorithms for networks and graphs , 1992 .

[9]  Robert B. Dial,et al.  A PROBABILISTIC MULTIPATH TRAFFIC ASSIGNMENT MODEL WHICH OBVIATES PATH ENUMERATION. IN: THE AUTOMOBILE , 1971 .

[10]  M. Florian.  Finding Shortest Time-Dependent Paths in Schedule-Based Transit Networks: A Label Setting Algorithm , 2004 .

[11]  C. O. Tong,et al.  A computer model for finding the time-dependent minimum path in a transit system with fixed schedules , 1984 .

[12]  Shing Chung Josh Wong,et al.  Minimum path algorithms for a schedule-based transit network with a general fare structure , 2004 .

[13]  Hai Yang,et al.  A stochastic user equilibrium assignment model for congested transit networks , 1999 .

[14]  Benjamin Heydecker,et al.  ANALYSIS OF TRAFFIC MODELS FOR DYNAMIC EQUILIBRIUM TRAFFIC ASSIGNMENT , 1998 .

[15]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[16]  Nigel H. M. Wilson,et al.  Schedule-Based Dynamic Transit Modeling: Theory and Applications (Operations Research/Computer Science Interfaces, 28) , 2004 .

[17]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

[18]  J D Cea Ch.  TRANSIT ASSIGNMENT TO MINIMAL ROUTES: AN EFICIENT NEW ALGORITHM , 1989 .

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

[20]  J D Cea,et al.  TRANSIT ASSIGNMENT TO MINIMAL ROUTES: AN EFFICIENT NEW ALGORITHM , 1989 .

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

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