Simplified particle swarm algorithm based on nonlinear decrease extreme disturbance and Cauchy mutation

Abstract

Concerning the drawbacks that particle swarm optimisation algorithm is easy to fall into the local optima, and has low solution precision, the simplified particle algorithm which based on the nonlinear decrease extreme disturbance and Cauchy mutation is proposed. The algorithm simplifies particle updating formula, and uses logistic chaotic sequence to initialise the particle position, which can improve the global search ability of population; nonlinear decrease extreme disturbance strategy enhanced the diversity of the population and avoid the particles trapping in local optimum; a novel Cauchy mutation is used for the optimal particle variation to generate more optimal guiding particle movement. The experimental simulation on seven typical test functions shows that the proposed algorithm can effectively avoid falling into local optimal solution, the search speed and optimisation accuracy have improved significantly. The algorithm is suitable to solve the function optimisation problem.

Keywords:

• Particle swarm optimisation algorithm
• chaos
• nonlinear extreme disturbance
• simplified particle swarm
• Cauchy mutation

Additional information

Funding

This work was supported by Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System (Wuhan University of Science and Technology) [grant number znxx2018QN06]; Open Project Program of the National Laboratory of Pattern Recognition (NLPR) [grant number 201700009].