BibTeX
@MISC{Dean99continuous-timedynamic,
author = {Brian C. Dean},
title = {Continuous-Time Dynamic Shortest Path Algorithms},
year = {1999}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We consider the problem of computing shortest paths through a dynamic network – a network with time-varying characteristics, such as arc travel times and costs, which are known for all values of time. Many types of networks, most notably transportation networks, exhibit such predictable dynamic behavior over the course of time. Dynamic shortest path problems are currently solved in practice by algorithms which operate within a discrete-time framework. In this thesis, we introduce a new set of algorithms for computing shortest paths in continuous-time dynamic networks, and demonstrate for the first time in the literature the feasibility and the advantages of solving dynamic shortest path problems in continuous time. We assume that all time-dependent network data functions are given as piece-wise linear functions of time, a representation capable of easily modeling most common dynamic problems. Additionally, this form of
Keyphrases
continuous-time dynamic shortest path algorithm dynamic shortest path problem time-varying characteristic discrete-time framework dynamic network time-dependent network data function continuous-time dynamic network piece-wise linear function exhibit predictable dynamic behavior continuous time arc travel time first time many type new set common dynamic problem transportation network
