Stochastic learning automata-based dynamic algorithms for the single source shortest path problem

Authors:
S. Misra;B. John Oommen
Affiliations:
School of Computer Science, Carleton University, Ottawa, Canada;School of Computer Science, Carleton University, Ottawa, Canada
Venue:
IEA/AIE'2004 Proceedings of the 17th international conference on Innovations in applied artificial intelligence
Year:
2004

Citing 0
Cited 3

An Efficient Dynamic Algorithm for Maintaining All-Pairs Shortest Paths in Stochastic Networks

IEEE Transactions on Computers
Adaptive algorithms for routing and traffic engineering in stochastic networks

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Using genetic algorithms for navigation planning in dynamic environments

Applied Computational Intelligence and Soft Computing

Quantified Score

Hi-index	0.00

Visualization

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 singlesource 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.