Abstract
We design a new label shortest path algorithm by applying the concept of a pseudo permanent label. This approach allows an algorithm to partition the set of nodes into two new sets: pseudo permanently labeled nodes and its complementary set. From this point of view, this new label method can be considered as a label setting method. Moreover, at least one node becomes permanently labeled when some nodes which belong to the set of pseudo permanently labeled nodes are scanned in each iteration of the algorithm. In the case of networks with non-negative length arcs it is easy to prove that this node has the minimum distance label among the non-pseudo permanently labeled nodes. On the other hand, it is not known during the computation which pseudo permanently labeled nodes are permanently labeled. Therefore, all distance labels are temporary and the algorithm becomes a label correcting method. Nevertheless, the proposed algorithm exhibits some nice features, such as: (1) the time bound for the running of the algorithm for a network with n nodes and m arcs is O(nm); (2) the number of node scan operations in the algorithm is less than the number of these operations in the previous label correcting algorithms as is observed in the computational experience; (3) the algorithm incorporates two new rules which allow easy detection of a negative cycle in the network; (4) the algorithm is quite simple and very easy to implement, and does not require sophisticated data structures; (5) the algorithm exhibits flexibility in the order in which the new pseudo permanently labeled nodes are scanned. The above features are possible through the application of the pseudo permanent label concept.
Similar content being viewed by others
References
Ahuja, R., Magnanti, T., Orlin, J.B.: Network Flows. Prentice Hall, New York (1993)
Bellman, R.: On a route problem. Q. Appl. Math. 16, 87–90 (1958)
Bertsekas, D.P.: A simple and fast label correcting algorithm for shortest paths. Networks 23, 703–709 (1993)
Cherkassky, B.V., Goldberg, A.V.: Negative-cycle detection algorithms. Math. Program. 85, 277–311 (1999)
Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Math. Program. 73, 129–174 (1996)
Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1, 269–271 (1959)
Ford, L.R.: Network flow theory. The rand Corporation Report P-923, Santa Monica, California, 1956
Gallo, G., Pallotino, S.: Shortest paths algorithms. Ann. Oper. Res. 13, 3–79 (1988)
Glover, F., Klingman, D., Philips, N.: A new polynomially bounded shortest paths algorithm. Oper. Res. 33, 65–73 (1985)
Goldberg, A.V.: Scaling algorithms for the shortest paths problem. SIAM J. Comput. 24, 494–504 (1995)
Goldberg, A.V., Radzik, T.: A heuristic improvement of the Bellman-Ford algorithm. Appl. Math. Lett. 6, 3–6 (1993)
Levit, B.J., Livshits, B.N.: Neleneinye Setevye Transportnye Zadachi. Transport, Moscow (1972) (in Russian)
Moore, E.F.: The shortest path through a maze. In: Proceedings of the Int. Symp. on the Theory of Switching, pp. 285–292. Harvard University Press, Cambridge (1959)
Pallotino, S.: Shortest-path methods: complexity, interrelations and new propositions. Networks 14, 257–267 (1984)
Pape, U.: Implementation and efficiency of Moore algorithms for the shortest root problem. Math. Program. 7, 212–222 (1974)
Sedeño-Noda, A., González-Martín, C.: A new efficient shortest path simplex algorithm. Comput. Optim. Appl. 43(3), 437–448 (2009)
Tarjan, R.E.: Shortest paths. Technical Report, AT&T Bell Laboratories, Murray Hill, NJ (1981)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sedeño-Noda, A., González-Martín, C. An efficient label setting/correcting shortest path algorithm. Comput Optim Appl 51, 437–455 (2012). https://doi.org/10.1007/s10589-010-9323-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-010-9323-9