IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v32y1984i6p1381-1384.html
   My bibliography  Save this article

Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming

Author

Listed:
  • Thomas H. Byers

    (Digital Research Inc., Monterey, California)

  • Michael S. Waterman

    (University of Southern California, Los Angeles, California)

Abstract

This paper presents a new algorithm for finding all solutions with objective function values in the neighborhood of the optimum for certain dynamic programming models, including shortest path problems. The new algorithm combines the depth-first search with stacking techniques of theoretical computer science and principles from dynamic programming to modify the usual backtracking routine and list all near-optimal policies. The resulting procedure is the first practical algorithm for a variety of large problems that are of interest.

Suggested Citation

  • Thomas H. Byers & Michael S. Waterman, 1984. "Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming," Operations Research, INFORMS, vol. 32(6), pages 1381-1384, December.
    • Handle: RePEc:inm:oropre:v:32:y:1984:i:6:p:1381-1384
    DOI: 10.1287/opre.32.6.1381
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.32.6.1381
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.32.6.1381?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. Pascoal, Marta M.B. & Sedeño-Noda, Antonio, 2012. "Enumerating K best paths in length order in DAGs," European Journal of Operational Research, Elsevier, vol. 221(2), pages 308-316.
    2. Vedat Bayram & Hande Yaman, 2018. "Shelter Location and Evacuation Route Assignment Under Uncertainty: A Benders Decomposition Approach," Transportation Science, INFORMS, vol. 52(2), pages 416-436, March.
    3. Bayram, Vedat & Tansel, Barbaros Ç. & Yaman, Hande, 2015. "Compromising system and user interests in shelter location and evacuation planning," Transportation Research Part B: Methodological, Elsevier, vol. 72(C), pages 146-163.
    4. Pan Liu & Tri-Dung Nguyen & Ximing Cai & Xinhao Jiang, 2012. "Finding Multiple Optimal Solutions to Optimal Load Distribution Problem in Hydropower Plant," Energies, MDPI, vol. 5(5), pages 1-20, May.

    More about this item

    Keywords

    111 near-optimal policies;

    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:inm:oropre:v:32:y:1984:i:6:p:1381-1384. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.