Niching method using clustering crowding

This study analyzes drift phenomena of deterministic crowding and probabilistic crowding by using equivalence class model and expectation proportion equations. It is proved that the replacement errors of deterministic crowding cause the population converging to a single individual, thus resulting in premature stagnation or losing optional optima. And probabilistic crowding can maintain equilibrium multiple subpopulations as the population size is adequate large. An improved niching method using clustering crowding is proposed. By analyzing topology of fitness landscape using hill valley function and extending the search space for similarity analysis, clustering crowding determines the locality of search space more accurately, thus greatly decreasing replacement errors of crowding. The integration of deterministic and probabilistic replacement increases the capacity of both parallel local hill climbing and maintaining multiple subpopulations. The experimental results optimizing various multimodal functions show that, the performances of clustering crowding, such as the number of effective peaks maintained, average peak ratio and global optimum ratio are uniformly superior to those of the evolutionary algorithms using fitness sharing, simple deterministic crowding and probabilistic crowding.

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

[2]  R. K. Ursem Multinational evolutionary algorithms , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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

[4]  Bruno Sareni,et al.  Fitness sharing and niching methods revisited , 1998, IEEE Trans. Evol. Comput..

[5]  Márk Jelasity,et al.  GAs, a Concept of Modeling Species in Genetic Algorithms , 1995, Artificial Evolution.

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

[7]  Alain Pétrowski,et al.  A clearing procedure as a niching method for genetic algorithms , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[8]  白鳥 則郎,et al.  ADIPSフレームワークにおける Java オブジェクトのエージェント化実現方式 , 1999 .

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

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

[11]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[12]  Günter Neumann,et al.  Interleaving Natural Language Parsing and Generation Through Uniform Processing , 1998, Artif. Intell..