Comparison of multi-modal optimization algorithms based on evolutionary algorithms

Many engineering optimization tasks involve finding more than one optimum solution. The present study provides a comprehensive review of the existing work done in the field of multi-modal function optimization and provides a critical analysis of the existing methods. Existing niching methods are analyzed and an improved niching method is proposed. To achieve this purpose, we first give an introduction to niching and diversity preservation, followed by discussion of a number of algorithms. Thereafter, a comparison of clearing, clustering, deterministic crowding, probabilistic crowding, restricted tournament selection, sharing, species conserving genetic algorithms is made. A modified niching-based technique -- modified clearing approach -- is introduced and also compared with existing methods. For comparison, a versatile hump test function is also proposed and used together with two other functions. The ability of the algorithms in finding, locating, and maintaining multiple optima is judged using two performance measures: (i) number of peaks maintained, and (ii) computational time. Based on the results, we conclude that the restricted tournament selection and the proposed modified clearing approaches are better in terms of finding and maintaining the multiple optima.

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

[2]  A. Pétrowski An Efficient Hierarchical Clustering Technique for Speciation , 2007 .

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

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

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

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

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

[8]  Xiaodong Yin,et al.  Investigations On Solving the Load Flow Problem By Genetic Algorithms , 1991 .

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

[10]  P. John Clarkson,et al.  A Species Conserving Genetic Algorithm for Multimodal Function Optimization , 2002, Evolutionary Computation.

[11]  P. John Clarkson,et al.  Erratum: A Species Conserving Genetic Algorithm for Multimodal Function Optimization , 2003, Evolutionary Computation.

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

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

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

[15]  Samir W. Mahfoud Simple Analytical Models of Genetic Algorithms for Multimodal Function Optimization , 1993, ICGA.

[16]  Kalyanmoy Deb,et al.  An Investigation of Niche and Species Formation in Genetic Function Optimization , 1989, ICGA.

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