Exact Routing in Large Road Networks Using Contraction Hierarchies

Authors:
Robert Geisberger;Peter Sanders;Dominik Schultes;Christian Vetter
Affiliations:
Karlsruhe Institute of Technology, Department of Informatics, 76128 Karlsruhe, Germany;Karlsruhe Institute of Technology, Department of Informatics, 76128 Karlsruhe, Germany;Karlsruhe Institute of Technology, Department of Informatics, 76128 Karlsruhe, Germany;Karlsruhe Institute of Technology, Department of Informatics, 76128 Karlsruhe, Germany
Venue:
Transportation Science
Year:
2012

Citing 23
Cited 15

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Modeling Costs of Turns in Route Planning

Geoinformatica
Computing the shortest path: A search meets graph theory

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Heuristic shortest path algorithms for transportation applications: state of the art

Computers and Operations Research
The shortest path problem on large-scale real-road networks

Networks
Mobile Route Planning

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
SHARC: Fast and robust unidirectional routing

Journal of Experimental Algorithmics (JEA)
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)
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
Contraction hierarchies: faster and simpler hierarchical routing in road networks

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Route Planning in Road Networks

Route Planning in Road Networks
Highway dimension, shortest paths, and provably efficient algorithms

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Graph indexing of road networks for shortest path queries with label restrictions

Proceedings of the VLDB Endowment
A hub-based labeling algorithm for shortest paths in road networks

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Goal directed shortest path queries using precomputed cluster distances

WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Highway hierarchies hasten exact shortest path queries

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Alternative routes in road networks

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Contraction of timetable networks with realistic transfers

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Distributed time-dependent contraction hierarchies

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Preprocessing speed-up techniques is hard

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity

Algorithm engineering for route planning: an update

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Engineering highway hierarchies

Journal of Experimental Algorithmics (JEA)
Engineering graph partitioning algorithms

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
Time-dependent route planning with generalized objective functions

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
Efficient route compression for hybrid route planning

MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Real-world route planning

Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science
Quick and energy-efficient routes: computing constrained shortest paths for electric vehicles

Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science
On optimal preprocessing for contraction hierarchies

Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science
Energy-optimal routes for electric vehicles

Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Customizable point-of-interest queries in road networks

Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Search-Space size in contraction hierarchies

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Shortest-path queries in static networks

ACM Computing Surveys (CSUR)
Flexible route guidance through turn instruction graphs

Proceedings of the 1st ACM SIGSPATIAL International Workshop on MapInteraction

Quantified Score

Hi-index	0.00

Visualization

Abstract

Contraction hierarchies are a simple approach for fast routing in road networks. Our algorithm calculates exact shortest paths and handles road networks of whole continents. During a preprocessing step, we exploit the inherent hierarchical structure of road networks by adding shortcut edges. A subsequent modified bidirectional Dijkstra algorithm can then find a shortest path in a fraction of a millisecond, visiting only a few hundred nodes. This small search space makes it suitable to implement it on a mobile device. We present a mobile implementation that also handles changes in the road network, like traffic jams, and that allows instantaneous routing without noticeable delay for the user. Also, an algorithm to calculate large distance tables is currently the fastest if based on contraction hierarchies.