A PARALLEL ANT COLONY OPTIMIZATION ALGORITHM BASED ON FINE-GRAINED MODEL WITH GPU-ACCELERATION

Fine-grained parallel ant colony optimization algorithm (FGACO), though a popular and robust strategy for solving complicated optimization problems, is sometimes inconvenient to use as its population size is restricted by heavy data communication and the parallel computers are relatively difficult to use, manage, maintain and may not be accessible to most researchers. In this paper, we propose a FGACO method based on GP U-acceleration, which maps parallel ACO algorithm to GPU through the compute unified device architecture (CUDA). The analytical results demonstrate that, the proposed method increases the population size, speeds up its execution and provides ordinary users with a feasible FGACO solution.