A note on the stochastic shortest route problem

    Research output: Contribution to journalArticlepeer-review


    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.
    Original languageEnglish
    Pages (from-to)729-732
    Number of pages4
    JournalNaval Research Logistics
    Issue number4
    Publication statusPublished - Dec 1978


    Dive into the research topics of 'A note on the stochastic shortest route problem'. Together they form a unique fingerprint.

    Cite this