Particle Swarm Optimization with Distance Based Repulsivity

In this study, we propose a repulsive mechanism for the Particle Swarm Optimization algorithm that improves its performance on multi-modal problems. The repulsive mechanism is further extended with a distance-based modification. The results are presented and tested for statistical significance. We discuss the observations and propose further directions for the research.

[1]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[2]  James Kennedy,et al.  The particle swarm: social adaptation of knowledge , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[3]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[4]  Johannes M. Dieterich,et al.  Empirical review of standard benchmark functions using evolutionary global optimization , 2012, ArXiv.

[5]  Mohammad Mehdi Ebadzadeh,et al.  A novel particle swarm optimization algorithm with adaptive inertia weight , 2011, Appl. Soft Comput..

[6]  Jacques Riget,et al.  A Diversity-Guided Particle Swarm Optimizer - the ARPSO , 2002 .

[7]  Andries Petrus Engelbrecht,et al.  A study of particle swarm optimization particle trajectories , 2006, Inf. Sci..

[8]  A. P. Engelbrecht.  Particle Swarm Optimization: Iteration Strategies Revisited , 2013, 2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence.

[9]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).