A note on the stochastic shortest-route problem
1978; Wiley; Volume: 25; Issue: 4 Linguagem: Inglês
10.1002/nav.3800250415
ISSN1931-9193
Autores Tópico(s)Facility Location and Emergency Management
ResumoAbstract This paper develops an algorithm for a “shortest route” network problem in which it is desired to find the path which yields the shortest expected distance through the network. It is assumed that if a particular arc is chosen, then there is a finite probability that an adjacent arc will be traversed instead. Backward induction is used and appropriate recursion formulae are developed. A numerical example is provided.
Referência(s)