The merits of velocity clamping particle swarm optimisation in high dimensional spaces

Velocity clamping has been used as a means to prevent particles from leaving the search space by preventing the initial velocity explosion. In high dimensional spaces, particle velocities may become very large and particles are prone to leaving the search space, never to return. This paper examines velocity clamping as a possible solution to this problem. Two different mechanisms of velocity clamping are considered: clamping per dimension and clamping based on the magnitude of the velocity vector. The paper finds that the optimal values to which the velocity is clamped depends on the dimensionality of the problem and that these optimal values decrease as problem dimensionality increases. Stricter clamping values force particles to take smaller step sizes, thereby encouraging exploitative behaviour. This is in line with findings from previous studies regarding the benefits of focusing on exploitation in high dimensional problem spaces. The paper also shows that clamping per dimension performs better than clamping based on the velocity's magnitude. Lastly, the paper concludes that velocity clamping alone does not guarantee that particles will stay within the search space and that even if the particles are successfully confined, the result is a rapid decrease in swarm diversity and premature convergence.

[1]  Andries P. Engelbrecht,et al.  Group-based stochastic scaling for PSO velocities , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[2]  H. Fan A modification to particle swarm optimization algorithm , 2002 .

[3]  Siti Mariyam Shamsuddin,et al.  Particle Swarm Optimization: Technique, System and Challenges , 2011 .

[4]  Andries Petrus Engelbrecht,et al.  The sad state of self-adaptive particle swarm optimizers , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[5]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[6]  Andries P. Engelbrecht,et al.  Image Classification using Particle Swarm Optimization , 2002, SEAL.

[7]  R. W. Dobbins,et al.  Computational intelligence PC tools , 1996 .

[8]  Muhammad Kamran,et al.  Opposition-Based Particle Swarm Optimization with Velocity Clamping (OVCPSO) , 2009 .

[9]  Russell C. Eberhart,et al.  Parameter Selection in Particle Swarm Optimization , 1998, Evolutionary Programming.

[10]  Andries Petrus Engelbrecht,et al.  Particle swarm optimization: Velocity initialization , 2012, 2012 IEEE Congress on Evolutionary Computation.

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

[12]  James Kennedy,et al.  Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[13]  Riccardo Poli,et al.  Mean and Variance of the Sampling Distribution of Particle Swarm Optimizers During Stagnation , 2009, IEEE Transactions on Evolutionary Computation.

[14]  Gang Xu,et al.  An adaptive parameter tuning of particle swarm optimization algorithm , 2013, Appl. Math. Comput..

[15]  A. P. Engelbrecht Roaming Behavior of Unconstrained Particles , 2013, 2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence.

[16]  Zbigniew Michalewicz,et al.  Impacts of Coefficients on Movement Patterns in the Particle Swarm Optimization Algorithm , 2017, IEEE Transactions on Evolutionary Computation.

[17]  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.

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

[19]  Guojun Tan,et al.  A Self-Adaptive Mutation-Particle Swarm Optimization Algorithm , 2008, 2008 Fourth International Conference on Natural Computation.

[20]  Xiaodong Li,et al.  Benchmark Functions for the CEC'2010 Special Session and Competition on Large-Scale , 2009 .

[21]  Andries Petrus Engelbrecht,et al.  A Subspace-Based Method for PSO Initialization , 2015, 2015 IEEE Symposium Series on Computational Intelligence.

[22]  Albert A. Groenwold,et al.  Sizing design of truss structures using particle swarms , 2003 .

[23]  Andries Petrus Engelbrecht,et al.  Particle Swarm Convergence: Standardized Analysis and Topological Influence , 2014, ANTS Conference.

[24]  Andries P. Engelbrecht,et al.  Computational Intelligence: An Introduction , 2002 .

[25]  Rolf Wanka,et al.  Theoretical Analysis of Initial Particle Swarm Behavior , 2008, PPSN.

[26]  Paulo Cortez,et al.  Particle swarms for feedforward neural network training , 2002, Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290).

[27]  Taher Niknam,et al.  A hybrid self-adaptive particle swarm optimization and modified shuffled frog leaping algorithm for distribution feeder reconfiguration , 2010, Eng. Appl. Artif. Intell..

[28]  Andries Petrus Engelbrecht,et al.  Comparison of self-adaptive particle swarm optimizers , 2014, 2014 IEEE Symposium on Swarm Intelligence.

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

[30]  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.

[31]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..