Efficient Routing in Road Networks with Turn Costs

We present an efficient algorithm for shortest path computation in road networks with turn costs. Each junction is modeled as a node, and each road segment as an edge in a weighted graph. Turn costs are stored in tables that are assigned to nodes. By reusing turn cost tables for identical junctions, we improve the space efficiency. Preprocessing based on an augmented node contraction allows fast shortest path queries. Compared to an edge-based graph, we reduce preprocessing time by a factor of 3.4 and space by a factor of 2.4 without change in query time.

[1]  Lanny A. Yeske.  Student Research Projects , 1998 .

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

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

[4]  Dorothea Wagner,et al.  Algorithmics of Large and Complex Networks - Design, Analysis, and Simulation [DFG priority program 1126] , 2009, Algorithmics of Large and Complex Networks.

[5]  Tom Caldwell,et al.  On finding minimum routes in a network with turn penalties , 1961, CACM.

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

[7]  L. Volker.  Route Planning in Road Networks with Turn Costs , 2008 .

[8]  Thomas Erlebach,et al.  Length-bounded cuts and flows , 2006, TALG.

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

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

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

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

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

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

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