Information sharing strategy among particles in Particle Swarm Optimization using Laplacian operator

Particle Swarm Optimization (PSO) has been extensively used in recent years for the optimization of nonlinear optimization problems. Two of the most popular variants of PSO are PSO-W (PSO with inertia weight) and PSO-C (PSO with constriction factor). Typically particles in swarm use information from global best performing particle, gbest and their own personal best, pbest. Recently, studies have focused on incorporating influences of other particles other than gbest. In this paper, we develop a methodology to share information between two particles using a Laplacian operator designed from Laplace probability density function. The properties of this operator are analyzed. Two particles share their positional information in the search space and a new particle is formed. The particle, called as Laplacian particle, replaces the worst performing particle in the swarm. Using this new operator, this paper introduces two algorithms namely Laplace Crossover PSO with inertia weight (LXPSO-W) and Laplace Crossover PSO with constriction factor (LXPSO-C). The performance of the newly designed algorithms is evaluated with respect to PSO-W and PSO-C using 15 benchmark test problems. The empirical results show that the new approach improves performance measured in terms of efficiency, reliability and robustness.

[1]  C. Mohan,et al.  A Controlled Random Search Technique Incorporating the Simulated Annealing Concept for Solving Integer and Mixed Integer Global Optimization Problems , 1999, Comput. Optim. Appl..

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

[3]  Albert A. Groenwold,et al.  A Study of Global Optimization Using Particle Swarms , 2005, J. Glob. Optim..

[4]  Han Huang,et al.  A Particle Swarm Optimization Algorithm with Crossover Operator , 2007, 2007 International Conference on Machine Learning and Cybernetics.

[5]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[6]  M. M. Ali,et al.  Improved particle swarm algorithms for global optimization , 2008, Appl. Math. Comput..

[7]  Xiaodong Li,et al.  A multimodal particle swarm optimizer based on fitness Euclidean-distance ratio , 2007, GECCO '07.

[8]  Kalyan Veeramachaneni,et al.  Optimization Using Particle Swarms with Near Neighbor Interactions , 2003, GECCO.

[9]  Dongyong Yang,et al.  Self-Adaptive Crossover Particle Swarm Optimizer for Multi-dimension Functions Optimization , 2007, Third International Conference on Natural Computation (ICNC 2007).

[10]  Zhang Li-ping,et al.  Optimal choice of parameters for particle swarm optimization , 2005 .

[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]  M. Clerc,et al.  The swarm and the queen: towards a deterministic and adaptive particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[13]  Kusum Deep,et al.  A new crossover operator for real coded genetic algorithms , 2007, Appl. Math. Comput..

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