Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
429144 | Information Processing Letters | 2009 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics