Effect of the Dynamic Topology on the Performance of PSO-2S Algorithm for Continuous Optimization

PSO-2S is a multi-swarm PSO algorithm using charged particles in a partitioned search space for continuous optimization problems. In order to improve the performance of PSO-2S, this paper proposes a novel variant of this algorithm, called DPSO-2S, which uses the Dcluster neighborhood topologies to organize the communication networks between the particles. Experiments were conducted on a set of classical benchmark functions. The obtained results prove the effectiveness of the proposed algorithm.

[1]  Laurent Deroussi,et al.  Dynamic cluster in particle swarm optimization algorithm , 2014, Natural Computing.

[2]  Amir Nakib,et al.  A New Multiagent Algorithm for Dynamic Continuous Optimization , 2010, Int. J. Appl. Metaheuristic Comput..

[3]  N. J. A. Sloane,et al.  Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.

[4]  José Neves,et al.  The fully informed particle swarm: simpler, maybe better , 2004, IEEE Transactions on Evolutionary Computation.

[5]  J. Kennedy,et al.  Population structure and particle swarm performance , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[6]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[7]  Patrick Siarry,et al.  A multi-swarm PSO using charged particles in a partitioned search space for continuous optimization , 2012, Comput. Optim. Appl..