A new implementation of Yen’s ranking loopless paths algorithm

• Autor(a) principal: Martins, Ernesto Q. V.
• Data de Publicação: 2003
• Outros Autores: Pascoal, Marta M. B.
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
• Texto Completo: http://hdl.handle.net/10316/7763; https://doi.org/10.1007/s10288-002-0010-2

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.