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. Both the original algorithm and this implementation present \({\cal O}(Kn(m + n\log n))\) computational complexity order when considering a worst-case analysis. However, computational experiments are reported, which allow to conclude that in practice this new implementation outperforms two other, Perko’s implementation and a straightforward one.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
AMS classification:
05C38, 05C85, 68R10, 90C27.
Ernesto Q.V. Martins: Sadly, the author passed away in November, 2000.
Marta M.B. Pascoal: The research of Marta Pascoal was developed within CISUC and partially supported by the Portuguese Ministry of Science and Technology (MCT), under PRAXIS XXI Project of JNICT.
Rights and permissions
About this article
Cite this article
Martins, E.Q.V., Pascoal, M.M.B. A new implementation of Yen’s ranking loopless paths algorithm. 4OR 1, 121–133 (2003). https://doi.org/10.1007/s10288-002-0010-2
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s10288-002-0010-2