Qianli Zhang, Xing Li, Quang-Ahn Tran
Abstract
A modified particle swarm optimization (PSO) algorithm is proposed in this paper to avoid premature convergence with the introduction of mutation operation. The performance of this algorithm is compared to the standard PSO algorithm and experiments indicate that it has better performance with little overhead.
OpenAlex reports 18 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.
A modified particle swarm optimization (PSO) algorithm is proposed in this paper to avoid premature convergence with the introduction of mutation operation. The performance of this algorithm is compared to the standard PSO algorithm and experiments indicate that it has better performance with little overhead.
Key concepts: Particle swarm optimization, Convergence (economics), Overhead (engineering), Premature convergence, Computer science, Multi-swarm optimization, Algorithm, Mathematical optimization