An algorithm for ranking quickest simple paths

Authors:
Marta M. B. Pascoal;M. Eugénia V. Captivo;João C. N. Clímaco
Affiliations:
Centro de Informática e Sistemas, Polo I da Universidade de Coimbra, Apartado 3008, Coimbra 3001-454, Portugal and Departamento de Matemática, Polo I da Universidade de Coimbra, Apartado ...;DEIO-CIO, Faculdade de Ciências, Universidade de Lisboa, Bloco C2, Campo Grande, Lisboa 1749-016, Portugal;Instituto de Engenharia de Sistemas e Computadores--Coimbra, Rua Antero de Quental, 199, Coimbra 3000-033, Portugal and Faculdade de Economia da Universidade de Coimbra, Avenida Dias da Silva, 165 ...
Venue:
Computers and Operations Research
Year:
2005

Citing 6
Cited 9

The quickest path problem

Computers and Operations Research
Algorithms for the quickest path problem and the enumeration of quickest paths

Computers and Operations Research
An algorithm for finding the k quickest paths in a network

Computers and Operations Research
On the quickest path problem

Information Processing Letters
Finding the k quickest simple paths in a network

Information Processing Letters
An algorithm for the quickest path problem

Operations Research Letters

Path Generation Issues for Survivable Network Design

ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Time version of the shortest path problem in a stochastic-flow network

Journal of Computational and Applied Mathematics
Optimal pair of minimal paths under both time and budget constraints

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A method to evaluate routing policy through p minimal paths for stochastic case

Information Sciences: an International Journal
System reliability for quickest path problems under time threshold and budget

Computers & Mathematics with Applications
Stochastic flow networks via multiple paths under time threshold and budget constraint

Computers & Mathematics with Applications
A method to evaluate the routing policy with two minimal paths within time threshold

Expert Systems with Applications: An International Journal
Transmission reliability of k minimal paths within time threshold

Computers and Industrial Engineering
On performance evaluation for a multistate network under spare routing

Information Sciences: an International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, an algorithm for ranking loopless paths in undirected networks, according to the transmission time, is presented. It is shown that the worst-case computational time complexity of the algorithm presented is O(Kr(m+n logn)), which is also the best-known complexity to solve this problem. The worst-case memory complexity is O(Kn), which improves the existing algorithms. Finally, comparative computational results, with other algorithms for the same problem, are reported.