research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Inbook
Entered by:
TitleTimetable Information: Models and Algorithms
Bibtex cite IDRACTI-RU1-2006-88
Series Lecture Notes in Computer Science
Year published 2006
Month April
Volume 4359
Pages 67-90
Chapter Algorithmic Methods for Railway Optimization
Publisher Springer Berlin / Heidelberg
ISBN 978-3-540-74245-6
DOI 10.1007/978-3-540-74247-0_3
We give an overview of models and efficient algorithms for optimally solving timetable information problems like “given a departure and an arrival station as well as a departure time, which is the connection that arrives as early as possible at the arrival station?” Two main approaches that transform the problems into shortest path problems are reviewed, including issues like the modeling of realistic details (e.g., train transfers) and further optimization criteria (e.g., the number of transfers). An important topic is also multi-criteria optimization, where in general all attractive connections with respect to several criteria shall be determined. Finally, we discuss the performance of the described algorithms, which is crucial for their application in a real system.
Muller-Hannemann, M.
Schulz, Frank
Wagner, Dorothea
Zaroliagis, Christos
fulltext.pdf (main file)
Publication ID569