TY - JFULL AU - Rimmy Yadav and Avtar Singh PY - 2015/7/ TI - Performance Comparison of Prim’s and Ant Colony Optimization Algorithm to Select Shortest Path in Case of Link Failure T2 - International Journal of Computer and Information Engineering SP - 1508 EP - 1513 VL - 9 SN - 1307-6892 UR - https://publications.waset.org/pdf/10001943 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 102, 2015 N2 - 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. ER -