4.6 Article

Cooperative coevolution for large-scale global optimization based on fuzzy decomposition

期刊

SOFT COMPUTING
卷 25, 期 5, 页码 3593-3608

出版社

SPRINGER
DOI: 10.1007/s00500-020-05389-3

关键词

Large-scale global optimization; Spectral clustering; Differential grouping; Cooperative co-evolution

资金

  1. National Key R&D Program of China [2017YFC1601800, 2017YFC1601000]
  2. National Natural Science foundation of China [61673194, 61672263]
  3. Key Research and Development Program of Jiangsu Province, China [BE2017630]
  4. Blue Project in Jiangsu Universities
  5. Postdoctoral Science Foundation of China [2014M560390]

向作者/读者索取更多资源

Cooperative coevolution is an effective strategy for solving large-scale global optimization by decomposing the problem into lower-dimensional subproblems. Differential Grouping is a competitive decomposition method, but faces challenges with overlapping problems. A novel fuzzy decomposition algorithm based on interaction degree has been proposed to address this issue.
Cooperative coevolution (CC) is an effective evolutionary divide-and-conquer strategy that solves large-scale global optimization (LSGO) by decomposing the problem into a set of lower-dimensional subproblems. The main challenge of CC is to find an optimal decomposition. Differential Grouping (DG) is a competitive decomposition method to identify the variable interaction with several improved versions like GDG and DG2. Although DG-based decomposition methods have shown superior performance compared to the other decomposition methods, they still have difficulty to deal with the overlapping problems since their optimal decomposition is unknown. To address this issue, instead of pursuing the high accuracy of decomposition, we propose a novel fuzzy decomposition algorithm that groups the variables according to their interaction degree. In the proposed fuzzy decomposition algorithm, the interaction structure matrix and the interactive degree for a LSGO problem are calculated at first according to the interaction among all the decision variables. Then the number of subgroups is determined based on the interactive degree. Based on the interaction structure matrix, a spectral clustering algorithm is proposed to decompose the decision variables with regard to the number of subgroups in order to achieve a better balance between high grouping accuracy and suitable group size. The proposed decomposition algorithm with DECC has been proven to outperform several state-of-the-art algorithms on the latest LSGO benchmark functions.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据