Heuristic Contraction Hierarchies with Approximation Guarantee

We present a new heuristic point-to-point shortest path algorithm based on contraction hierarchies (CH). Given an epsilon >= 0, we can prove that the length of the path computed by our algorithm is at most (1 + e) times the length of the optimal (shortest) path. Exact CH is based on node contraction: removing nodes from a network and adding shortcuts to preserve shortest path distances. Our heuristic CH tries to avoid adding shortcuts even when a replacement path is (1+epsilon) times longer. However, we cannot avoid all such shortcuts, as we need to ensure that errors do not stack. Combinations with goal-directed techniques bring further speed-ups.

[1]  Daniel Delling,et al.  Engineering and Augmenting Route Planning Algorithms , 2009 .

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

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

[4]  Ira Pohl,et al.  Heuristic Search Viewed as Path Finding in a Graph , 1970, Artif. Intell..

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

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

[7]  Dorothea Wagner,et al.  Time-Dependent Route Planning , 2009, Encyclopedia of GIS.

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

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

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

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

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

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

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

[15]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .