Comparison of self-adaptive particle swarm optimizers

Particle swarm optimization (PSO) algorithms have a number of parameters to which their behaviour is sensitive. In order to avoid problem-specific parameter tuning, a number of self-adaptive PSO algorithms have been proposed over the past few years. This paper compares the behaviour and performance of a selection of self-adaptive PSO algorithms to that of time-variant algorithms on a suite of 22 boundary constrained benchmark functions of varying complexities. It was found that only two of the nine selected self-adaptive PSO algorithms performed comparably to similar time-variant PSO algorithms. Possible reasons for the poor behaviour of the other algorithms as well as an analysis of the more successful algorithms is performed in this paper.

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

[2]  Xiufen Li,et al.  A Self-Adaptive Particle Swarm Optimization Algorithm , 2008, 2008 International Conference on Computer Science and Software Engineering.

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

[4]  Guoqing Li,et al.  A Self-Adaptive Improved Particle Swarm Optimization Algorithm and Its Application in Available Transfer Capability Calculation , 2009, 2009 Fifth International Conference on Natural Computation.

[5]  Xuehu Yan,et al.  An Improved Algorithm for Iris Location , 2007 .

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

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

[8]  Gaofeng Wang,et al.  A Method of Self-Adaptive Inertia Weight for PSO , 2008, 2008 International Conference on Computer Science and Software Engineering.

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

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

[11]  Saman K. Halgamuge,et al.  Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients , 2004, IEEE Transactions on Evolutionary Computation.

[12]  Jianzhong Zhou,et al.  A Self-Adaptive Particle Swarm Optimization Algorithm with Individual Coefficients Adjustment , 2007, 2007 International Conference on Computational Intelligence and Security (CIS 2007).

[13]  R. Eberhart,et al.  Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[14]  Jiangye Yuan,et al.  A modified particle swarm optimizer with dynamic adaptation , 2007, Appl. Math. Comput..

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

[16]  Li Jian,et al.  An Improved Self-Adaptive Particle Swarm Optimization Algorithm with Simulated Annealing , 2009, 2009 Third International Symposium on Intelligent Information Technology Application.