A topological niching covariance matrix adaptation for multimodal optimization

Multimodal optimization attempts to find multiple global and local optima of a function. Finding a set of optimal solutions is particularly important for practical problems. However, this kind of problem requires optimization techniques that demand a high computational cost and a large amount of parameters to be adjusted. These difficulties increase in high-dimensional space problems. In this work, we propose a niching method based on recent developments in the basins (optimal locations) identification to reduce costs and perform better in high-dimensional spaces. Using Nearest-Better Clustering (NBC) and Hill-Valley (or Detect Multimodal) methods, an exploratory initialization routine is employed to identify basins on functions with different levels of complexity. To maintain diversity over the generations, we define a bi-objective function, which is composed by the original fitness function and the distance to the nearest better neighbor, assisted by a reinitialization scheme. The proposed method is implemented using Evolutionary Strategy (ES) known as Covariance Matrix Adaptation (CMA). Unlike recent multimodal approaches using CMA-ES, we use its step size to control the influence of niche, thus avoiding extra efforts in parameterization. We apply a benchmark of 20 test functions, specially designed for multimodal optimization evaluation, and compare the performance with a state-of-the-art method. Finally we discuss the results and show that the proposed approach can reach better and stable results even in high-dimensional spaces.

[1]  Richard J. Beckman,et al.  A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output From a Computer Code , 2000, Technometrics.

[2]  Ofer M. Shir,et al.  Adaptive Niche Radii and Niche Shapes Approaches for Niching with the CMA-ES , 2010, Evolutionary Computation.

[3]  Stefan Roth,et al.  Covariance Matrix Adaptation for Multi-objective Optimization , 2007, Evolutionary Computation.

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

[5]  Mike Preuss,et al.  Improved Topological Niching for Real-Valued Global Optimization , 2012, EvoApplications.

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

[7]  Mike Preuss,et al.  Niching foundations: basin identification on fixed-property generated landscapes , 2011, GECCO '11.

[8]  Kalyanmoy Deb,et al.  Multimodal Optimization Using a Bi-Objective Evolutionary Algorithm , 2012, Evolutionary Computation.

[9]  René Thomsen,et al.  Multimodal optimization using crowding-based differential evolution , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[10]  Nikolaus Hansen,et al.  The CMA Evolution Strategy: A Tutorial , 2016, ArXiv.

[11]  Nikolaus Hansen,et al.  Benchmarking a BI-population CMA-ES on the BBOB-2009 function testbed , 2009, GECCO '09.

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

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

[14]  Mike Preuss,et al.  Niching the CMA-ES via nearest-better clustering , 2010, GECCO '10.

[15]  Kay Chen Tan,et al.  Multimodal Optimization Using a Biobjective Differential Evolution Algorithm Enhanced With Mean Distance-Based Selection , 2013, IEEE Transactions on Evolutionary Computation.

[16]  Nikolaus Hansen,et al.  Completely Derandomized Self-Adaptation in Evolution Strategies , 2001, Evolutionary Computation.

[17]  Mike Preuss,et al.  Counteracting genetic drift and disruptive recombination in (μpluskommaλ)-EA on multimodal fitness landscapes , 2005, GECCO '05.

[18]  Xiaodong Li,et al.  Benchmark Functions for CEC'2013 Special Session and Competition on Niching Methods for Multimodal Function Optimization' , 2013 .

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

[20]  Petros Koumoutsakos,et al.  Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES) , 2003, Evolutionary Computation.

[21]  Aravind Srinivasan,et al.  Innovization: innovating design principles through optimization , 2006, GECCO.

[22]  M. Preuss,et al.  Counteracting genetic drift and disruptive recombination in (μpluskommaλ)-EA on multimodal fitness landscapes , 2005, GECCO '05.

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

[24]  Kalyanmoy Deb,et al.  A parameterless-niching-assisted bi-objective approach to multimodal optimization , 2013, 2013 IEEE Congress on Evolutionary Computation.

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

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

[27]  Ilya Loshchilov,et al.  CMA-ES with restarts for solving CEC 2013 benchmark problems , 2013, 2013 IEEE Congress on Evolutionary Computation.

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

[29]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[30]  Ponnuthurai N. Suganthan,et al.  Real-parameter evolutionary multimodal optimization - A survey of the state-of-the-art , 2011, Swarm Evol. Comput..

[31]  Michael G. Epitropakis,et al.  Finding multiple global optima exploiting differential evolution's niching capability , 2011, 2011 IEEE Symposium on Differential Evolution (SDE).

[32]  Günter Rudolph,et al.  Niching by multiobjectivization with neighbor information: Trade-offs and benefits , 2013, 2013 IEEE Congress on Evolutionary Computation.