Skip to main content
SpringerLink
Log in

New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

We introduce a new network simplex pivot rule for the shortest path simplex algorithm. This new pivot rule chooses a subset of non-basic arcs to simultaneously enter into the basis. We call this operation a multiple pivot. We show that a shortest path simplex algorithm with this pivot rule performs O(n) multiple pivots and runs in O(nm) time. Our pivot rule is based on the new concept of a pseudo permanently labeled node, and it can be adapted to design a new label-correcting algorithm that runs in O(nm). Moreover, this concept lets us introduce new rules to identify negative cycles. Finally, we compare the network simplex algorithm with multiple pivots with other previously proposed efficient network simplex algorithm in a computational experiment.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahuja, R., Magnanti, T., Orlin, J.B.: Network Flows. Prentice Hall, New York (1993)

    Google Scholar 

  2. Akgul, M.: Shortest paths and the simplex method. Technical Report, Department of Computer Sciences and Operations Research Program, North Carolina State University, Raleigh, NC (1986)

  3. Bellman, R.: On a route problem. Q. Appl. Math. 16, 87–90 (1958)

    MATH  Google Scholar 

  4. Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Math. Program. 73, 129–174 (1996)

    MathSciNet  Google Scholar 

  5. Cunningham, W.H.: Theoretical properties of the network simplex method. Math. Program. 4, 196–208 (1979)

    MATH  MathSciNet  Google Scholar 

  6. Dantzig, G.B.: Discrete-variable extremum principles. Oper. Res. 5, 266–277 (1957)

    Article  MathSciNet  Google Scholar 

  7. Dial, R., Glover, F., Karney, D., Klingman, D.: A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees. Networks 9, 215–248 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  8. Ford, L.R.: Network flow theory. The Rand Corporation Report P-923, Santa Monica, Calif (1956)

  9. Goldfarb, D., Jin, Z.: An O(nm)-time network simplex algorithm for the shortest path problem. Oper. Res. 47(3), 445–448 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  10. Goldfarb, D., Hao, J., Kai, S.R.: Efficient shortest path simplex algorithms. Oper. Res. 38(4), 624–628 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  11. Goldfarb, D., Hao, J., Kai, S.R.: Anti-stalling pivot rules for the network simplex algorithm. Networks 20, 79–91 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  12. Minty, G.J.: A variant on the shortest route problem. Oper. Res. 6, 882 (1958)

    Article  Google Scholar 

  13. Moore, Z.F.: The shortest path through a maze. In: Proceedings of the International Symposium on Theory of Switching, Part II, pp. 285–292 (1957)

  14. Orlin, B.: On the simplex algorithm for networks and generalized networks. Math. Program. Study 25, 166–178 (1985)

    MathSciNet  Google Scholar 

  15. Subramani, K., Kovalchick, L.: A greedy strategy for detecting negative cost cycles in networks. Future Gener. Comput. Syst. 21(4), 607–623 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Estadística, Investigación Operativa y Computación (DEIOC), Universidad de La Laguna, 38271, La Laguna, Tenerife, Spain

    A. Sedeño-Noda & C. González-Martín

Authors
  1. A. Sedeño-Noda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. González-Martín
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. Sedeño-Noda.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sedeño-Noda, A., González-Martín, C. New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels. Comput Optim Appl 43, 437–448 (2009). https://doi.org/10.1007/s10589-007-9144-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-007-9144-7

Keywords

Search

Navigation