Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
@article{Bauer2010CombiningHA, title={Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm}, author={R. Bauer and D. Delling and P. Sanders and Dennis Schieferdecker and Dominik Schultes and D. Wagner}, journal={ACM J. Exp. Algorithmics}, year={2010}, volume={15} }
In recent years, highly effective hierarchical and goal-directed speed-up techniques for routing in large road networks have been developed. This article makes a systematic study of combinations of such techniques. These combinations turn out to give the best results in many scenarios, including graphs for unit disk graphs, grid networks, and time-expanded timetables. Besides these quantitative results, we obtain general insights for successful combinations.
192 Citations
Combining the Connection Scan Algorithm with Contraction Hierarchies
- Mathematics, Computer Science
- ArXiv
- 2019
- PDF
Candidate Sets for Alternative Routes in Road Networks (Extended Abstract)
- Engineering, Mathematics
- SOCS
- 2013
- 3
Candidate Sets for Alternative Routes in Road Networks
- Computer Science
- ACM J. Exp. Algorithmics
- 2014
- 46
- PDF
Engineering Route Planning Algorithms
- Computer Science
- Algorithmics of Large and Complex Networks
- 2009
- 452
- PDF
Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas
- Computer Science, Mathematics
- ArXiv
- 2008
- 9
- PDF
References
SHOWING 1-9 OF 9 REFERENCES
Combining Speed-Up Techniques for Shortest-Path Computations
- Computer Science
- WEA
- 2004
- 41
- Highly Influential
Reach for A*: Shortest Path Algorithms with Preprocessing
- Computer Science
- The Shortest Path Problem
- 2006
- 67
- Highly Influential
- PDF
Fast Point-to-Point Shortest Path Computations with Arc-Flags
- Computer Science
- The Shortest Path Problem
- 2006
- 171
- Highly Influential
- PDF
Proceedings of the 9th DIMACS Implementation Challenge—Shortest Paths
- American Mathematical Society, Providence, RI.
- 2006
Accelerating Point-to-Point Shortest Path Computations in Large Scale Networks
- Master ’ s thesis
- 2007
SCOTCH: Static Mapping, Graph, Mesh and Hypergraph Parti- tioning, and Parallel and Sequential Sparse Matrix Ordering Package
- CHASE gen 3.1
- 2007
SCOTCH: Static Mapping, Graph, Mesh and Hypergraph Partition- ing, and Parallel and Sequential Sparse Matrix Ordering Package
- CHASE gen 3.1
- 2007
SCOTCH: Static Mapping, Graph, Mesh and Hypergraph Partitioning, and Parallel and Sequential Sparse Matrix
- Ordering Package,
- 2007