A Comparative Study of k-Shortest Path Algorithms

  • A. W. Brander
  • M. C. Sinclair


Efficient management of networks requires that the shortest route from one point (node) to another is known; this is termed the shortest path. It is often necessary to be able to determine alternative routes through the network, in case any part of the shortest path is damaged or busy. The k-shortest paths represent an ordered list of the alternative routes available. Four algorithms were selected for more detailed study from over seventy papers written on this subject since the 1950’s. These four were implemented in the ‘C’ programming language and, on the basis of the results, an assessment was made of their relative performance.


Short Path Start Node Elementary Path Loop Path Root Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Yen JY. Finding the k shortest loopless paths in a network. Management Science 1971; 17:712–716.MathSciNetMATHCrossRefGoogle Scholar
  2. [2]
    Lawler EL. A procedure for computing the k best solutions to discrete optimisation problems and its application to the shortest path problem. Management Science, Theory Series 1972; 18:401–405.MathSciNetMATHCrossRefGoogle Scholar
  3. [3]
    Ahuja RK, Magnanti TL, Orlin JB. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New Jersey, 1993.MATHGoogle Scholar
  4. [4]
    Katoh N, Ibaraki T, Mine H. An efficient algorithm for k shortest simple paths. Networks 1982; 12:411–427.MathSciNetMATHCrossRefGoogle Scholar
  5. [5]
    Hoffman W, Pavley R. A method for the solution of the nth best path problem. Journal of the Association for Computing Machinery (ACM) 1959; 6:506–514.MathSciNetMATHGoogle Scholar
  6. [6]
    Dijkstra EW. A note on two problems in connexion with graphs. Numerische Mathematik 1959; 1:269–271.MathSciNetMATHCrossRefGoogle Scholar
  7. [7]
    O’Mahony MJ, Sinclair MC, Mikac B. Ultra-high capacity optical transmission network: European research project COST 239. Information, Telecommunications, Automata Journal 1993; 12:33–45.Google Scholar
  8. [8]
    Shier DR. Iterative methods for determining the k shortest paths in a network. Networks 1976; 6:205–229.MathSciNetMATHCrossRefGoogle Scholar
  9. [9]
    Carraresi P, Sodini C. A binary enumeration tree to find k shortest paths. Methods of Operations Research (Germany) 7th Symposium on Operations Research, St. Gallen, Switzerland 1983; 177–188.Google Scholar
  10. [10]
    Boffey B. The all-to-all alternative route problem. Operation Research -Rairo-Recherche Operationelle 1993; 27:375–387.MathSciNetMATHGoogle Scholar

Copyright information

© Springer-Verlag London Limited 1996

Authors and Affiliations

  • A. W. Brander
    • 1
  • M. C. Sinclair
    • 1
  1. 1.Dept. of Electronic Systems EngineeringUniversity of EssexEssexUSA

Personalised recommendations