Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks

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.

[1]  Rolf H. Möhring,et al.  Acceleration of Shortest Path and Constrained Shortest Path Computation , 2005, WEA.

[2]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[3]  Philip N. Klein,et al.  Multiple-source shortest paths in planar graphs , 2005, SODA '05.

[4]  Dominik Schultes,et al.  Route Planning in Road Networks , 2008 .

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

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

[7]  Satish Rao,et al.  Planar graphs, negative weight edges, shortest paths, and near linear time , 2006, J. Comput. Syst. Sci..

[8]  Peter Sanders,et al.  Engineering Fast Route Planning Algorithms , 2007, WEA.

[9]  Yossi Azar,et al.  Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings , 2006, ESA.

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

[11]  Rolf H. Möhring,et al.  Partitioning Graphs to Speed Up Dijkstra's Algorithm , 2005, WEA.

[12]  Ronald J. Gutman,et al.  Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks , 2004, ALENEX/ANALC.

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

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

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

[16]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[17]  Swastik Kopparty,et al.  TO PLANAR GRAPHS , 2010 .

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

[19]  J. Anthonisse.  The rush in a directed graph , 1971 .

[20]  Peter Sanders,et al.  Better Approximation of Betweenness Centrality , 2008, ALENEX.

[21]  Peter Sanders,et al.  Fast Routing in Road Networks with Transit Nodes , 2007, Science.

[22]  Haim Kaplan,et al.  Reach for A*: Efficient Point-to-Point Shortest Path Algorithms , 2006, ALENEX.

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

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

[25]  Peter Sanders,et al.  Highway Hierarchies Star , 2006, The Shortest Path Problem.

[26]  Stefano Leonardi,et al.  Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, ESA.

[27]  Ulrich Lauther,et al.  An Experimental Evaluation of Point-To-Point Shortest Path Calculation on Road Networks with Precalculated Edge-Flags , 2006, The Shortest Path Problem.

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

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

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

[31]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .