Timetable information: models and algorithms

Authors:
Matthias Müller-Hannemann;Frank Schulz;Dorothea Wagner;Christos Zaroliagis
Affiliations:
Darmstadt University of Technology, Department of Computer Science, Algorithmics Group, Darmstadt, Germany;University of Karlsruhe, Department of Computer Science, Karlsruhe, Germany;University of Karlsruhe, Department of Computer Science, Karlsruhe, Germany;Computer Technology Institute, Patras, Greece, and Department of Computer Engineering and Informatics, University of Patras, Patras, Greece
Venue:
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Year:
2004

Citing 15
Cited 6

Epsilon efficiency

Journal of Optimization Theory and Applications
Approximation of Pareto optima in multiple-objective, shortest-path problems

Operations Research
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Journal of the ACM (JACM)
Robust and efficient methods for solving path problems

Robust and efficient methods for solving path problems
Dijkstra's algorithm on-line: an empirical case study from public railroad transport

Journal of Experimental Algorithmics (JEA)
Using Multi-level Graphs for Timetable Information in Railway Systems

ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Pareto Shortest Paths is Often Feasible in Practice

WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
On the approximability of trade-offs and optimal access of Web sources

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Geometric containers for efficient shortest-path computation

Journal of Experimental Algorithmics (JEA)
Multicriteria Optimization

Multicriteria Optimization
Efficient models for timetable information in public transportation systems

Journal of Experimental Algorithmics (JEA)
Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-Linear Objectives with Applications

Theory of Computing Systems
Speed-up techniques for shortest-path computations

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Finding all attractive train connections by multi-criteria Pareto search

ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Decision making based on approximate and smoothed pareto curves

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Engineering Route Planning Algorithms

Algorithmics of Large and Complex Networks
Multi-criteria shortest paths in time-dependent train networks

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
User-specific web-based route planning

ICCHP'10 Proceedings of the 12th international conference on Computers helping people with special needs: Part I
Fast routing in very large public transportation networks using transfer patterns

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Algorithm engineering for route planning: an update

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Service-Oriented Line Planning and Timetabling for Passenger Trains

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

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.