Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2015.060626
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 6 Issue 6, 2015.
Abstract: finding the shortest path over network is very difficult and it is the target for much research, after many researches get the result in many of algorithm and many a mount based on the performance for these algorithm .Shortest paths problems are familiar problems in computer science and mathematics. In these problems, edge weights may represent distances, costs, or any other real-valued quantity that can be added along a path, and that one may wish to minimize. Thus, edge weights are real numbers and the specific operations used are addition to compute the weight of a path and minimum to select the best path weight. In this paper we use the Dijkstra's algorithm with new technique to find the shortest path over network to reduce the time we need to find the best path, in this paper we use node for network with the same value which can be use it to find the shortest path but this depend on the number of transition for every node when the node have high number then the node have the high priority to choose it by using this method we descries the time to find the short path .to make this algorithm more distinguish apply multi-agent system ( Automata with multiplicities ) to find the short path.
Basem Alrifai and Hind Mousa Al-Hamadeen, “Using Moore Dijkstra Algorithm with Multi-Agent System to Find Shortest Path over Network” International Journal of Advanced Computer Science and Applications(IJACSA), 6(6), 2015. http://dx.doi.org/10.14569/IJACSA.2015.060626