𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal paths in dynamic networks with dependent random link travel times

✍ Scribed by He Huang; Song Gao

Book ID
116937688
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
404 KB
Volume
46
Category
Article
ISSN
0191-2615

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Dynamic and stochastic shortest path in
Dynamic and stochastic shortest path in transportation networks with two components of travel time uncertainty
✍ 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,