A New Dynamic Graph Structure for Large-Scale Transportation Networks

We present a new dynamic graph structure specifically suited for large-scale transportation networks that provides simultaneously three unique features: compactness, agility and dynamicity. We demonstrate its practicality and superiority by conducting an experimental study for shortest route planning in large-scale European and US road networks with a few dozen millions of nodes and edges. Our approach is the first one that concerns the dynamic maintenance of a large-scale graph with ordered elements using a contiguous memory part, and which allows an arbitrary online reordering of its elements.

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

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

[3]  Charles E. Leiserson,et al.  Cache-Oblivious Algorithms , 2003, CIAC.

[4]  Michael A. Bender,et al.  Cache-oblivious B-trees , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[5]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

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

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

[8]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

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

[10]  Mark de Berg,et al.  Computational Geometry: Algorithms and Applications, Second Edition , 2000 .

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

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

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

[14]  Andrew V. Goldberg,et al.  PHAST: Hardware-accelerated shortest path trees , 2013, J. Parallel Distributed Comput..

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

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

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

[18]  Christos D. Zaroliagis,et al.  Geometric containers for efficient shortest-path computation , 2005, JEAL.