Study on Single Source Shortest Path Algorithms

Abstract

Single Source Shortest Path Algorithm is one of the most used algorithm for routing and tracking path around the world for communication. Nowadays various famous apps are also using this algorithm to track the path and gaining information through the Google Map using different API. We implement Dijkstra, Floyd Warshall, Bellman Ford, Nearest Neighbor, Johnson algorithm for analysis then we implement shortest path algorithm using Genetic Algorithm.

Genetic algorithms are used to solve optimization problems and we have tried to implement this optimization idea into shortest path algorithm to make an innovative shortest path calculation algorithm. The advantage of the algorithm is the more number of edges the less it will take time to calculate shortest path.

This paper evaluates the various single source shortest path algorithms. We have implemented algorithms with graph to analysis the algorithm and then try to calculate shortest path with the Genetic Algorithm and then compare them with each other.