Rimmy Yadav and Avtar Singh
Performance Comparison of Prim’s and Ant Colony Optimization Algorithm to Select Shortest Path in Case of Link Failure
1509 - 1513
2015
9
6
International Journal of Computer and Information Engineering
https://publications.waset.org/pdf/10001943
https://publications.waset.org/vol/102
World Academy of Science, Engineering and Technology
Ant Colony Optimization (ACO) is a promising
modern approach to the unused combinatorial optimization. Here
ACO is applied to finding the shortest during communication link
failure. In this paper, the performances of the prim’s and ACO
algorithm are made. By comparing the time complexity and program
execution time as set of parameters, we demonstrate the pleasant
performance of ACO in finding excellent solution to finding shortest
path during communication link failure.
Open Science Index 102, 2015