Multi Colony Ant System based Solution to Travelling Salesman Problem using OpenCL
Shobhit NSharma, Vikram V. Garg · International Journal of Computer Applications · 2015
Travelling salesman problem (TSP) finds applications in wide domains.It is a well known NP Hard problem.In this paper we have proposed GPU based implementation for TSP using OpenCL based on Multi colony Ant System.A comparative analysis is done among the standard travelling salesman problem, multi colony based implementation of travelling salesman problem and GPU based implementation.It is found that GPU based implementation is most efficient in terms of execution time and average tour length.