IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v31y1985i9p1106-1128.html
   My bibliography  Save this article

New Polynomial Shortest Path Algorithms and Their Computational Attributes

Author

Listed:
  • Fred Glover

    (School of Business, University of Colorado, Boulder, Colorado 80303)

  • Darwin D. Klingman

    (Graduate School of Business, University of Texas, Austin, Texas 78712)

  • Nancy V. Phillips

    (Graduate School of Business, University of Texas, Austin, Texas 78712)

  • Robert F. Schneider

    (Graduate School of Business, University of Texas, Austin, Texas 78712)

Abstract

This paper presents six new variants of the polynomially bounded Partitioning Shortest Path (PSP) algorithm for finding the shortest path from one node to all other nodes in a network. Three of these variants, one for negative arc lengths, but without negative cycles, and two for nonnegative arc lengths, augment the PSP algorithm to maintain a property called sharp by Shier and Witzgall. The other three variants augment the PSP algorithm to maintain a property called near-sharp for nonnegative arc lengths. Extensive computational testing is presented on one of the sharp variants for nonnegative arc lengths and two of the near-sharp variants. The empirical results based on 4500 test problems with 90 different configurations and three different network topologies indicate that these new algorithms have excellent computational performance characteristics. Based on total solution times for the 4500 test problems, these new algorithms out-perform all other algorithms tested. In addition, one of the near-sharp algorithms strictly dominates all others on all problem topologies tested.

Suggested Citation

  • Fred Glover & Darwin D. Klingman & Nancy V. Phillips & Robert F. Schneider, 1985. "New Polynomial Shortest Path Algorithms and Their Computational Attributes," Management Science, INFORMS, vol. 31(9), pages 1106-1128, September.
    • Handle: RePEc:inm:ormnsc:v:31:y:1985:i:9:p:1106-1128
    DOI: 10.1287/mnsc.31.9.1106
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.31.9.1106
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.31.9.1106?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. Salim, V., 1997. "A comparison of shortest path algorithms in urban traffic assignment," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 43(3), pages 545-551.
    2. Hanif D. Sherali & Antoine G. Hobeika & Sasikul Kangwalklai, 2003. "Time-Dependent, Label-Constrained Shortest Path Problems with Applications," Transportation Science, INFORMS, vol. 37(3), pages 278-293, August.
    3. Elise D. Miller-Hooks & Hani S. Mahmassani, 2000. "Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks," Transportation Science, INFORMS, vol. 34(2), pages 198-215, May.
    4. William Costa & Britaldo Soares-Filho & Rodrigo Nobrega, 2022. "Can the Brazilian National Logistics Plan Induce Port Competitiveness by Reshaping the Port Service Areas?," Sustainability, MDPI, vol. 14(21), pages 1-18, November.

    More about this item

    Keywords

    shortest path algorithms;

    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:ormnsc:v:31:y:1985:i:9:p:1106-1128. 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.