DMCA
Timetable Information: Models and Algorithms (2006)
Cached
Download Links
| Citations: | 10 - 7 self |
BibTeX
@MISC{Müller-Hannemann06timetableinformation:,
author = {Matthias Müller-Hannemann and Frank Schulz and Dorothea Wagner and Christos Zaroliagis},
title = {Timetable Information: Models and Algorithms },
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
Keyphrases
timetable information arrival station attractive connection important topic timetable information problem train transfer efficient algorithm main approach described algorithm shortest path problem multi-criteria optimization several criterion realistic detail real system optimization criterion departure time
