๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal paths planning in dynamic transportation networks with random link travel times

โœ Scribed by Sun, Shi-chao; Duan, Zheng-yu; Yang, Dong-yuan

Book ID
125375028
Publisher
Central South University
Year
2014
Tongue
English
Weight
461 KB
Volume
21
Category
Article
ISSN
2095-2899

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,