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

Publication status | Published - Dec 1978 |