Abstract
This paper presents the first Learning Automaton solution to the Dynamic Single Source Shortest Path Problem. It involves finding the shortest path in a single-source stochastic graph, where there are continuous probabilistically- based updates in edge-weights. The algorithm is a few orders of magnitude superior to the existing algorithms. It can be used to find the shortest path within the “statistical” average graph, which converges irrespective of whether there are new changes in edge-weights or not. On the other hand, the existing algorithms will fail to exhibit such a behavior and would recalculate the affected shortest paths after each weight change. The algorithm can be extremely useful in application domains including transportation, strategic planning, spatial database systems and networking.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bellman, R.: On a Routing Problem. Quart. Appl. Math. 16, 87–90 (1958)
Dijkstra, E.W.: A Note on two Problems in Connection with Graphs. Numerische Mathematik 1, 269–271 (1959)
Franciosa, P.G., Frigioni, D., Giaccio, R.: Semi-Dynamic Shortest Paths and Breadth First Search in Digraphs. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 33–46. Springer, Heidelberg (1997)
Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully Dynamic Output Bounded Single Source Shortest Path problem. In: ACM-SIAM Symp. Disc. Algo., pp. 212–221 (1996)
Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully Dynamic Algorithms for Maintaining Shortest Paths Trees. Journal of Algorithms 34, 251–281 (2000)
Lakshmivarahan, S.: Learning Algorithms Theory and Appls. Springer, New York (1981)
McQuillan, J., Richer, I., Rosen, E.: The New Routing Algorithm for the ARPANET. IEEE Transactions on Communications COM-28(5), 711–719 (1980)
Narvaez, P., Siu, K.-Y., Tzeng, H.Y.: New Dynamic Algorithms for Shortest Path Tree Computation. IEEE/ACM Transactions on Networking 8(6), 734–746 (2000)
Narendra, K.S., Thathachar, M.A.L.: Learning Automata. Prentice-Hall, Englewood Cliffs (1989)
Oommen, B.J., de St. Croix, E.V.: Graph Partitioning Using Learning Automata. IEEE Transactions on Computers 45(2), 195–208 (1995)
Oommen, B.J., Roberts, T.D.: Continuous Learning Automata Solutions to the Capacity Assignment Problem. IEEE Trans. Comput. 49, 608–620 (2000)
Ramalingam, G., Reps, T.: On the Computational Complexity of Dynamic Graph Problems. Theoretical Computer Science 158(1), 233–277 (1996)
Spira, P., Pan, A.: On Finding and Updating Spanning Trees and Shortest Paths. SIAM Journal of Computing 4(3), 375–380 (1975)
Misra, S., Oommen, B.J.: The Dynamic Single Source Shortest Path Problem: Learning Automata Solutions. Unabridged version of the paper can be obtained from the authors as a technical report (submitted for publication)
Obaidat, M.S., Papadimitriou, G.I., Pomportsis, A.S.: Learning Automata: Theory, Paradigms and Applications. IEEE Trans. Syst., Man., and Cybern. 32(6), 706–709 (2002)
Verbeeck, K., Nowe, A.: Colonies of Learning Automta. IEEE Trans. Syst., Man., and Cybern. 32(6), 772–780 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Misra, S., Oommen, B.J. (2004). Stochastic Learning Automata-Based Dynamic Algorithms for the Single Source Shortest Path Problem. In: Orchard, B., Yang, C., Ali, M. (eds) Innovations in Applied Artificial Intelligence. IEA/AIE 2004. Lecture Notes in Computer Science(), vol 3029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24677-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-24677-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22007-7
Online ISBN: 978-3-540-24677-0
eBook Packages: Springer Book Archive