Timetable Information: Models and Algorithms

  title={Timetable Information: Models and Algorithms},
  author={Matthias M{\"u}ller-Hannemann and Frank Schulz and Dorothea Wagner and Christos D. Zaroliagis},
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.

Similar Papers

Loading similar papers…