Article

Landmark-based routing in dynamic graphs

Authors:

Daniel Delling,

Dorothea WagnerAuthors Info & Claims

WEA'07: Proceedings of the 6th international conference on Experimental algorithms

Pages 52 - 65

Published: 06 June 2007 Publication History

Abstract

Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has to be updated whenever the graph is changed. However, goal directed search based on landmarks (ALT) still performs correct queries as long as an edge weight does not drop below its initial value. In this work, we evaluate the robustness of ALT with respect to traffic jams. It turns out that--by increasing the efficiency of ALT--we are able to perform fast (down to 20 ms on the Western European network) random queries in a dynamic scenario without updating the preprocessing as long as the changes in the network are moderate. Furthermore, we present how to update the preprocessed data without any additional space consumption and how to adapt the ALT algorithm to a time-dependent scenario. A time-dependent scenario models predictable changes in the network, e.g. traffic jams due to rush hour.

References

[1]

Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269-271 (1959).

Digital Library

[2]

Wagner, D., Willhalm, T.: Speed-Up Techniques for Shortest-Path Computations. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 23-36. Springer, Heidelberg (2007).

Digital Library

[3]

Delling, D., Holzer, M., Müller, K., Schulz, F., Wagner, D.: High-Performance Multi-Level Graphs. In: 9th DIMACS Challenge on Shortest Paths (2006).

[4]

Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In Transit to Constant Time Shortest-Path Queries in Road Networks. In: Algorithm Engineering and Experiments (ALENEX). pp. 46-59 (2007).

[5]

Goldberg, A.V., Harrelson, C.: Computing the shortest path: A* meets graph theory. In: 16th ACM-SIAM Symposium on Discrete Algorithms. pp. 156-165 (2005).

Digital Library

[6]

Cooke, K., Halsey, E.: The shortest route through a network with time-dependent intemodal transit times. Journal of Mathematical Analysis and Applications 14, 493-498 (1966).

[7]

Ikeda, T., Hsu, M., Imai, H., Nishimura, S., Shimoura, H., Hashimoto, T., Tenmoku, K., Mitoh, K.: A fast algorithm for finding better routes by AI search techniques. In: Vehicle Navigation and Information Systems Conference (1994).

[8]

Flinsenberg, I.C.M.: Route planning algorithms for car navigation. PhD thesis, Technische Universiteit Eindhoven (2004).

[9]

Wagner, D., Willhalm, T., Zaroliagis, C.: Geometric containers for efficient shortestpath computation. ACM Journal of Experimental Algorithmics 10, 1-30 (2005).

Digital Library

[10]

Sanders, P., Schultes, D.: Dynamic Highway-Node Routing. In: 6th Workshop on Experimental Algorithms (WEA) to appear (2007).

Digital Library

[11]

Delling, D., Sanders, P., Schultes, D., Wagner, D.: Highway Hierarchies Star. In: 9th DIMACS Challenge on Shortest Paths (2006).

[12]

Narvaez, P., Siu, K.Y., Tzeng, H.Y.: New dynamic algorithms for shortest path tree computation. IEEE/ACM Trans. Netw. 8, 734-746 (2000).

Digital Library

[13]

Demetrescu, C., Italiano, G.F.: A new approach to dynamic all pairs shortest paths. J. ACM 51, 968-992 (2004).

Digital Library

[14]

Goldberg, A.V., Harrelson, C.: Computing the shortest path: A* meets graph theory. Technical Report MSR-TR-2004-24, Microsoft Research (2004).

[15]

Goldberg, A.V., Werneck, R.F.: An efficient external memory shortest path algorithm. In: AlgorithmEngineering andExperimentation (ALENEX). pp. 26-40 (2005).

[16]

Sedgewick, R., Vitter, J.S.: Shortest paths in Euclidean space. Algorithmica 1, 31-48 (1986).

Digital Library

[17]

Goldberg, A., Kaplan, H., Werneck, R.: Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. In: Algorithm Engineering and Experiments (ALENEX). pp. 129-143 (2006).

[18]

Dashtinezhad, S., Nadeem, T., Dorohonceanu, B., Borcea, C., Kang, P., Iftode, L.: TrafficView: a driver assistant device for traffic monitoring based on car-to-car communication. In: Vehicular Technology Conference, pp. 2946-2950. IEEE, New York (2004).

[19]

Kaufman, D.E., Smith, R.L.: Fastest paths in time-dependent networks for intelligent-vehicle-highway systems application. IVHS Journal 1, 1-11 (1993).

Cited By

Bono MGerevini AHarabor DStuckey P(2019)Path planning with CPD heuristicsProceedings of the 28th International Joint Conference on Artificial Intelligence10.5555/3367032.3367203(1199-1205)Online publication date: 10-Aug-2019
https://dl.acm.org/doi/10.5555/3367032.3367203
Abraham IChechik SDelling DGoldberg AWerneck R(2016)On dynamic approximate shortest paths for planar graphs with worst-case costsProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884488(740-753)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884488
Efstathiades CEfentakis APfoser D(2016)Efficient Processing of Relevant Nearest-Neighbor QueriesACM Transactions on Spatial Algorithms and Systems10.1145/29346752:3(1-28)Online publication date: 21-Sep-2016
https://dl.acm.org/doi/10.1145/2934675
Show More Cited By

Recommendations

Optimizing Landmark-Based Routing and Preprocessing
IWCTS '13: Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science

Many acceleration techniques exist for the single-pair shortest path problem on road networks. Most of them have been significantly improved over the years to achieve faster preprocessing times and superior performance. In this spirit, our current work ...
Dynamic highway-node routing
WEA'07: Proceedings of the 6th international conference on Experimental algorithms

We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the practically relevant scenarios that arise in present-day navigation systems: When an edge weight changes (e.g., due to a ...
Dynamic routing schemes for general graphs
ICALP'06: Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

This paper studies approximate distributed routing schemes on dynamic communication networks. The paper focuses on dynamic weighted general graphs where the vertices of the graph are fixed but the weights of the edges may change. Our main contribution ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

WEA'07: Proceedings of the 6th international conference on Experimental algorithms

June 2007

447 pages

ISBN:9783540728443

Editor:
Camil Demetrescu
Univ. Roma "La Sapienza", Facoltà di Ingegneria, Rome, Italy

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 06 June 2007

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

30
Total Citations
View Citations
12
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bono MGerevini AHarabor DStuckey P(2019)Path planning with CPD heuristicsProceedings of the 28th International Joint Conference on Artificial Intelligence10.5555/3367032.3367203(1199-1205)Online publication date: 10-Aug-2019
https://dl.acm.org/doi/10.5555/3367032.3367203
Abraham IChechik SDelling DGoldberg AWerneck R(2016)On dynamic approximate shortest paths for planar graphs with worst-case costsProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884488(740-753)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884488
Efstathiades CEfentakis APfoser D(2016)Efficient Processing of Relevant Nearest-Neighbor QueriesACM Transactions on Spatial Algorithms and Systems10.1145/29346752:3(1-28)Online publication date: 21-Sep-2016
https://dl.acm.org/doi/10.1145/2934675
Hassan MAref WAly AÖzcan FKoutrika GMadden S(2016)Graph Indexing for Shortest-Path Finding over Dynamic Sub-GraphsProceedings of the 2016 International Conference on Management of Data10.1145/2882903.2882933(1183-1197)Online publication date: 26-Jun-2016
https://dl.acm.org/doi/10.1145/2882903.2882933
Baum MDibbelt JPajor TWagner D(2016)Dynamic Time-Dependent Route Planning in Road Networks with User PreferencesProceedings of the 15th International Symposium on Experimental Algorithms - Volume 968510.1007/978-3-319-38851-9_3(33-49)Online publication date: 5-Jun-2016
https://dl.acm.org/doi/10.1007/978-3-319-38851-9_3
D'Andrea AD'Emidio MFrigioni DLeucci SProietti G(2015)Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of UpdatesACM Journal of Experimental Algorithmics10.1145/278602220(1-33)Online publication date: 15-Jul-2015
https://dl.acm.org/doi/10.1145/2786022
Mahmud HAmin AAli MHashem TNutanong S(2013)A Group Based Approach for Path Queries in Road NetworksProceedings of the 13th International Symposium on Advances in Spatial and Temporal Databases - Volume 809810.5555/2960717.2960744(367-385)Online publication date: 21-Aug-2013
https://dl.acm.org/doi/10.5555/2960717.2960744
Efentakis APfoser D(2013)Optimizing Landmark-Based Routing and PreprocessingProceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science10.1145/2533828.2533838(25-30)Online publication date: 5-Nov-2013
https://dl.acm.org/doi/10.1145/2533828.2533838
Efentakis ABrakatsoulas SGrivas NLamprianidis GPatroumpas KPfoser D(2013)Towards a Flexible and Scalable Fleet Management ServiceProceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science10.1145/2533828.2533835(79-84)Online publication date: 5-Nov-2013
https://dl.acm.org/doi/10.1145/2533828.2533835
Geisberger RSanders PSchultes DVetter C(2012)Exact Routing in Large Road Networks Using Contraction HierarchiesTransportation Science10.1287/trsc.1110.040146:3(388-404)Online publication date: 1-Aug-2012
https://dl.acm.org/doi/10.1287/trsc.1110.0401
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents