Expected shortest paths in dynamic and stochastic traffic networks
โ Scribed by Liping Fu; L.R. Rilett
- Book ID
- 117397462
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 405 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0191-2615
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The objective is to minimize expected travel time from any origin to a specific destination in a congestible network with correlated link costs. Each link is assumed to be in one of two possible conditions. Conditional probability density functions for link travel times are assumed known for each co
## Abstract In this work, we compute the distribution of __L__\*, the length of a shortest __(s, t)__ path, in a directed network __G__ with a source node __s__ and a sink node __t__ and whose arc lengths are independent, nonnegative, integer valued random variables having finite support. We constr
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,