Abstract
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.
This work was supported by the EU FP7/2007-2013 (DG CONNECT.H5-Smart Cities & Sustainability), under grant agreement no. 288094 (project eCOMPASS). Work done while the last author was visiting the Karlsruhe Institute of Technology.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs (1993)
ARRIVAL Deliverable D3.6. Improved Algorithms for Robust and Online Timetabling and for Timetable Information Updating. ARRIVAL Project (March 2009), http://arrival.cti.gr/uploads/3rd_year/ARRIVAL-Del-D3.6.pdf
Bauer, R., Delling, D.: SHARC: Fast and robust unidirectional routing. ACM Journal of Experimental Algorithmics 14 (2009)
Bender, M.A., Demaine, E., Farach-Colton, M.: Cache-Oblivious B-Trees. SIAM Journal on Computing 35(2), 341–358 (2005)
Contraction Hierarchies source code, http://algo2.iti.kit.edu/routeplanning.php
Delling, D., Goldberg, A.V., Nowatzyk, A., Werneck, R.F.: PHAST: Hardware-Accelerated Shortest Path Trees. In: IPDPS 2011. IEEE (2011)
9th DIMACS Implementation Challenge – Shortest Paths, http://www.dis.uniroma1.it/challenge9/index.shtml
10th DIMACS Implementation Challenge – Graph Partitioning and Graph Clustering, http://www.cc.gatech.edu/dimacs10/
Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: Proc. 40th IEEE FOCS 1999, pp. 285–297 (1999)
Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319–333. Springer, Heidelberg (2008)
Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A * Search Meets Graph Theory. In: Proc. SODA, pp. 156–165 (2005)
Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A *: Shortest Path Algorithms with Preprocessing. DIMACS 74, 93–139 (2009)
Mali, G., Michail, P., Paraskevopoulos, A., Zaroliagis, C.: A New Dynamic Graph Structure for Large-Scale Transportation Networks, Technical Report eCOMPASS-TR-005, eCOMPASS Project (October 2012), http://www.ecompass-project.eu/?q=node/135
Schultes, D.: Route Planning in Road Networks. PhD Dissertation, University of Karlsruhe (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mali, G., Michail, P., Paraskevopoulos, A., Zaroliagis, C. (2013). A New Dynamic Graph Structure for Large-Scale Transportation Networks. In: Spirakis, P.G., Serna, M. (eds) Algorithms and Complexity. CIAC 2013. Lecture Notes in Computer Science, vol 7878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38233-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-38233-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38232-1
Online ISBN: 978-3-642-38233-8
eBook Packages: Computer ScienceComputer Science (R0)