Scalability of niche PSO

In contrast to optimization techniques intended to find a single, global solution in a problem domain, niching (speciation) techniques have the ability to locate multiple solutions in multimodal domains. Numerous niching techniques have been proposed, broadly classified as temporal (locating solutions sequentially) and parallel (multiple solutions are found concurrently) techniques. Most research efforts to date have considered niching solutions through the eyes of genetic algorithms (GA), studying simple multimodal problems. Little attention has been given to the possibilities associated with emergent swarm intelligence techniques. Particle swarm optimization (PSO) utilizes properties of swarm behaviour not present in evolutionary algorithms such as GA, to rapidly solve optimization problems. This paper investigates the ability of two genetic algorithm niching techniques, sequential niching and deterministic crowding, to scale to higher dimensional domains with large numbers of solutions, and compare their performance to a PSO-based niching technique, Niche PSO.

[1]  J. Kennedy.  Stereotyping: improving particle swarm performance with cluster analysis , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

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

[3]  Frans van den Bergh,et al.  A NICHING PARTICLE SWARM OPTIMIZER , 2002 .

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

[5]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[7]  Jeffrey Horn,et al.  The nature of niching: genetic algorithms and the evolution of optimal, cooperative populations , 1997 .

[8]  Michael J. Shaw,et al.  Genetic algorithms with dynamic niche sharing for multimodal function optimization , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[9]  James Kennedy,et al.  Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[10]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[11]  David E. Goldberg,et al.  Probabilistic Crowding: Deterministic Crowding with Probabilistic Replacement , 1999 .

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

[13]  D. Goldberg,et al.  Adaptive Niching via coevolutionary Sharing , 1997 .

[14]  Georges R. Harik,et al.  Finding Multimodal Solutions Using Restricted Tournament Selection , 1995, ICGA.

[15]  K. Warwick,et al.  Dynamic Niche Clustering: a fuzzy variable radius niching technique for multimodal optimisation in GAs , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[16]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[17]  Kalyanmoy Deb,et al.  Massive Multimodality, Deception, and Genetic Algorithms , 1992, PPSN.

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

[19]  Samir W. Mahfoud.  A Comparison of Parallel and Sequential Niching Methods , 1995, ICGA.

[20]  Kevin Warwick,et al.  A Variable Radius Niching Technique for Speciation in Genetic Algorithms , 2000, GECCO.

[21]  Michael N. Vrahatis,et al.  Modification of the Particle Swarm Optimizer for Locating All the Global Minima , 2001 .

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

[23]  Samir W. Mahfoud.  Niching methods for genetic algorithms , 1996 .