In recent years, Cooperative Coevolution (CC) was proposed as a promising framework for tackling high-dimensional optimization problems. The main idea of CC-based algorithms is to discover which decision variables, i.e, dimensions, of the search space interact. Non-interacting variables can be optimized as separate problems of lower dimensionality. Interacting variables must be grouped together and optimized jointly. Early research in this area started with simple attempts such as one-dimension based and splitting-in-half methods. Later, more efficient algorithms with new grouping strategies, such as DECC-G and MLCC, were proposed. However, those grouping strategies still cannot sufficiently adapt to different group sizes. In this paper, we propose a new CC framework named Cooperative Coevolution with Variable Interaction Learning (CCVIL), which initially considers all variables as independent and puts each of them into a separate group. Iteratively, it discovers their relations and merges the groups accordingly. The efficiency of the newly proposed framework is evaluated on the set of large-scale optimization benchmarks. © 2010 Springer-Verlag.
CITATION STYLE
Chen, W., Weise, T., Yang, Z., & Tang, K. (2010). Large-scale global optimization using cooperative coevolution with variable interaction learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6239 LNCS, pp. 300–309). https://doi.org/10.1007/978-3-642-15871-1_31
Mendeley helps you to discover research relevant for your work.