A Survey Paper on Solving TSP using Ant Colony Optimization on GPU
Hasmukh Goswami College Of Engineering, Ahmedabad, India
COMPUSOFT, An international journal of advanced computer technology, 3 (12), 2014
@article{khatri2014survey,
title={A Survey Paper on Solving TSP using Ant Colony Optimization on GPU},
author={Khatri, Khushbu and Gupta, Vinit Kumar},
year={2014}
}
Ant Colony Optimization (ACO) is meta-heuristic algorithm inspired from nature to solve many combinatorial optimization problem such as Travelling Salesman Problem (TSP). There are many versions of ACO used to solve TSP like, Ant System, Elitist Ant System, Max-Min Ant System, Rank based Ant System algorithm. For improved performance, these methods can be implemented in parallel architecture like GPU, CUDA architecture. Graphics Processing Unit (GPU) provides highly parallel and fully programmable platform. GPUs which have many processing units with an off-chip global memory can be used for general purpose parallel computation. This paper presents a survey on different solving TSP using ACO on GPU.
December 12, 2014 by hgpu
