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
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Pareto Shortest Paths is Often Feasible in Practice
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Geometric containers for efficient shortest-path computation
Journal of Experimental Algorithmics (JEA)
Combining speed-up techniques for shortest-path computations
Journal of Experimental Algorithmics (JEA)
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Efficient models for timetable information in public transportation systems
Journal of Experimental Algorithmics (JEA)
Engineering highway hierarchies
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Engineering multilevel overlay graphs for shortest-path queries
Journal of Experimental Algorithmics (JEA)
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
The Shortcut Problem --- Complexity and Approximation
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
SHARC: Fast and robust unidirectional routing
Journal of Experimental Algorithmics (JEA)
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Engineering Time-Expanded Graphs for Faster Timetable Information
Robust and Online Large-Scale Optimization
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Landmark-based routing in dynamic graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Contraction hierarchies: faster and simpler hierarchical routing in road networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Multi-criteria shortest paths in time-dependent train networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Highway dimension, shortest paths, and provably efficient algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Fast routing in very large public transportation networks using transfer patterns
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Timetable information: models and algorithms
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
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
Algorithmica - Special Issue: European Symposium on Algorithms
A hub-based labeling algorithm for shortest paths in road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
VC-dimension and shortest path algorithms
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Time-dependent contraction hierarchies and approximation
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Acceleration of shortest path and constrained shortest path computation
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Preprocessing speed-up techniques is hard
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Exact Routing in Large Road Networks Using Contraction Hierarchies
Transportation Science
Hi-index | 0.00 |
Nowadays, route planning systems belong to the most frequently used information systems. The algorithmic core problem of such systems, i.e., the fast computation of shortest paths is a classical problem that can be solved by Dijkstra's shortest paths algorithm. However, for the huge datasets that frequently appear in route planning the algorithm is far too slow. Recently, algorithms for route planning in transportation networks have undergone a rapid development, leading to methods that are more than a million times faster than Dijkstra's algorithm. In particular, computing shortest paths in huge networks has become a showpiece of algorithm engineering demonstrating the engineering cycle that consists of design, analysis, implementation and experimental evaluation of practicable algorithms. In this talk, we provide a condensed overview of the techniques enabling this development. In particular, new theoretical insights on when and why those techniques work so well will be discussed. The main part of the talk will focus on variants of the problem that occur in more realistic traffic scenarios.