Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
