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

Shortest paths in stochastic networks with correlated link costs

โœ Scribed by Y.Y. Fan; R.E. Kalaba; J.E. Moore II

Book ID
104007533
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
777 KB
Volume
49
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 condition. Conditions over the traversed links are taken into account for determining the optimal routing strategy for the remaining trip. This problem is treated as a multistage adaptive feedback control process. Each stage is described by the physical state (the location of the current decision point) and the information state (the service level of the previously traversed links). Proof of existence and uniqueness of the solution to the basic dynamic programming equations and a solution procedure are provided.

๐Ÿ“œ SIMILAR VOLUMES

Shortest paths in stochastic networks wi
Shortest paths in stochastic networks with ARC lengths having discrete distributions
โœ Gehan A. Corea; Vidyadhar G. Kulkarni ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 688 KB

## 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