Years and Authors of Summarized Original Work
2004; Pyrga, Schulz, Wagner, Zaroliagis
Problem Definition
Consider the route-planning task for passengers of scheduled public transportation. Here, the running example is that of a train system, but the discussion applies equally to bus, light-rail and similar systems. More precisely, the task is to construct a timetable information system that, based upon the detailed schedules of all trains, provides passengers with good itineraries, including the transfer between different trains.
Solutions to this problem consist of a model of the situation (e.g., can queries specify a limit on the number of transfers?), an algorithmic approach, its mathematical analysis (does it always return the best solution? Is it guaranteed to work fast in all settings?), and an evaluation in the real world (Can travelers actually use the produced itineraries? Is an implementation fast enough on current computers and real data?).
Key Results
The problem is...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Gerards B, Marchetti-Spaccamela A (eds) (2004) Proceedings of the 3rd workshop on algorithmic methods and models for optimization of railways (ATMOS‘03) 2003. Electronic notes in theoretical computer science, vol 92. Elsevier
Barrett CL, Bisset K, Jacob R, Konjevod G, Marathe MV (2002) Classical and contemporary shortest path problems in road networks: implementation and experimental analysis of the TRANSIMS router. In: Algorithms – ESA 2002: 10th annual European symposium, Rome, 17–21 Sept 2002. Lecture notes computer science, vol 2461. Springer, Berlin, pp 126–138
Brodal GS, Jacob R (2003) Time-dependent networks as models to achieve fast exact time-table queries. In: Proceedings of the 3rd workshop on algorithmic methods and models for optimization of railways (ATMOS‘03), [1], pp 3–15
Müller-Hannemann M, Schnee M (2006) Paying less for train connections with MOTIS. In: Kroon LG, Möhring RH (eds) Proceedings of the 5th workshop on algorithmic methods and models for optimization of railways (ATMOS‘05), Dagstuhl, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl. Dagstuhl Seminar Proceedings, no. 06901
Müller-Hannemann M, Schnee M (2007) Finding all attractive train connections by multi-criteria pareto search. In: Geraets F, Kroon LG, Schöbel A, Wagner D, Zaroliagis CD (eds) Algorithmic methods for railway optimization, international Dagstuhl workshop, Dagstuhl Castle, 20–25 June 2004, 4th international workshop, ATMOS 2004, Bergen, 16–17 Sept 2004, revised selected papers. Lecture notes in computer science, vol 4359. Springer, Berlin, pp 246–263
Müller-Hannemann M, Schulz F, Wagner D, Zaroliagis CD (2007) Timetable information: models and algorithms. In: Geraets F, Kroon LG, Schöbel A, Wagner D, Zaroliagis CD (eds) Algorithmic methods for railway optimization, international Dagstuhl workshop, Dagstuhl Castle, 20–25 June 2004, 4th International Workshop, ATMOS 2004, Bergen, 16–17 Sept 2004, revised selected papers. Lecture notes in computer science, vol 4359. Springer, pp 67–90
Nachtigall K (1995) Time depending shortest-path problems with applications to railway networks. Eur J Oper Res 83:154–166
Pyrga E, Schulz F, Wagner D, Zaroliagis C (2004) Experimental comparison of shortest path approaches for timetable information. In: Proceedings 6th workshop on algorithm engineering and experiments (ALENEX). Society for Industrial and Applied Mathematics, pp 88–99
Pyrga E, Schulz F, Wagner D, Zaroliagis C (2003) Towards realistic modeling of time-table information through the time-dependent approach. In: Proceedings of the 3rd workshop on algorithmic methods and models for optimization of railways (ATMOS‘03), [1], pp 85–103
Pyrga E, Schulz F, Wagner D, Zaroliagis C (2007) Efficient models for timetable information in public transportation systems. J Exp Algorithm 12:2.4
Schulz F, Wagner D, Weihe K (2000) Dijkstra’s algorithm on-line: an empirical case study from public railroad transport. J Exp Algorithm 5:1–23
Acknowledgments
I want to thank Matthias Müller‐Hannemann, Dorothea Wagner, and Christos Zaroliagis for helpful comments on an earlier draft of this entry.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Jacob, R. (2016). Shortest Paths Approaches for Timetable Information. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_371
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_371
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering