International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 123 - Number 18 |
Year of Publication: 2015 |
Authors: Sarita Rai, Rajkumar Sharma |
10.5120/ijca2015905818 |
Sarita Rai, Rajkumar Sharma . Solution to Travelling Salesman Problem by Nature Inspired Algorithm. International Journal of Computer Applications. 123, 18 ( August 2015), 52-54. DOI=10.5120/ijca2015905818
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 independent is most efficient in terms of communication overhead and execution time.