Enhancing the NichePSO

The NichePSO was developed as one of the first particle swarm optimization (PSO) approaches to locate multiple solutions to continuous optimization problems. The NichePSO forms subswarms from a main swarm, where each subswarm represents a single niche (or solution). Mechanisms are employed to merge subswarms if they converge to the same solution, and also to absorb any particle within a subswarm if that particle enters the area covered by the subswarm. The NichePSO has shown very good performance in locating a good number of solutions to multimodal problems. However, it was found that the current subswarm merging and particle absorption strategies are premature, and limits exploration in the main swarm. This paper proposes a number of different merging and absorption strategies, and shows that fine tuning of these processes improves the performance of NichePSO on lower dimensional problems.

[1]  A. Engelbrecht,et al.  Using vector operations to identify niches for particle swarm optimization , 2004, IEEE Conference on Cybernetics and Intelligent Systems, 2004..

[2]  Andries Petrus Engelbrecht,et al.  Fundamentals of Computational Swarm Intelligence , 2005 .

[3]  Michael J. Shaw,et al.  A Double-Layered Learning Approach to Acquiring Rules for Classification: Integrating Genetic Algorithms with Similarity-Based Learning , 1994, INFORMS J. Comput..

[4]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[5]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[6]  Andries Petrus Engelbrecht,et al.  Locating multiple optima using particle swarm optimization , 2007, Appl. Math. Comput..

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

[8]  Xiaodong Li,et al.  A particle swarm model for tracking multiple peaks in a dynamic environment using speciation , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[9]  Andries Petrus Engelbrecht,et al.  Scalability of niche PSO , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[10]  Ralph R. Martin,et al.  A Sequential Niche Technique for Multimodal Function Optimization , 1993, Evolutionary Computation.

[11]  K. Parsopoulos,et al.  Stretching technique for obtaining global minimizers through Particle Swarm Optimization , 2001 .

[12]  V. Rao Vemuri,et al.  Multiniche Crowding in Genetic Algorithms and Its Application to the Assembly of DNA Restriction-Fragments , 1994, Evolutionary Computation.

[13]  A. Engelbrecht,et al.  A new locally convergent particle swarm optimiser , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[14]  Frans van den Bergh,et al.  An analysis of particle swarm optimizers , 2002 .

[15]  Anil K. Jain,et al.  Fingerprint classification and matching using a filterbank , 2001 .

[16]  Michael N. Vrahatis,et al.  Computing periodic orbits of nondifferentiable/discontinuous mappings through particle swarm optimization , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[17]  R. Brits,et al.  Solving systems of unconstrained equations using particle swarm optimization , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[18]  Riaan Brits.  Niching strategies for particle swarm optimization , 2005 .

[19]  Giacomo Tommei,et al.  Multiple solutions for asteroid orbits: Computational procedure and applications , 2005 .

[20]  James Kennedy,et al.  The particle swarm: social adaptation of knowledge , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[21]  Andries P. Engelbrecht,et al.  A Parallel Vector-Based Particle Swarm Optimizer , 2005 .