Accommodating user preferences in the optimization of public transport travel

Two solutions are provided in this paper to accommodate user preferences in the optimisation of public transport travel by using different shortest path(s) algorithms: the single purpose shortest path algorithms and the K-shortest paths algorithm. A detailed approach about using K-shortest paths algorithms to compute a reasonable number of ranked shortest paths, with the ultimate 'most optimal' path being selected by consideration of the preferences is presented. The experimental results based on the public transportation network of Nottingham City show that the single purpose shortest path algorithms work efficiently but can only accommodate one single user preference and the K-shortest path algorithm generates multiple routes in one time, however, with a longer computational execution time.

[1]  Jerzy Kamburowski,et al.  Technical Note - A Note on the Stochastic Shortest Route Problem , 1985, Oper. Res..

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

[3]  Andrew V. Goldberg,et al.  Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

[4]  Madhav V. Marathe,et al.  A computational study of routing algorithms for realistic transportation networks , 1999, JEAL.

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

[6]  Paola Festa,et al.  Shortest Path Algorithms , 2006, Handbook of Optimization in Telecommunications.

[7]  Joanna Katherine Hartley.  Parallel algorithms for fuzzy data processing with application to water systems , 1996 .

[8]  H. Mahmassani,et al.  Path search techniques for transportation networks with time-dependent, stochastic arc costs , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.

[9]  F. Benjamin Zhan,et al.  Shortest Path Algorithms: An Evaluation Using Real Road Networks , 1998, Transp. Sci..

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

[11]  Joanna Hartley,et al.  USING K-SHORTEST PATHS ALGORITHMS TO ACCOMMODATE USER PREFERENCES IN THE OPTIMIZATION OF PUBLIC TRANSPORT TRAVEL , 2004 .

[12]  Julian Hine,et al.  SEAMLESS, ACCESSIBLE TRAVEL: USERS' VIEWS OF THE PUBLIC TRANSPORT JOURNEY AND INTERCHANGE , 2000 .

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

[14]  Zhong-Ren Peng,et al.  Object-Oriented Geographic Information System Data Model for Transit Trip-Planning Systems , 2002 .

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

[16]  Elise Miller-Hooks,et al.  Least possible time paths in stochastic, time-varying networks , 1998, Comput. Oper. Res..

[17]  Huey-Kuo Chen,et al.  Heuristics for the stochastic/dynamic user-optimal route choice problem , 2000, Eur. J. Oper. Res..

[18]  Michael P. Wellman,et al.  Path Planning under Time-Dependent Uncertainty , 1995, UAI.

[19]  James J. Solberg,et al.  The Stochastic Shortest Route Problem , 1980, Oper. Res..

[20]  Andrzej Bargiela,et al.  DECISION SUPPORT FOR PLANNING MULTI-MODAL URBAN TRAVEL , 2001 .

[21]  U. Pape,et al.  Implementation and efficiency of Moore-algorithms for the shortest route problem , 1974, Math. Program..

[22]  Hsu-Shih Shih,et al.  An interactive approach for integrated multilevel systems in a fuzzy environment , 2002 .

[23]  OrdaAriel,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990 .

[24]  Mayur Datar,et al.  Commuting with delay prone buses , 2000, SODA '00.

[25]  Giorgio Gallo,et al.  SHORTEST PATH METHODS IN TRANSPORTATION MODELS , 1984 .

[26]  Athanasios K. Ziliaskopoulos.  Optimum path algorithms on multidimensional networks: Analysis, design, implementation and computational experience. , 1996 .

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

[28]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[29]  Douglas R. Shier,et al.  Iterative methods for determining the k shortest paths in a network , 1976, Networks.

[30]  Douglas R. Shier,et al.  Computational experience with an algorithm for finding the k shortest paths in a network , 1974 .

[31]  E Peytchev,et al.  SEE BEFORE YOU GO , 1999 .

[32]  Elise Miller-Hooks,et al.  Optimal routing in time-varying, stochastic networks: algorithms and implementations , 1997 .

[33]  Ariel Orda,et al.  Shortest-path algorithms for time-dependent networks , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[34]  H. Frank,et al.  Shortest Paths in Probabilistic Graphs , 1969, Oper. Res..

[35]  K. Cooke,et al.  The shortest route through a network with time-dependent internodal transit times , 1966 .

[36]  Hani S. Mahmassani,et al.  Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks , 1999, Transp. Sci..

[37]  M. C. Sinclair,et al.  A Comparative Study of k-Shortest Path Algorithms , 1996 .