title: Incremental social learning in particle swarms.
abstract: 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.
authors.affiliation: Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle (IRIDIA), Université Libre de Bruxelles (ULB), Brussels, Belgium. mmontes@ulb.ac.be
authors.forename: Marco A Montes
authors.initials: MA
authors.lastname: de Oca
authors.forename: Thomas
authors.initials: T
authors.lastname: Stutzle
authors.forename: Ken
authors.initials: K
authors.lastname: Van den Enden
authors.forename: Marco
authors.initials: M
authors.lastname: Dorigo
mesh_terms: D000465:Algorithms; D000818:Animals; D001185:Artificial Intelligence; D032701:Biomimetics / Q000379:methods*; D003198:Computer Simulation; D003441:Crowding; D003661:Decision Support Techniques; D006801:Humans; D007858:Learning; D008962:Models, Theoretical; D012919:Social Behavior