2 Prior Work 2 . 1 Contraction Hierarchies : Faster and Simpler Hierarchical Routing in Road Networks

One commonplace application of shortest-path graph search is navigational routing. Given that the road network is relatively static, a family of algorithms have been invented for shortest-path queries in applications where pre-processing the data is possible. One such algorithm is Contraction Hierarchies, which is optimal and does not rely on localized search. We investigate the graph properties of road networks by evaluating Contraction Hierarchies on real-world and generated road networks. Our goal is to gain a better understanding of why the algorithm works and whether it can be applied successfully to graphs that are not road networks.

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

[2]  A. Clauset,et al.  Scale invariance in road networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[4]  Peter Sanders,et al.  Engineering highway hierarchies , 2012, JEAL.

[5]  David Eisenstat,et al.  Random Road Networks: The Quadtree Model , 2010, ANALCO.

[6]  Nikola Milosavljevic On optimal preprocessing for contraction hierarchies , 2012, IWCTS '12.

[7]  Dennis Luxen,et al.  Real-time routing with OpenStreetMap data , 2011, GIS.

[8]  Patrick Weber,et al.  OpenStreetMap: User-Generated Street Maps , 2008, IEEE Pervasive Computing.

[9]  John D. Hunter,et al.  Matplotlib: A 2D Graphics Environment , 2007, Computing in Science & Engineering.

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