Download:
|
by Ernesto Queir, Vieira Martins, Marta Margarida, Braz Pascoal
http://www.mat.uc.pt/~eqvm/cientificos/investigacao/Artigos/IMP_MS.ps.gz
Add To MetaCart
Abstract:
The K shortest paths problem is a well known network optimization problem where it is intended to rank the K shortest paths between an initial and a terminal node in a network. The first algorithm for solving this problem appeared by the fifties and since then several other algorithms have been proposed. These algorithms can be divided into two classes: one based on the Optimality Principle and another based on the determination of a tree of shortest paths. Moreover, in the first of these classes there can be considered labeling algorithms and deletion path algorithms. In this paper an improvement for a known deletion path algorithm is presented which results in the improvement of its running time complexity when the worst case analysis is considered, from O(Km) to O(Kn log n). Comparative computational experiments regarding the proposed improvement and its former version are also reported, allowing possible conclusions about the obtained performances when the average case is considered.
Citations
|
507
|
A note on two problems in connection with graphs
– Dijkstra
- 1959
|
|
410
|
Fibonacci heaps and their uses in improved network optimization algorithms
– Fredman, Tarjan
- 1987
|
|
148
|
Finding the k shortest paths
– Eppstein
- 1994
|
|
63
|
An Appraisal of Some Shortest Path Algorithms
– Dreyfus
- 1967
|
|
34
|
A Computational Analysis of Alternative Algorithms and Labeling Techniques for Finding Shortest Path Trees,” Networks 9
– DIAL, GLOVER, et al.
- 1979
|
|
19
|
Computing the k shortest paths: a new algorithm andanexperimentalcomparison
– Jiménez, Marzal
- 1999
|
|
15
|
A new shortest paths ranking algorithm
– Martins, Santos
- 1996
|
|
14
|
An algorithm for ranking paths that may contain cycles
– Martins
- 1984
|
|
13
|
Deviation algorithms for ranking shortest paths
– Martins, Pascoal, et al.
- 1999
|
|
13
|
Interactive methods for determining the k shortest paths in a network
– Shier
- 1976
|
|
12
|
An algorithm for the ranking of shortest paths
– Azevedo, Costa, et al.
- 1993
|
|
11
|
A computational improvement for a shortest paths ranking algorithm
– Azevedo, Madeira, et al.
- 1994
|
|
6
|
A shortest paths ranking algorithm
– Azevedo, Madeira, et al.
- 1990
|
|
4
|
The optimal path problem. Investigac~ao Operacional
– Martins, Pascoal, et al.
- 1999
|
|
3
|
A method for the solution of the n th best path problem
– Hoffman, Pavley
- 1959
|
|
3
|
A new algorithm for ranking loopless paths. Research Report
– Martins, Pascoal, et al.
- 1997
|
