Abstract

Cooperative co-evolution (CC) algorithm is a promising method to deal with large scale optimization (LSGO) problem. One major challenge in CC is to design a good decomposition strategy to decompose original problem into subproblems. Linkage learning is a technique to search the linkage betweens decision variables. In this paper, we proposed a dynamic online grouping CC algorithm which employ the linkage learning method of extended compact genetic algorithm (ECGA). This linkage learning method build marginal product models of population and search for models according to minimum description length (MDL) criterion. A discretization technique and normalization method of MDL value is used to make the linkage learning more adaptive in large scale optimization. The decision variables will be regrouped according to the linkage learned when the optimization procedure is considered as stagnant. Experiments are conduct on CEC'10 LSGO benchmark function. The test results confirm the validity of this method.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.