Highway hierarchies hasten exact shortest path queries

Authors:
Peter Sanders;Dominik Schultes
Affiliations:
Universität Karlsruhe (TH), Karlsruhe, Germany;Universität Karlsruhe (TH), Karlsruhe, Germany
Venue:
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Year:
2005

Citing 5
Cited 64

Using Multi-level Graphs for Timetable Information in Railway Systems

ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Planar Graphs, Negative Weight Edges, Shortest Paths, and Near Linear Time

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Compact Oracles for Reachability and Approximate Distances in Planar Digraphs

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Computing the shortest path: A search meets graph theory

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Acceleration of shortest path and constrained shortest path computation

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

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)
Engineering highway hierarchies

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Adaptive fastest path computation on a road network: a traffic mining approach

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Engineering multilevel overlay graphs for shortest-path queries

Journal of Experimental Algorithmics (JEA)
BMA*: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Studying (non-planar) road networks through an algorithmic lens

Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Linear-time algorithms for geometric graphs with sublinearly many crossings

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A comparison of algorithms for origin-destination matrix generation on real road networks and an approximation approach

Computers and Industrial Engineering
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)
Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games

SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Engineering Route Planning Algorithms

Algorithmics of Large and Complex Networks
Traffic Networks and Flows over Time

Algorithmics of Large and Complex Networks
On A☆ search with stopover areas

International Journal of Geographical Information Science
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing

Journal of Discrete Algorithms
Going off-road: transversal complexity in road networks

Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A new perspective on efficient and dependable vehicle routing

Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm

Journal of Experimental Algorithmics (JEA)
Fast paths in large-scale dynamic road networks

Computational Optimization and Applications
Probabilistic path queries in road networks: traffic uncertainty aware path selection

Proceedings of the 13th International Conference on Extending Database Technology
Speed-up techniques for shortest-path computations

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
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
Fast and compact oracles for approximate distances in planar graphs

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Contraction hierarchies: faster and simpler hierarchical routing in road networks

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Bidirectional A* search for time-dependent fast paths

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
A dynamic navigation scheme for vehicular ad hoc networks

ICCOM'10 Proceedings of the 14th WSEAS international conference on Communications
A case for time-dependent shortest path computation in spatial networks

Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
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
On k-skip shortest paths

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
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
VC-dimension and shortest path algorithms

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Online computation of fastest path in time-dependent spatial networks

SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Path queries on massive graphs based on multi-granular graph partitioning

RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Efficient data management in support of shortest-path computation

Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings

SIAM Journal on Computing
Goal directed shortest path queries using precomputed cluster distances

WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Exact distance oracles for planar graphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Distributed time-dependent contraction hierarchies

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
SCARAB: scaling reachability computation on large graphs

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
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
Multi-agent system for parallel road network hierarchization

ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Core Routing on Dynamic Time-Dependent Road Networks

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

Networks
The weighted shortest path search based on multi-agents in mobile GIS management services

Wireless Communications & Mobile Computing
Engineering highway hierarchies

Journal of Experimental Algorithmics (JEA)
Exact Routing in Large Road Networks Using Contraction Hierarchies

Transportation Science
Approximate shortest paths guided by a small index

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Using extended raster file for real time traffic information mining

CISIM'12 Proceedings of the 11th IFIP TC 8 international conference on Computer Information Systems and Industrial Management
Finding nearest neighbors in road networks: a tree decomposition method

Proceedings of the Joint EDBT/ICDT 2013 Workshops
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
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)
IS-Label: an independent-set based labeling scheme for point-to-point distance querying

Proceedings of the VLDB Endowment
From taxi GPS traces to social and community dynamics: A survey

ACM Computing Surveys (CSUR)
Simple, fast, and scalable reachability oracle

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new speedup technique for route planning that exploits the hierarchy inherent in real world road networks. Our algorithm preprocesses the eight digit number of nodes needed for maps of the USA or Western Europe in a few hours using linear space. Shortest (i.e. fastest) path queries then take around eight milliseconds to produce exact shortest paths. This is about 2 000 times faster than using Dijkstra’s algorithm.