A particle swarm algorithm based on a multi-stage search strategy

Abstract

Particle swarm optimization (PSO) has the disadvantages of easily getting trapped in local optima and a low search accuracy. Scores of approaches have been used to improve the diversity, search accuracy, and results of PSO, but the balance between exploration and exploitation remains sub-optimal. Many scholars have divided the population into multiple sub-populations with the aim of managing it in space. In this paper, a multi-stage search strategy that is dominated by mutual repulsion among particles and supplemented by attraction was proposed to control the traits of the population. From the angle of iteration time, the algorithm was able to adequately enhance the entropy of the population under the premise of satisfying the convergence, creating a more balanced search process. The study acquired satisfactory results from the CEC2017 test function by improving the standard PSO and improved PSO.