title: Multimodal Optimization by Covariance Matrix Self-Adaptation Evolution Strategy with Repelling Subpopulations.
abstract: During the recent decades, many niching methods have been proposed and empirically verified on some available test problems. They often rely on some particular assumptions associated with the distribution, shape, and size of the basins, which can seldom be made in practical optimization problems. This study utilizes several existing concepts and techniques, such as taboo points, normalized Mahalanobis distance, and the Ursem's hill-valley function in order to develop a new tool for multimodal optimization, which does not make any of these assumptions. In the proposed method, several subpopulations explore the search space in parallel. Offspring of a subpopulation are forced to maintain a sufficient distance to the center of fitter subpopulations and the previously identified basins, which are marked as taboo points. The taboo points repel the subpopulation to prevent convergence to the same basin. A strategy to update the repelling power of the taboo points is proposed to address the challenge of basins of dissimilar size. The local shape of a basin is also approximated by the distribution of the subpopulation members converging to that basin. The proposed niching strategy is incorporated into the covariance matrix self-adaptation evolution strategy (CMSA-ES), a potent global optimization method. The resultant method, called the covariance matrix self-adaptation with repelling subpopulations (RS-CMSA), is assessed and compared to several state-of-the-art niching methods on a standard test suite for multimodal optimization. An organized procedure for parameter setting is followed which assumes a rough estimation of the desired/expected number of minima available. Performance sensitivity to the accuracy of this estimation is also studied by introducing the concept of robust mean peak ratio. Based on the numerical results using the available and the introduced performance measures, RS-CMSA emerges as the most successful method when robustness and efficiency are considered at the same time.
authors.affiliation: Department of Mechanical Engineering, Michigan State University, East Lansing, MI 48824, USA aliahrari1983@gmail.com.
authors.forename: Ali
authors.initials: A
authors.lastname: Ahrari
authors.affiliation: Department of Electrical and Computer Engineering, Michigan State University, East Lansing, MI 48824, USA kdeb@egr.msu.edu.
authors.forename: Kalyanmoy
authors.initials: K
authors.lastname: Deb
authors.affiliation: Department of Computer Science, TU Dortmund University, Germany mike.preuss@cs.tu-dortmund.de.
authors.forename: Mike
authors.initials: M
authors.lastname: Preuss
mesh_terms: D000465:Algorithms; D005075:Biological Evolution; D019295:Computational Biology / Q000379:methods*; D006801:Humans; D008954:Models, Biological
keywords: CEC2013 test suite; Mahalanobis distance metric; Niching; adaptive normalized niche radius; robust mean peak ratio