Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm

Authors:
Reinhard Bauer;Daniel Delling;Peter Sanders;Dennis Schieferdecker;Dominik Schultes;Dorothea Wagner
Affiliations:
Karlsruhe Institute of Technology, Karlsruhe, Germany;Karlsruhe Institute of Technology, Karlsruhe, Germany;Karlsruhe Institute of Technology, Karlsruhe, Germany;Karlsruhe Institute of Technology, Karlsruhe, Germany;Karlsruhe Institute of Technology, Karlsruhe, Germany;Karlsruhe Institute of Technology, Karlsruhe, Germany
Venue:
Journal of Experimental Algorithmics (JEA)
Year:
2010

Citing 19
Cited 19

Dijkstra's algorithm on-line: an empirical case study from public railroad transport

Journal of Experimental Algorithmics (JEA)
Fly cheaply: on the minimum fuel consumption problem

Journal of Algorithms
Using Multi-level Graphs for Timetable Information in Railway Systems

ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Computing the shortest path: A search meets graph theory

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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)
Engineering highway hierarchies

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Time-Dependent SHARC-Routing

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks

ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
SHARC: Fast and robust unidirectional routing

Journal of Experimental Algorithmics (JEA)
Pareto Paths with SHARC

SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Better landmarks within reach

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
Dynamic highway-node routing

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm

WEA'08 Proceedings of the 7th 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
Highway hierarchies hasten exact shortest path queries

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Acceleration of shortest path and constrained shortest path computation

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Partitioning graphs to speed up dijkstra's algorithm

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

Algorithm engineering: bridging the gap between algorithm theory and practice

Algorithm engineering: bridging the gap between algorithm theory and practice
Efficient routing in road networks with turn costs

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
A hub-based labeling algorithm for shortest paths in road networks

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Hierarchy decomposition for faster user equilibria on road networks

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Customizable route planning

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Real-time routing with OpenStreetMap data

Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Route planning with flexible edge restrictions

Journal of Experimental Algorithmics (JEA)
Algorithm engineering for route planning: an update

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
A highway-centric labeling approach for answering distance queries on large sparse graphs

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Core Routing on Dynamic Time-Dependent Road Networks

INFORMS Journal on Computing
Exact Routing in Large Road Networks Using Contraction Hierarchies

Transportation Science
Candidate sets for alternative routes in road networks

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Hierarchical hub labelings for shortest paths

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
HLDB: location-based services in databases

Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Routing directions: keeping it fast and simple

Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Shortest-path queries in static networks

ACM Computing Surveys (CSUR)
Optimizing Landmark-Based Routing and Preprocessing

Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
IS-Label: an independent-set based labeling scheme for point-to-point distance querying

Proceedings of the VLDB Endowment
Simple, fast, and scalable reachability oracle

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.