文章基本信息

标题：Comparison of Dijkstra’s Shortest Path Algorithm with Genetic Algorithm for Static and Dynamic Routing Network
本地全文：下载
作者：Yagvalkya Sharma ; Subhash Chandra Saini ; Manisha Bhandhari 等
期刊名称：International Journal of Electronics and Computer Science Engineering
电子版ISSN：2277-1956
出版年度：2012
卷号：1
期号：2
页码：416-425
出版社：Buldanshahr : IJECSE
摘要：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
关键词：Dijkstra's algorithm; Genetic algorithm; Routing