Shortest-Path Algorithms and Dynamic Cost Changes

Sven Baselau, Felix Hahne and Klaus Ambrosi
Additional contact information
Sven Baselau: Universität Hildesheim
Felix Hahne: Universität Hildesheim
Klaus Ambrosi: Universität Hildesheim

A chapter in Operations Research Proceedings 2007, 2008, pp 111-116 from Springer

Abstract: 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.

Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-77903-2_17

Ordering information: This item can be ordered from
http://www.springer.com/9783540779032

DOI: 10.1007/978-3-540-77903-2_17

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().