Hybrid learning particle swarm optimizer with genetic disturbance

Abstract Particle swarm optimizer (PSO) is a population-based stochastic optimization technique which has already been successfully applied to the engineering and other scientific fields. This paper presents a modification of PSO (hybrid learning PSO with genetic disturbance, HLPSO-GD for short) intended to combat the problem of premature convergence observed in many PSO variants. In HLPSO-GD, the swarm uses a hybrid learning strategy whereby all other particles’ previous best information is adopted to update a particle׳s position. Additionally, to better make use of the excellent particle׳s information, the global external archive is introduced to store the best performing particle in the whole swarm. Furthermore, the genetic disturbance (simulated binary crossover and polynomial mutation) is used to cross the corresponding particle in the external archive, and generate new individuals which will improve the swarm ability to escape from the local optima. Experiments were conducted on a set of traditional multimodal test functions and CEC 2013 benchmark functions. The results demonstrate the good performance of HLPSO-GD in solving multimodal problems when compared with the other PSO variants.

[1]  Ben Niu,et al.  A Novel PSO Model Based on Simulating Human Social Communication Behavior , 2012 .

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

[3]  Kalyanmoy Deb,et al.  Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..

[4]  Peter J. Angeline,et al.  Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences , 1998, Evolutionary Programming.

[5]  Xiaodong Li,et al.  Adaptively Choosing Neighbourhood Bests Using Species in a Particle Swarm Optimizer for Multimodal Function Optimization , 2004, GECCO.

[6]  Shao Zeng-zhen.  Particle swarm optimizer based on dynamic neighborhood topology and mutation operator , 2010 .

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

[8]  Visakan Kadirkamanathan,et al.  Stability analysis of the particle dynamics in particle swarm optimizer , 2006, IEEE Transactions on Evolutionary Computation.

[9]  Wen-Chih Peng,et al.  Particle Swarm Optimization With Recombination and Dynamic Linkage Discovery , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

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

[11]  Hassan M. Emara,et al.  Clubs-based Particle Swarm Optimization , 2007, 2007 IEEE Swarm Intelligence Symposium.

[12]  Martin Middendorf,et al.  A hierarchical particle swarm optimizer and its adaptive variant , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[13]  Peter J. Bentley,et al.  Don't push me! Collision-avoiding swarms , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[14]  Lin Han,et al.  A Novel Opposition-Based Particle Swarm Optimization for Noisy Problems , 2007, Third International Conference on Natural Computation (ICNC 2007).

[15]  Mahamed G. H. Omran,et al.  Using opposition-based learning to improve the performance of particle swarm optimization , 2008, 2008 IEEE Swarm Intelligence Symposium.

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

[17]  Jun Zhang,et al.  Orthogonal Learning Particle Swarm Optimization , 2011, IEEE Trans. Evol. Comput..

[18]  Kalyanmoy Deb,et al.  A combined genetic adaptive search (GeneAS) for engineering design , 1996 .

[19]  Christian Posthoff,et al.  Neighborhood Re-structuring in Particle Swarm Optimization , 2005, Australian Conference on Artificial Intelligence.

[20]  Russell C. Eberhart,et al.  Comparison between Genetic Algorithms and Particle Swarm Optimization , 1998, Evolutionary Programming.

[21]  Changhe Li,et al.  A Clustering Particle Swarm Optimizer for Locating and Tracking Multiple Optima in Dynamic Environments , 2010, IEEE Transactions on Evolutionary Computation.

[22]  Jing J. Liang,et al.  Dynamic multi-swarm particle swarm optimizer with local search for Large Scale Global Optimization , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

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

[24]  Ge Xiurun,et al.  An improved PSO-based ANN with simulated annealing technique , 2005, Neurocomputing.

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

[26]  Anup Kumar Bhattacharjee,et al.  Grammatical Swarm Based-Adaptable Velocity Update Equations in Particle Swarm Optimizer , 2013, FICTA.

[27]  Kalyan Veeramachaneni,et al.  Fitness-distance-ratio based particle swarm optimization , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

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

[29]  R. Salomon.  Re-evaluating genetic algorithm performance under coordinate rotation of benchmark functions. A survey of some theoretical and practical aspects of genetic algorithms. , 1996, Bio Systems.

[30]  Chen-Chien James Hsu,et al.  Enhanced particle swarm optimizer incorporating a weighted particle , 2014, Neurocomputing.