Covariance matrix adaptation evolution strategy (CMA-ES) has demonstrated competitive performance especially on multimodal non-separable problems. However, CMA-ES is not capable of dealing with problems having several hundreds dimensions. Motivated by that cooperative coevolution (CC) has scaled up many kinds of evolutionary algorithms (EAs) to high dimensional optimization problems effectively, we propose an algorithm called CC-CMA-ES which apply CC to CMA-ES in order to scale up CMA-ES to large scale problems. CC-CMA-ES adopts a new sampling scheme which does not divide population into small subpopulations and conducts mutation and crossover operations in subpopulation to generate offspring, but extracts a subspace Gaussian distribution from the global Gaussian distribution for subspace sampling. Also in CC-CMA-ES, two new decomposition strategies are proposed in order to balance exploration and exploitation. Lastly, an adaptive scheme is adopted to self-adapt appropriate decomposition strategy during evolution process. Experimental studies on a series of benchmark functions with different characteristic have been conducted and verified the excellent performance of our newly proposed algorithm and the effectiveness of the new decomposition strategies. © 2013 Springer-Verlag.
CITATION STYLE
Liu, J., & Tang, K. (2013). Scaling up covariance matrix adaptation evolution strategy using cooperative coevolution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8206 LNCS, pp. 350–357). https://doi.org/10.1007/978-3-642-41278-3_43
Mendeley helps you to discover research relevant for your work.