A note on the stochastic shortest route problem

John S. Croucher

doi:10.1002/nav.3800250415

A note on the stochastic shortest route problem

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	729-732
Number of pages	4
Journal	Naval Research Logistics
Volume	25
Issue number	4
DOIs	https://doi.org/10.1002/nav.3800250415
Publication status	Published - Dec 1978

Access to Document

10.1002/nav.3800250415

Cite this

@article{5f151b7f6d7547ce82fffea13a5922b5,

title = "A note on the stochastic shortest route problem",

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.",

author = "Croucher, {John S.}",

year = "1978",

month = dec,

doi = "10.1002/nav.3800250415",

language = "English",

volume = "25",

pages = "729--732",

journal = "Naval Research Logistics",

issn = "0894-069X",

publisher = "John Wiley & Sons",

number = "4",

}

TY - JOUR

T1 - A note on the stochastic shortest route problem

AU - Croucher, John S.

PY - 1978/12

Y1 - 1978/12

N2 - 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.

AB - 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.

U2 - 10.1002/nav.3800250415

DO - 10.1002/nav.3800250415

M3 - Article

SN - 0894-069X

VL - 25

SP - 729

EP - 732

JO - Naval Research Logistics

JF - Naval Research Logistics

IS - 4

ER -

A note on the stochastic shortest route problem

Abstract

Access to Document

Fingerprint

Cite this