Grammatical Swarm Based-Adaptable Velocity Update Equations in Particle Swarm Optimizer

In this work, a new method for creating diversity in Particle Swarm Optimization is devised. The key feature of this method is to derive velocity update equation for each particle in Particle Swarm Optimizer using Grammatical Swarm algorithm. Grammatical Swarm is a Grammatical Evolution algorithm based on Particle Swarm Optimizer. Each particle updates its position by updating velocity. In classical Particle Swarm Optimizer, same velocity update equation for all particles is responsible for creating diversity in the population. Particle Swarm Optimizer has quick convergence but suffers from premature convergence in local optima due to lack in diversity. In the proposed method, different velocity update equations are evolved using Grammatical Swarm for each particles to create the diversity in the population. The proposed method is applied on 8 well-known benchmark unconstrained optimization problems and compared with Comprehensive Learning Particle Swarm Optimizer. Experimental results show that the proposed method performed better than Comprehensive Learning Particle Swarm Optimizer.

[1]  Tapas Si,et al.  Particle Swarm Optimization with adaptive polynomial mutation , 2011, 2011 World Congress on Information and Communication Technologies.

[2]  Nanda Dulal Jana,et al.  Particle Swarm Optimization with Adaptive Mutation in Local Best of Particles , 2012 .

[3]  Jing J. Liang,et al.  Comprehensive learning particle swarm optimizer for global optimization of multimodal functions , 2006, IEEE Transactions on Evolutionary Computation.

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

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

[6]  Jaya Sil,et al.  Constrained Function Optimization Using PSO with Polynomial Mutation , 2011, SEMCCO.

[7]  Hui Wang,et al.  A Fast Particle Swarm Optimization Algorithm with Cauchy Mutation and Natural Selection Strategy , 2007, ISICA.

[8]  Conor Ryan,et al.  Grammatical Evolution , 2001, Genetic Programming Series.

[9]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[10]  Sanyou Zeng,et al.  Advances in Computation and Intelligence, Second International Symposium, ISICA 2007, Wuhan, China, September 21-23, 2007, Proceedings , 2007, ISICA.

[11]  Nanda Dulal Jana,et al.  Particle swarm optimisation with differential mutation , 2012, Int. J. Intell. Syst. Technol. Appl..

[12]  Jun Tang,et al.  Particle Swarm Optimization with Adaptive Mutation , 2009, 2009 WASE International Conference on Information Engineering.

[13]  Hitoshi Iba,et al.  Particle swarm optimization with Gaussian mutation , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[14]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[15]  Anthony Brabazon,et al.  Grammatical Swarm: The generation of programs by social programming , 2006, Natural Computing.

[16]  Muhammad Rashid,et al.  Combining Pso Algorithm and Honey Bee Food Foraging Behavior for Solving Multimodal and Dynamic Optimization Problems , 2010 .

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