Solution to Travelling Salesman Problem by Nature Inspired Algorithm

Sarita Rai, Rajkumar Sharma
2015 International Journal of Computer Applications  
Travelling salesman problem (TSP) finds applications in wide domains. It is a well known NP Hard problem. In this paper we have proposed nature inspired ant colony optimization on travelling salesman problem. A comparative analysis is done among the standard travelling salesman problem and proposed ant colony based approaches. All the implementations are compared in terms of communication overhead and execution time. It is found that multi colony based approach in which all colonies are
more » ... ent is most efficient in terms of communication overhead and execution time.
doi:10.5120/ijca2015905818 fatcat:dtcgw4thizaunncle4hco4xm7a