Abstract

: Yen's algorithm is a classical algorithm for ranking the K shortest loopless paths between a pair of nodes in a network. In this paper an implementation of Yen's algorithm is presented. Although with no consequences in what concerns the computational complexity order when considering a worst-case analysis, O(Kn(m+ n log n)), in practice this new implementation outperforms a straightforward one, as the reported comparative computational experiments allow us to conclude. Keywords: network, path, loopless path, paths ranking. 1 Introduction The problem of determining the K shortest paths, or the ranking of the K shortest paths between a pair of nodes in a network was due to Hoffman and Pavley, [6], who proposed an algorithm for solving it. In this problem, for a given integer K 1, is intended to determine successively the shortest path, the second shortest path, . . . , until the K-th shortest path between the given pair of nodes. Since 1951 numerous articles on this subject have be...

Citations