Contraction hierarchies: faster and simpler hierarchical routing in road networks

Authors:
Robert Geisberger;Peter Sanders;Dominik Schultes;Daniel Delling
Affiliations:
Universität Karlsruhe (TH), Karlsruhe, Germany;Universität Karlsruhe (TH), Karlsruhe, Germany;Universität Karlsruhe (TH), Karlsruhe, Germany;Universität Karlsruhe (TH), Karlsruhe, Germany
Venue:
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Year:
2008

Citing 7
Cited 68

Engineering highway hierarchies

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Engineering fast route planning algorithms

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Better landmarks within reach

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
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

Mobile Route Planning

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)
Goal-directed shortest-path queries using precomputed cluster distances

Journal of Experimental Algorithmics (JEA)
A Heuristic Strong Connectivity Algorithm for Large Graphs

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)
Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm

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
The shortest path problem revisited: optimal routing for electric vehicles

KI'10 Proceedings of the 33rd annual German conference on Advances in artificial intelligence
n-level graph partitioning

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Algorithm engineering: bridging the gap between algorithm theory and practice

Algorithm engineering: bridging the gap between algorithm theory and practice
Graph indexing of road networks for shortest path queries with label restrictions

Proceedings of the VLDB Endowment
Case-based subgoaling in real-time heuristic search for video game pathfinding

Journal of Artificial Intelligence Research
Approximate shortest path queries using Voronoi duals

Transactions on computational science IX
Approximate shortest path queries using Voronoi duals

Transactions on computational science IX
On k-skip shortest paths

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Optimization of heuristic search using recursive algorithm selection and reinforcement learning

Annals of Mathematics and Artificial Intelligence
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
Semantics-based, strategic planning and composition of intermodal freight transport services in sea port hinterlands

i-KNOW '11 Proceedings of the 11th International Conference on Knowledge Management and Knowledge Technologies
VC-dimension and shortest path algorithms

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Scope-based route planning

ESA'11 Proceedings of the 19th European conference on Algorithms
Efficient data management in support of shortest-path computation

Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science
Real-time routing with OpenStreetMap data

Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Exact distance oracles for planar graphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Alternative routes in road networks

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Fully dynamic speed-up techniques for multi-criteria shortest path searches in time-dependent networks

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Space-efficient SHARC-routing

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
Time-dependent contraction hierarchies and approximation

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Route planning with flexible edge restrictions

Journal of Experimental Algorithmics (JEA)
Shortest path and distance queries on road networks: an experimental evaluation

Proceedings of the VLDB Endowment
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
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
Shortest-path queries for complex networks: exploiting low tree-width outside the core

Proceedings of the 15th International Conference on Extending Database Technology
Core Routing on Dynamic Time-Dependent Road Networks

INFORMS Journal on Computing
Bidirectional A* search on time-dependent road networks

Networks
Engineering highway hierarchies

Journal of Experimental Algorithmics (JEA)
Parallel computation of best connections in public transportation networks

Journal of Experimental Algorithmics (JEA)
Smarter outlier detection and deeper understanding of large-scale taxi trip records: a case study of NYC

Proceedings of the ACM SIGKDD International Workshop on Urban 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
Exact graph search algorithms for generalized traveling salesman path problems

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Computing all-pairs shortest paths by leveraging low treewidth

Journal of Artificial Intelligence Research
Time-dependent route planning with generalized objective functions

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
The exact distance to destination in undirected world

The VLDB Journal — The International Journal on Very Large Data Bases
Multi-track map matching

Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Sequenced route queries: getting things done on the way back home

Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Energy-efficient air-indices for distance queries on road networks

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
Component-based scalability for cloud applications

Proceedings of the 3rd International Workshop on Cloud Data and Platforms
Shortest path and distance queries on road networks: towards bridging theory and practice

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Efficient single-source shortest path and distance queries on large graphs

Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Stochastic agent-based simulations of social networks

Proceedings of the 46th Annual Simulation Symposium
G-tree: an efficient index for KNN search on road networks

Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Parameterized algorithms for generalized traveling salesman problems in road networks

Proceedings of the 21st ACM SIGSPATIAL 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)
Towards a Flexible and Scalable Fleet Management Service

Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
Optimizing Landmark-Based Routing and Preprocessing

Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
CrowdRoute: a crowd-sourced routing algorithm in public transit networks

Proceedings of the Second ACM SIGSPATIAL International Workshop on Crowdsourced and Volunteered Geographic Information
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

We present a route planning technique solely based on the concept of node contraction. The nodes are first ordered by 'importance'. A hierarchy is then generated by iteratively contracting the least important node. Contracting a node υ means replacing shortest paths going through v by shortcuts. We obtain a hierarchical query algorithm using bidirectional shortest-path search. The forward search uses only edges leading to more important nodes and the backward search uses only edges coming from more important nodes. For fastest routes in road networks, the graph remains very sparse throughout the contraction process using rather simple heuristics for ordering the nodes. We have five times lower query times than the best previous hierarchical Dijkstra-based speedup techniques and a negative space overhead, i.e., the data structure for distance computation needs less space than the input graph. CHs can be combined with many other route planning techniques, leading to improved performance for many-to-many routing, transit-node routing, goal-directed routing or mobile and dynamic scenarios.