A Subspace-Based Method for PSO Initialization

Particle swarm optimization (PSO) is known to suffer under the curse of dimensionality. This paper proposes a novel strategy of particle swarm initialization particularly for high dimensional problems. The initialization strategy encourages the swarm to focus on exploitation rather than exploration, thereby allowing it to find fairly good solutions, even in the face of high dimensionality and very large search spaces. The proposed initialization strategy is compared to a number of other initialization strategies on high dimensional problems. The proposed strategy performed considerably better than all the other initialization strategies for the higher dimensional problems. Reasons for the observed behaviour are also discussed.

[1]  John Fulcher,et al.  Computational Intelligence: An Introduction , 2008, Computational Intelligence: A Compendium.

[2]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[3]  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).

[4]  Andries Petrus Engelbrecht,et al.  Measuring exploration/exploitation in particle swarms using swarm diversity , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[5]  Tim Blackwell,et al.  Particle Swarm Optimization in Dynamic Environments , 2007, Evolutionary Computation in Dynamic and Uncertain Environments.

[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]  C.A. Coello Coello,et al.  MOPSO: a proposal for multiple objective particle swarm optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[8]  Konstantinos E. Parsopoulos,et al.  Initializing the Particle Swarm Optimizer Using the Nonlinear Simplex Method , 2002 .

[9]  Qiang Du,et al.  Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations , 2002, Parallel Comput..

[10]  A. P. Engelbrecht,et al.  Particle Swarm Optimization: Global Best or Local Best? , 2013, 2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence.

[11]  Mark Richards,et al.  Choosing a starting configuration for particle swarm optimization , 2004, 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541).

[12]  Xin-She Yang,et al.  A literature survey of benchmark functions for global optimisation problems , 2013, Int. J. Math. Model. Numer. Optimisation.

[13]  Andries Petrus Engelbrecht,et al.  Effect of Particle Initialization on the Performance of Particle Swarm Niching Algorithms , 2010, ANTS Conference.

[14]  Frances Y. Kuo,et al.  Remark on algorithm 659: Implementing Sobol's quasirandom sequence generator , 2003, TOMS.

[15]  Andries Petrus Engelbrecht,et al.  A Cooperative approach to particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[16]  Shahriar Lotfi,et al.  The Modified Differential Evolution Algorithm (MDEA) , 2012, ACIIDS.

[17]  Ellips Masehian,et al.  Particle Swarm Optimization Methods, Taxonomy and Applications , 2009 .

[18]  Frans van den Bergh,et al.  A NICHING PARTICLE SWARM OPTIMIZER , 2002 .

[19]  Miroslav Rozlozník,et al.  Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES , 2006, SIAM J. Matrix Anal. Appl..