Exact Routing in Large Road Networks Using Contraction Hierarchies

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.

[1]  Peter Sanders,et al.  Goal-directed shortest-path queries using precomputed cluster distances , 2010, JEAL.

[2]  Andrew V. Goldberg,et al.  Computing the shortest path: A search meets graph theory , 2005, SODA '05.

[3]  Andrew V. Goldberg,et al.  PHAST: Hardware-Accelerated Shortest Path Trees , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[4]  Peter Sanders,et al.  Route Planning with Flexible Objective Functions , 2010, ALENEX.

[5]  Peter Sanders,et al.  Distributed Time-Dependent Contraction Hierarchies , 2010, SEA.

[6]  Vassilis J. Tsotras,et al.  Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions , 2010, Proc. VLDB Endow..

[7]  Wim Pijls,et al.  A new bidirectional search algorithm with shortened postprocessing , 2009, Eur. J. Oper. Res..

[8]  Peter Sanders,et al.  Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm , 2008, JEAL.

[9]  G. A. Klunder,et al.  The shortest path problem on large-scale real-road networks , 2006 .

[10]  Peter Sanders,et al.  Dynamic Highway-Node Routing , 2007, WEA.

[11]  Dorothea Wagner,et al.  Landmark-Based Routing in Dynamic Graphs , 2007, WEA.

[12]  Andrew V. Goldberg,et al.  Alternative Routes in Road Networks , 2010, SEA.

[13]  Peter Sanders,et al.  Mobile Route Planning , 2008, ESA.

[14]  Stephan Winter,et al.  Modeling Costs of Turns in Route Planning , 2002, GeoInformatica.

[15]  Peter Sanders,et al.  Computing Many-to-Many Shortest Paths Using Highway Hierarchies , 2007, ALENEX.

[16]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[17]  Christian Vetter,et al.  Parallel Time-Dependent Contraction Hierarchies , 2009 .

[18]  Peter Sanders,et al.  Time-Dependent Contraction Hierarchies , 2009, ALENEX.

[19]  Robert Geisberger.  Contraction of Timetable Networks with Realistic Transfers , 2010, SEA.

[20]  Dominik Schultes.  Route Planning in Road Networks , 2008, Ausgezeichnete Informatikdissertationen.

[21]  Bastian Katz,et al.  Preprocessing Speed-Up Techniques Is Hard , 2010, CIAC.

[22]  Peter Sanders,et al.  Engineering Route Planning Algorithms , 2009, Algorithmics of Large and Complex Networks.

[23]  Haim Kaplan,et al.  Reach for A*: Shortest Path Algorithms with Preprocessing , 2006, The Shortest Path Problem.

[24]  Andrew V. Goldberg,et al.  Computing Point-to-Point Shortest Paths from External Memory , 2005, ALENEX/ANALCO.

[25]  Peter Sanders,et al.  Highway Hierarchies Hasten Exact Shortest Path Queries , 2005, ESA.

[26]  Laurence R. Rilett,et al.  Heuristic shortest path algorithms for transportation applications: State of the art , 2006, Comput. Oper. Res..

[27]  Andrew V. Goldberg,et al.  A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks , 2011, SEA.

[28]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[29]  Peter Sanders,et al.  Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.

[30]  Daniel Delling,et al.  SHARC: Fast and robust unidirectional routing , 2008, JEAL.

[31]  Haim Kaplan,et al.  Better Landmarks Within Reach , 2007, WEA.

[32]  Rolf H. Möhring,et al.  Fast Point-to-Point Shortest Path Computations with Arc-Flags , 2006, The Shortest Path Problem.

[33]  Amos Fiat,et al.  Highway dimension, shortest paths, and provably efficient algorithms , 2010, SODA '10.