Graphic process units-based chicken swarm optimization algorithm for function optimization problems

摘要

This article focuses on how to design an efficient GPU-based chicken swarm optimization (CSO) algorithm (GCSO), so as to improve diversity and speed up convergence by running a large number of populations in parallel. GCSO mainly improves the sequential CSO in three aspects: (i) GCSO modifies the location updating equation of the rooster and proposes a parallel iterative strategy to transform the sequential iteration process into a parallel iterative process, thereby achieving fine-grained parallelism and improving the convergence speed. (ii) A multirange search strategy is proposed to build different neighborhoods for each flock on the graphic process units (GPU), so that each flock searched in their respective neighborhoods, thus increasing the density and diversity of the search, and making it not easy to fall into a local optimum. (iii) A new column storage structure is designed to meet the requirement of coalescent access on GPU. Twelve benchmark functions are selected to compare GCSO algorithm with some sequential intelligence optimization algorithms and the GPU-based particle swarm algorithm. The results show that the GCSO is able to obtain a speedup up to163.09xcompared with the CSO and achieve better optimization results in terms of both optimization accuracy and convergence speed than some intelligence optimization algorithms.