Implementation of Ant Colony Algorithm Based on GPU

Ant colony algorithm is an efficient intelligent algorithm to solve NP hard problem. This paper presents a parallel computing solution based on General Purpose GPU (GPGPU) to solve Traveling Salesman Problem (TSP) with Max-Min Ant System (MMAS). The experimental result shows it is more efficient than pure CPU computing.

[1]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[2]  Ben Shneiderman,et al.  Tree-maps: a space-filling approach to the visualization of hierarchical information structures , 1991, Proceeding Visualization '91.

[3]  Hiroyuki Goto,et al.  Efficient Scheduling Focusing on the Duality of MPL Representation , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[4]  Jens H. Krüger,et al.  GPGPU: general purpose computation on graphics hardware , 2004, SIGGRAPH '04.