

In this paper, a formal convergence analysis of the conventional PSO algorithms with time-varying parameters is presented. Based on this analysis, a new convergence-related parametric model for the conventional PSO is introduced. Finally, several new schemes for parameter adjustment, providing significant performance benefits, are introduced. Performance of these schemes is empirically compared to conventional PSO algorithms on a set of selected benchmarks. The tests prove effectiveness of the newly introduced schemes, especially regarding their ability to efficiently explore the search space. © 2009 Elsevier B.V. All rights reserved.
| Engineering controlled terms: | AlgorithmsConvergence of numerical methodsGlobal optimizationTime varying systems |
|---|---|
| Engineering uncontrolled terms: | Analysis of algorithmsConvergence analysisNew parametersParametric modelsParticle Swarm OptimizationPerformance benefitsPso algorithmsSearch spacesTime-varyingTime-varying parameters |
| Engineering main heading: | Particle swarm optimization (PSO) |
Kanović, Z.; Computing and Control Department, Faculty of Technical Sciences, Serbia;
© Copyright 2009 Elsevier B.V., All rights reserved.