IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v39y2005i4p465-476.html
   My bibliography  Save this article

A Multiple Pairs Shortest Path Algorithm

Author

Listed:
  • I-Lin Wang

    (Department of Industrial and Information Management, National Cheng Kung University, No. 1, University Road, Tainan, Taiwan 701)

  • Ellis L. Johnson

    (School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205)

  • Joel S. Sokol

    (School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205)

Abstract

The multiple pairs shortest path problem (MPSP) arises in many applications where the shortest paths and distances between only some specific pairs of origin-destination (OD) nodes in a network are desired. The traditional repeated single-source shortest path (SSSP) and all pairs shortest paths (APSP) algorithms often do unnecessary computation to solve the MPSP problem. We propose a new shortest path algorithm to save computational work when solving the MPSP problem. Our method is especially suitable for applications with fixed network topology but changeable arc lengths and desired OD pairs. Preliminary computational experiments demonstrate our algorithm’s superiority on airline network problems over other APSP and SSSP algorithms.

Suggested Citation

  • I-Lin Wang & Ellis L. Johnson & Joel S. Sokol, 2005. "A Multiple Pairs Shortest Path Algorithm," Transportation Science, INFORMS, vol. 39(4), pages 465-476, November.
    • Handle: RePEc:inm:ortrsc:v:39:y:2005:i:4:p:465-476
    DOI: 10.1287/trsc.1050.0124
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.1050.0124
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.1050.0124?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
    ---><---

    References listed on IDEAS

    as
    1. Harry M. Markowitz, 1957. "The Elimination form of the Inverse and its Application to Linear Programming," Management Science, INFORMS, vol. 3(3), pages 255-269, April.
    2. T. C. Hu, 1968. "A Decomposition Algorithm for Shortest Paths in a Network," Operations Research, INFORMS, vol. 16(1), pages 91-102, February.
    3. Donald Goldfarb & Jianxiu Hao & Sheng-Roan Kai, 1990. "Efficient Shortest Path Simplex Algorithms," Operations Research, INFORMS, vol. 38(4), pages 624-628, August.
    4. Donald Goldfarb & Zhiying Jin, 1999. "An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem," Operations Research, INFORMS, vol. 47(3), pages 445-448, June.
    5. G. Mills, 1966. "A Decomposition Algorithm for the Shortest-Route Problem," Operations Research, INFORMS, vol. 14(2), pages 279-291, April.
    6. George B. Dantzig, 1960. "On the Shortest Route Through a Network," Management Science, INFORMS, vol. 6(2), pages 187-190, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Rosenthal, Edward C., 2017. "A cooperative game approach to cost allocation in a rapid-transit network," Transportation Research Part B: Methodological, Elsevier, vol. 97(C), pages 64-77.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Heinemann, Hergen H., 1971. "Ein allgemeines Dekompositionsverfahren fuer lineare Optimierungsprobleme [A General Decomposition Algorithm for Linear Optimization Problems]," MPRA Paper 28842, University Library of Munich, Germany.
    2. Lee, Jisun & Joung, Seulgi & Lee, Kyungsik, 2022. "A fully polynomial time approximation scheme for the probability maximizing shortest path problem," European Journal of Operational Research, Elsevier, vol. 300(1), pages 35-45.
    3. Harry M. Markowitz, 2004. "Trains of Thought," Chapters, in: Michael Szenberg & Lall Ramrattan (ed.), Reflections of Eminent Economists, chapter 17, Edward Elgar Publishing.
    4. Anirudh Kishore Bhoopalam & Niels Agatz & Rob Zuidwijk, 2023. "Platoon Optimization Based on Truck Pairs," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1242-1260, November.
    5. LOUTE, Etienne, 2003. "Gaussian elimination as a computational paradigm," LIDAM Discussion Papers CORE 2003059, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. Defeng Liu & Andrea Lodi & Mathieu Tanneau, 2021. "Learning chordal extensions," Journal of Global Optimization, Springer, vol. 81(1), pages 3-22, September.
    7. Harry M. Markowitz, 2002. "Efficient Portfolios, Sparse Matrices, and Entities: A Retrospective," Operations Research, INFORMS, vol. 50(1), pages 154-160, February.
    8. Gass, Saul I., 1997. "The Washington operations research connection: the rest of the story," Socio-Economic Planning Sciences, Elsevier, vol. 31(4), pages 245-255, December.
    9. Kishore Bhoopalam, A. & Agatz, N.A.H. & Zuidwijk, R.A., 2020. "Spatial and Temporal Synchronization of Truck Platoons," ERIM Report Series Research in Management ERS-2020-014-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    10. Huang, He & Gao, Song, 2012. "Optimal paths in dynamic networks with dependent random link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 579-598.
    11. Suresh P. Sethi & Sushil Gupta & Vipin K. Agrawal & Vijay K. Agrawal, 2022. "Nobel laureates’ contributions to and impacts on operations management," Production and Operations Management, Production and Operations Management Society, vol. 31(12), pages 4283-4303, December.
    12. Miles Lubin & J. Hall & Cosmin Petra & Mihai Anitescu, 2013. "Parallel distributed-memory simplex for large-scale stochastic LP problems," Computational Optimization and Applications, Springer, vol. 55(3), pages 571-596, July.
    13. Keeping, B.R. & Pantelides, C.C., 1998. "A distributed memory parallel algorithm for the efficient computation of sensitivities of differential-algebraic systems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 44(6), pages 545-558.
    14. Linzhong Liu & Haibo Mu & Juhua Yang, 2017. "Toward algorithms for multi-modal shortest path problem and their extension in urban transit network," Journal of Intelligent Manufacturing, Springer, vol. 28(3), pages 767-781, March.
    15. Luigi Di Puglia Pugliese & Francesca Guerriero, 2016. "On the shortest path problem with negative cost cycles," Computational Optimization and Applications, Springer, vol. 63(2), pages 559-583, March.
    16. Richard W. Cottle, 2005. "George B. Dantzig: Operations Research Icon," Operations Research, INFORMS, vol. 53(6), pages 892-898, December.
    17. Dobrzyński, Michał & Plata, Jagoda, 2010. "Fill-ins number reducing direct solver designed for FIT-type matrix," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 80(8), pages 1684-1693.
    18. Donald Goldfarb & Zhiying Jin, 1999. "An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem," Operations Research, INFORMS, vol. 47(3), pages 445-448, June.
    19. Orlin, James B., 1953-, 1995. "A polynomial time primal network simplex algorithm for minimum cost flows," Working papers 3834-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    20. Zionts, Stanley, 1962. "Methods for Selection of an Optimum Route," Transportation Research Forum Conference Archive 316265, Transportation Research Forum.

    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:ortrsc:v:39:y:2005:i:4:p:465-476. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.