A note on the stochastic shortest‐route problem

John S. Croucher

Naval Research Logistics Quarterly, 1978, vol. 25, issue 4, 729-732

Abstract: 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.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://doi.org/10.1002/nav.3800250415

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:25:y:1978:i:4:p:729-732

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().