%0 Journal Article
	%A Rimmy Yadav and  Avtar Singh
	%D 2015
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 102, 2015
	%T Performance Comparison of Prim’s and Ant Colony Optimization Algorithm to Select Shortest Path in Case of Link Failure
	%U https://publications.waset.org/pdf/10001943
	%V 102
	%X 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.
	%P 1516 - 1520