A Comparative Study of k-Shortest Path Algorithms

Abstract

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.

References

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