Multi-criteria Shortest Paths in Time-Dependent Train Networks

We study the problem of finding all Pareto-optimal solutions in a multi-criteria setting of the shortest path problem in time-dependent graphs. This has important applications in timetable information systems for train schedules. We present a new prototype to solve this problem in a fully realistic scenario based on a multi-criteria generalization of Dijkstra's algorithm. As optimization criteria we use travel time and number of train changes, as well as a new criterion "reliability of transfers". The performance of the prototype and various speed-up techniques are analyzed experimentally on a large set of real test instances. In comparison with a base-line implementation, our prototype achieves significant speed-up factors of 20 with respect to the number of label creations and of 138 with respect to label insertions into the priority queue. We also compare our prototype with a time-expanded graph model.

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

[2]  Leo Kroon,et al.  Algorithmic Methods for Railway Optimization, International Dagstuhl Workshop, Dagstuhl Castle, Germany, June 20-25, 2004, 4th International Workshop, ATMOS 2004, Bergen, Norway, September 16-17, 2004, Revised Selected Papers , 2007, ATMOS.

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

[4]  Daniel Delling,et al.  SHARC: Fast and robust unidirectional routing , 2008, JEAL.

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

[6]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[7]  Dirk Theune,et al.  Robuste und effiziente Methoden zur Lösung von Wegproblemen , 1995, Teubner-Texte zur Informatik.

[8]  Rolf H. Möhring,et al.  Verteilte Verbindungssuche im öffentlichen Personenverkehr Graphentheoretische Modelle und Algorithmen , 1999, Angewandte Mathematik, insbesondere Informatik.

[9]  Karsten Weihe,et al.  On the cardinality of the Pareto set in bicriteria shortest path problems , 2006, Ann. Oper. Res..

[10]  K. Nachtigall.  Time depending shortest-path problems with applications to railway networks , 1995 .

[11]  Matthias Müller-Hannemann,et al.  Finding All Attractive Train Connections by Multi-criteria Pareto Search , 2004, ATMOS.

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

[13]  Dirk Theune.  Robust and efficient methods for solving path problems , 1995 .

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

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

[16]  Ariel Orda,et al.  Minimum weight paths in time-dependent networks , 1991, Networks.

[17]  Dorothea Wagner,et al.  14. Experimental Study on Speed-Up Techniques for Timetable Information Systems , 2007 .

[18]  S. Pallottino,et al.  Shortest Path Algorithms in Transportation models: classical and innovative aspects , 1997 .

[19]  Karsten Weihe,et al.  Dijkstra's algorithm on-line: an empirical case study from public railroad transport , 2000, JEAL.

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