Fully Dynamic Maintenance of Arc-Flags in Road Networks
The problem of finding best routes in road networks can be solved by applying Dijkstra’s shortest paths algorithm. Unfortunately, road networks deriving from real-world applications are huge yielding unsustainable times to compute shortest paths. For this reason, great research efforts have been done to accelerate Dijkstra’s algorithm on road networks. These efforts have led to the development of a number of speed-up techniques, as for example Arc-Flags, whose aim is to compute additional data in a preprocessing phase in order to accelerate the shortest paths queries in an on-line phase. The main drawback of most of these techniques is that they do not work well in dynamic scenarios.
In this paper we propose a new algorithm to update the Arc-Flags of a graph subject to edge weight decrease operations. To check the practical performances of the new algorithm we experimentally analyze it, along with a previously known algorithm for edge weight increase operations, on real-world road networks subject to fully dynamic sequences of operations. Our experiments show a significant speed-up in the updating phase of the Arc-Flags, at the cost of a small space and time overhead in the preprocessing phase.
KeywordsShort Path Road Network Road Segment Boundary Node Outgoing Edge
Unable to display preview. Download preview PDF.
- 2.Berrettini, E., D’Angelo, G., Delling, D.: Arc-flags in dynamic graphs. In: Proc. of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2009), Schloss Dagstuhl, Germany (2009)Google Scholar
- 7.Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A* Search Meets Graph Theory. In: 16th Annual ACM–SIAM Symp. on Discrete Algorithms (SODA 2005), pp. 156–165 (2005)Google Scholar
- 8.Karypis, G.: METIS - A Family of Multilevel Partitioning Algorithms (2007)Google Scholar
- 9.Lauther, U.: An extremely fast, exact algorithm for finding shortest paths. Static Networks with Geographical Background 22, 219–230 (2004)Google Scholar
- 10.Möhring, R.H., Schilling, H., Schütz, B., Wagner, D., Willhalm, T.: Partitioning Graphs to Speedup Dijkstra’s Algorithm. ACM J. Exp. Algorithmics 11, 2.8 (2006)Google Scholar
- 11.PTV AG - Planung Transport Verkehr (2008),http://www.ptv.de
- 15.Wagner, D., Willhalm, T., Zaroliagis, C.: Geometric Containers for Efficient Shortest-Path Computation. ACM J. Exp. Algorithmics 10, 1.3 (2005)Google Scholar