An Improved Particle Swarm Optimization Algorithm
Bei Yang
Abstract
Bei Yang
Abstract
Particle swarm optimization(PSO) is a new evolutionary computation method,which has been successfully applied to many fields.But the standard particle swarm optimization is used resulting in premature convergence.An improved particle swarm optimization is presented.Using differential evolution strategy,it can make the solution jump out of the local minimum point.The experimental results of classic functions show that the improved PSO is efficient and feasible.
OpenAlex reports 19 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Particle swarm optimization(PSO) is a new evolutionary computation method,which has been successfully applied to many fields.But the standard particle swarm optimization is used resulting in premature convergence.An improved particle swarm optimization is presented.Using differential evolution strategy,it can make the solution jump out of the local minimum point.The experimental results of classic functions show that the improved PSO is efficient and feasible.
Key concepts: Particle swarm optimization, Multi-swarm optimization, Metaheuristic, Mathematical optimization, Jump, Premature convergence, Convergence (economics), Swarm behaviour