Abstract
Shortest-path algorithms are used to find an optimal way through a network. These networks often underlie dynamic changes, e.g. in a road network we find congestions or road works. These dynamic changes can cause a previously calculated route to be not up-to-date anymore. A shortest-path algorithm should react on these changes and present a new route without much overhead in time and space. The simplest way would be to calculate the whole route again. Dynamic shortest path algorithms with different features have been developed avoiding a full re-calculation. This paper describes the advantages of dynamic algorithms and provides an overview.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ravindra Ahuja et al. (1993) Network Flows. Prentice-Hall
Ganesan Ramalingam (1996) Bounded Incremental Computation. Lecture Notes in Computer Science, Number 1089, Springer Verlag
Paolo Narvaez (2000) Routing Reconfiguration in IP Networks. PhD thesis, Massachusetts Institute of Technology
Daniele Frigioni et al. (2000) Fully dynamic algorithms for maintaining shortest paths trees. Journal of Algorithms 34:251–281
Sven Koenig et al. (2001) Lifelong planning A*. Technical Report GITCOGSCI-2002/2, College of Computing, Georgia Institute of Technology, Atlanta (Georgia)
Camil Demetrescu (2001) Fully Dynamic Algorithms for Path Problems on Directed Graphs. PhD thesis, University of Rome “La Sapienza”
Sven Baselau (to be published) A*-Routensuche in zeitlich variablen Netzen (working title). PhD thesis, Universität Hildesheim
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baselau, S., Hahne, F., Ambrosi, K. (2008). Shortest-Path Algorithms and Dynamic Cost Changes. In: Kalcsics, J., Nickel, S. (eds) Operations Research Proceedings 2007. Operations Research Proceedings, vol 2007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77903-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-77903-2_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77902-5
Online ISBN: 978-3-540-77903-2
eBook Packages: Business and EconomicsBusiness and Management (R0)