GPU Accelerated Ant Colony Optimization using CUDA

• Main Authors: Wu Chien-Ju, 吳建儒
• Other Authors: Wei Kai-Cheng
• Format: Others
• Language: zh-TW
• Published: 2013
• Online Access: http://ndltd.ncl.edu.tw/handle/34705736372354175402

碩士 === 國立彰化師範大學 === 資訊工程學系 === 101 === Graph Processing Units (GPUs) have recently evolved into a super multi-core and a fully programmable architecture. In the CUDA programming model, the programmers can simply implement parallelism ideas of a task on GPUs. The purpose of this paper is to accelerate Ant Colony Optimization (ACO) for Traveling Salesman Problems (TSP) with GPUs. In this paper, we propose a new parallel method, which is called the Transition Condition Method. Experimental results are extensively compared and evaluated on the performance side and the solution quality side. The TSP problems are used as a standard benchmark for our experiments. In terms of experimental results, our new parallel method achieves the maximal speed-up factor of 3.14 than the previous parallel method. Next, some tuning techniques of the program architecture and optimization mechanisms we proposed are applied to this new method. It can achieve the speed-up factor of 5.18 furthermore. On the other hand, the quality of solutions is similar to the original sequential ACO algorithm. It proves that the quality of solutions does not be sacrificed in the cause of speed-up.