The cooperative coevolution (CC) framework achieves a promising performance in solving large scale global optimization problems. The framework encounters difficulties on nonseparable problems, where variables interact with each other. Using the static grouping methods, variables will be theoretically grouped into one big subcomponent, whereas the random grouping strategy endures low efficiency. In this paper, a dynamic CC framework is proposed to tackle the challenge. The proposed framework works in a computationally efficient manner, in which the computational resources are allocated to a series of elitist subcomponents consisting of superior variables. First, a novel estimation method is proposed to evaluate the contribution of variables using the historical information of the best overall fitness. Based on the contribution and the interaction information, a dynamic grouping strategy is conducted to construct the dynamic subcomponent that evolves in the next evolutionary period. The constructed subcomponents are different from each other, and therefore the required parameters to control the optimization of each subcomponent vary a lot in each evolutionary period. A stage-by-stage parameter adaptation strategy is proposed to adapt the optimizer to the dynamic optimization environment. Experimental results indicate that the proposed framework achieves competitive results compared with the state-of-the-art CC frameworks.
Bibliographical noteThis work was supported in part by the National Natural Science Foundation of China under Grant 61873095, Grant 61772569, Grant 61873097, and Grant U1701267, and in part by the Science and Technology Planning Project of Guangdong Province under Grant 2014B050504005.
- Cooperative coevolution (CC)
- dynamic grouping (DyG) strategy
- large scale global optimization (LSGO)
- nonseparable problems