Dynamic and stochastic shortest path in
β
Parichart Pattanamekar; Dongjoo Park; Laurence R. Rilett; Jeomho Lee; Choulki Le
π
Article
π
2003
π
Elsevier Science
π
English
β 682 KB
The existing dynamic and stochastic shortest path problem (DSSPP) algorithms assume that the mean and variance of link travel time (or other specific random variable such as cost) are available. When they are used with observed data from previous time periods, this assumption is reasonable. However,