Empirical comparison of niching methods on hybrid composition functions

In this paper, we compare the performance of three popular niching genetic algorithms namely deterministic crowding, restricted tournament selection, and clearing by a set of hybrid composition test functions originally proposed for the special session on real parameter optimization at CEC 2005. The number of function evaluations is used as the main control parameter for an unbiased comparison instead of using the generation count as done frequently in the previous comparative studies. Results are given in tables and graphs to show the searching ability, accuracy, and computation time requirement of each method.

[1]  Wagner F. Sacco,et al.  The fuzzy clearing approach for a niching genetic algorithm applied to a nuclear reactor core design optimization problem , 2004 .

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

[3]  Bruno Sareni,et al.  Genetic Algorithms for Optimization in Electromagnetics I. Fundamentals , 1998 .

[4]  Xiaodong Yin,et al.  A Fast Genetic Algorithm with Sharing Scheme Using Cluster Analysis Methods in Multimodal Function Optimization , 1993 .

[5]  Ian C. Parmee,et al.  Adaptive Restricted Tournament Selection for the Identification of Multiple Sub-Optima in a Multi-Modal Function , 1996, Evolutionary Computing, AISB Workshop.

[6]  Bruno Sareni,et al.  Niching genetic algorithms for optimization in electromagnetics. II. Shape optimization of electrodes using the CSM , 1998 .

[7]  Ofer M. Shir,et al.  Niching in evolution strategies , 2005, GECCO '05.

[8]  Grant Dick.  A Comparison of Localised and Global Niching Methods , 2005 .

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

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

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

[12]  Ofer M. Shir,et al.  Self-Adaptive Niching CMA-ES with Mahalanobis Metric , 2007, 2007 IEEE Congress on Evolutionary Computation.

[13]  E. Dilettoso,et al.  A self-adaptive niching genetic algorithm for multimodal optimization of electromagnetic devices , 2006, IEEE Transactions on Magnetics.

[14]  Samir W. Mahfoud.  Crowding and Preselection Revisited , 1992, PPSN.

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

[16]  William W. Melek,et al.  A Genetic Algorithm Approach to solve for Multiple Solutions of Inverse Kinematics using Adaptive Niching and Clustering , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[17]  Kevin Warwick,et al.  A Genetic Algorithm with Dynamic Niche Clustering for Multimodal Function Optimisation , 1999, ICANNGA.

[18]  Jing J. Liang,et al.  Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization , 2005 .

[19]  Francisco Herrera,et al.  Finding multiple solutions in job shop scheduling by niching genetic algorithms , 2003, J. Intell. Manuf..

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

[21]  Kalyanmoy Deb,et al.  Comparison of multi-modal optimization algorithms based on evolutionary algorithms , 2006, GECCO.

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