A Review And Evaluations Of Shortest Path Algorithms

Abstract Nowadays in computer networks the routing is based on the shortest path problem. This will help in minimizing the overall costs of setting up computer networks. New technologies such as map-related systems are also applying the shortest path problem. This papers main objective is to evaluate the Dijkstras Algorithm Floyd-Warshall Algorithm Bellman-Ford Algorithm and Genetic Algorithm GA in solving the shortest path problem. A short review is performed on the various types of shortest path algorithms. Further explanations and implementations of the algorithms are illustrated in graphical forms to show how each of the algorithms works. A framework of the GA for finding optimal solutions to the shortest path problem is presented. The results of evaluating the Dijkstras Floyd-Warshall and Bellman-Ford algorithms along with their time complexity conclude the paper.