Performance Comparison Of Prim'S And Ant Colony Optimization Algorithm To Select Shortest Path In Case Of Link Failure

Rimmy Yadav, Avtar Singh
2015 Zenodo  
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.
doi:10.5281/zenodo.1107651 fatcat:ctwdzcpb7ba3xh7yuwofuf3axq