par Montes De Oca Roldan, Marco 
;Stützle, Thomas ;Van Den Enden, Ken;Dorigo, Marco
Référence IEEE transactions on systems, man and cybernetics. Part B. Cybernetics, 41, 2, page (368-384), 5582312
Publication Publié, 2010-09
;Stützle, Thomas ;Van Den Enden, Ken;Dorigo, Marco Référence IEEE transactions on systems, man and cybernetics. Part B. Cybernetics, 41, 2, page (368-384), 5582312
Publication Publié, 2010-09
Article révisé par les pairs
| Résumé : | Incremental social learning (ISL) was proposed as a way to improve the scalability of systems composed of multiple learning agents. In this paper, we show that ISL can be very useful to improve the performance of population-based optimization algorithms. Our study focuses on two particle swarm optimization (PSO) algorithms: a) the incremental particle swarm optimizer (IPSO), which is a PSO algorithm with a growing population size in which the initial position of new particles is biased toward the best-so-far solution, and b) the incremental particle swarm optimizer with local search (IPSOLS), in which solutions are further improved through a local search procedure. We first derive analytically the probability density function induced by the proposed initialization rule applied to new particles. Then, we compare the performance of IPSO and IPSOLS on a set of benchmark functions with that of other PSO algorithms (with and without local search) and a random restart local search algorithm. Finally, we measure the benefits of using incremental social learning on PSO algorithms by running IPSO and IPSOLS on problems with different fitness distance correlations. |
