IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v25y1978i4p729-732.html
   My bibliography  Save this article

A note on the stochastic shortest‐route problem

Author

Listed:
  • John S. Croucher

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.

Suggested Citation

  • John S. Croucher, 1978. "A note on the stochastic shortest‐route problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 25(4), pages 729-732, December.
    • Handle: RePEc:wly:navlog:v:25:y:1978:i:4:p:729-732
    DOI: 10.1002/nav.3800250415
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800250415
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800250415?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. N Shi & R K Cheung & H Xu & K K Lai, 2011. "An adaptive routing strategy for freight transportation networks," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 799-805, April.
    2. Pramesh Kumar & Alireza Khani, 2021. "Adaptive Park-and-ride Choice on Time-dependent Stochastic Multimodal Transportation Network," Networks and Spatial Economics, Springer, vol. 21(4), pages 771-800, December.
    3. Madhushini Narayana Prasad & Nedialko Dimitrov & Evdokia Nikolova, 2023. "Non-Aggressive Adaptive Routing in Traffic," Mathematics, MDPI, vol. 11(17), pages 1-25, August.
    4. Raymond K. Cheung, 1998. "Iterative methods for dynamic stochastic shortest path problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(8), pages 769-789, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navlog:v:25:y:1978:i:4:p:729-732. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.