Shortest paths in stochastic networks wi
โ
Y.Y. Fan; R.E. Kalaba; J.E. Moore II
๐
Article
๐
2005
๐
Elsevier Science
๐
English
โ 777 KB
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