The simplified particle algorithm which based on the nonlinear decrease extreme disturbance and Cauchy mutation is proposed.
The experimental simulation on seven typical test functions shows that the proposed algorithm can effectively avoid falling into local optimal solution, the ...
Simplified particle swarm algorithm based on nonlinear decrease extreme disturbance and Cauchy mutation. J. Li, Y. Luo, C. Wang, and Z. Zeng.
... simplified particle algorithm which based on the nonlinear decrease extreme disturbance and Cauchy mutation is proposed. The algorithm simplifies particle ...
Simplified particle swarm algorithm based on nonlinear decrease extreme disturbance and Cauchy mutation. by Jun Li, Yangkun Luo, Chong Wang, Zhigao Zeng.
May 4, 2023 · An adaptive sand cat swarm optimization algorithm based on Cauchy mutation and optimal neighborhood disturbance strategy (COSCSO) are provided in this study.
Missing: Simplified | Show results with:Simplified
Three algorithms, based on the simple evolutionary equations and the extrenum disturbed arithmetic operators, are proposed to overcome the demerits of the bPSO.
People also ask
What is the basic particle swarm optimization algorithm?
What are the different types of swarm optimization algorithms?
What is the function of the PSO algorithm?
What is the weakness of particle swarm optimization?
2 days ago · The algorithm introduces a nonlinear adaptive parameter balancing algorithm in the exploitation phase and the exploration phase, and uses the ...
Missing: Simplified | Show results with:Simplified
A novel Simple Particle Swarm Optimization based on Random weight and Confidence term (SPSORC) is proposed in this paper.
Oct 7, 2015 · Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995.