Performance of Composite PPSO on Single Objective Bound Constrained Numerical Optimization Problems of CEC 2022

Particle swarm optimization has been extensively noticed for its fast convergence speed with few parameters. However, it would be plagued by the premature convergence only affected by the global particles. In this study, Composite Proactive Particles in Swarm Optimization (Co-PPSO) is proposed. In Co-PPSO, the composite strategy framework is embedded into Proactive Particles in Swarm Optimization (PPSO), that is, three learning strategies are proposed to evaluate their differences and select the most suitable one for each particle. In addition, an elite group is constructed to make the particles jump out of the situation that they are only affected by the global best one in the particle swarm, and further improve the convergence accuracy. CEC2022 competition of single objective bound-constrained numerical optimization is employed to test the effect of 10-$D$ and 20-$D$ optimization, and four well-known PSO variants were used for comparison. The experimental results show that the Co-PPSO has certain competitiveness to improve premature convergence.