Simplified particle swarm algorithm based on nonlinear decrease extreme disturbance and Cauchy mutation. Issue 3 (3rd May 2020)

• Record Type: Journal Article
• Authors: Li, Jun; Luo, Yangkun; Wang, Chong; Zeng, Zhigao
• Is Part Of: International journal of parallel, emergent and distributed systems. Volume 35:Issue 3(2020)
• Page Start: 236
• Page End: 245
• Publication Date: 2020-05-03
• Subjects: Particle swarm optimisation algorithm -- chaos -- nonlinear extreme disturbance -- simplified particle swarm -- Cauchy mutation; Parallel computers -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Computer algorithms -- Periodicals; 004.35
• DOI: 10.1080/17445760.2018.1455834
• Languages: English
• ISSNs: 1744-5760

Abstract

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. Abstract :