CAPSO: Chaos Adaptive Particle Swarm Optimization Algorithm
Youxiang Duan, Ning Chen, Lunjie Chang, Yongjing Ni, S. V. N. Santhosh Kumar, Peiying Zhang
Abstract
As an influential technology of swarm evolutionary computing (SEC), the particle swarm optimization (PSO) algorithm has attracted extensive attention from all walks of life. However, how to rationally and effectively utilize the population resources to equilibrate the exploration and utilization is still a key dispute to be resolved. In this paper, we propose a novel PSO algorithm called Chaos Adaptive Particle Swarm Optimization (CAPSO), which adaptively adjust the inertia weight parameter <inline-formula> <tex-math notation="LaTeX">$w$ </tex-math></inline-formula> and acceleration coefficients <inline-formula> <tex-math notation="LaTeX">$c_{1},c_{2}$ </tex-math></inline-formula>, and introduces a controlling factor <inline-formula> <tex-math notation="LaTeX">$\gamma $ </tex-math></inline-formula> based on chaos theory to adaptively adjust the range of chaotic search. This makes the algorithm have favorable adaptability, and then the particles cannot only effectively prevent missing the global optimal solution, but also have a high probability of jumping out of the local optimal solution. To verify the stability, convergence speed, and accuracy of CAPSO, we conduct ample experiments on 6 test functions. In addition, to further verify the effectiveness and scalability of CAPSO, comparative experiments are carried out on the CEC2013 test suite. Finally, the results prove that CAPSO outperforms other peer algorithms to achieve satisfactory performance.