Advertisement

Polynomial auction algorithms for shortest paths

  • Dimitri P. Bertsekas
  • Stefano Pallottino
  • Maria Grazia Scutellà
Article

Abstract

In this paper we consider strongly polynomial variations of the auction algorithm for the single origin/many destinations shortest path problem. These variations are based on the idea of graph reduction, that is, deleting unnecessary arcs of the graph by using certain bounds naturally obtained in the course of the algorithm. We study the structure of the reduced graph and we exploit this structure to obtain algorithms withO (n min{m, n logn}) andO(n2) running time. Our computational experiments show that these algorithms outperform their closest competitors on randomly generated dense all destinations problems, and on a broad variety of few destination problems.

Keywords

shortest path network optimization auction 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D.P. Bertsekas, “A Distributed Algorithm for the Assignment Problems,” Lab. for Information and Decision Systems Working Paper, M.I.T., Cambridge, MA, March 1979.Google Scholar
  2. 2.
    D.P. Bertsekas, “A New Algorithm for the Assignment Problem,” Math. Programming, vol. 21, pp. 152–171, 1981.Google Scholar
  3. 3.
    D.P. Bertsekas, “The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial,” Interfaces, vol. 20, pp. 133–149, 1990.Google Scholar
  4. 4.
    D.P. Bertsekas, “The Auction Algorithm for Shortest Paths,” SIAM J. on Optimization, vol. 1, pp. 425–447, 1991.Google Scholar
  5. 5.
    D.P. Bertsekas, “Linear Network Optimization: Algorithms and Codes,” M.I.T. Press, Cambridge, MA, 1991.Google Scholar
  6. 6.
    Z. Galil and A. Naamad, “O (VE log2 V) Algorithms for the Maximum Flow Problem,” J. of Comput. Sys. Sci., vol. 21, pp. 203–217, 1980.Google Scholar
  7. 7.
    G. Gallo and S. Pallottino, “Shortest Path Methods: A Unified Approach,” Math. Programming Study, vol. 26, pp. 38–64, 1986.Google Scholar
  8. 8.
    G. Gallo and S. Pallottino, “Shortest Path Algorithms,” Annals of Operations Research, vol. 7, pp. 3–79 1988.Google Scholar
  9. 9.
    D. Klingman, A. Napier, and J. Stutz, “NETGEN—A Program for Generating Large Scale (Un) Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems,” Management Science, vol. 20, pp. 814–822, 1974.Google Scholar
  10. 10.
    C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, N.J., 1982.Google Scholar
  11. 11.
    S. Pallottino and M.G. Scutellà, “Strongly Polynomial Algorithms for Shortest Paths,” Ricerca Operativa, vol 60, pp. 33–53, 1991.Google Scholar

Copyright information

© Kluwer Academic Publishers 1995

Authors and Affiliations

  • Dimitri P. Bertsekas
    • 1
  • Stefano Pallottino
    • 2
  • Maria Grazia Scutellà
    • 2
  1. 1.Laboratory for Information and Decision SystemsM.I.T.Cambridge
  2. 2.Department of Computer ScienceUniversity of PisaPisaItaly

Personalised recommendations