%0 Journal Article
%T Comparison of Dijkstra¡¯s Shortest Path Algorithm with Genetic Algorithm for Static and Dynamic Routing Network
%A Yagvalkya Sharma
%A Subhash Chandra Saini
%A Manisha Bhandhari
%J International Journal of Electronics and Computer Science Engineering
%D 2012
%I Buldanshahr : IJECSE
%X : In this paper we calculate the Shortest path between Source and Destination node for Static and Dynamic Routing Networks. First we applied Dijkstra¡¯s Algorithm (DA) and then Genetic Algorithm (GA) to find the Shortest Path. Both the Algorithms provide the same solution. The results affirmed the potential of Genetic Algorithm. We will compare the Execution Time for both Algorithms and find that DA takes more time in finding the optimum path, as compared to GA. So, GA has the potential to replace DA in finding the shortest path for Network Topologies. Simulation results are performed for both Algorithms on MATLAB and GENETIC ALGORITHM TOOL.
%K Dijkstra¡¯s algorithm
%K Genetic algorithm
%K Routing
%U http://www.ijecse.org/wp-content/uploads/2012/08/Volume-1Number-2PP-416-425.pdf