.png){kind=icon}
返回
An improved decomposition method for large-scale global optimization: bidirectional-detection differential grouping
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-021-03023-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Differential grouping (DG) is an efficient decomposition method that is used to solve large-scale global optimization (LSGO) problems. To further reduce the computational cost, a bidirectional-detection differential grouping (BDDG) method is proposed in this paper. By exploiting the bidirectional detection structure (BDS), BDDG is able to spend less computation than other DG-based methods. An adaptive perturbation strategy (APS) is proposed to improve the problem with the BDS decomposition accuracy. Analytical methods are used to demonstrate that the complexity of BDDG is lower than that of other state-of-the-art DG-based methods. Experiments showed that BDDG substantially reduced the computational cost for problem decomposition and that the computational cost used by BDDG grew slowly, as the problem dimension grew compared to other DG-based methods. When BDDG was embedded in the cooperative coevolution (CC) framework, it improved the performance of the CC for solving LSGO problems.
Keyword:
Large-Scale global optimization
Problem decomposition
Differential grouping
Cooperative coevolution
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
Segment-Based Predominant Learning Swarm Optimizer for Large-Scale Optimization用于大规模优化的基于分段的优势学习群优化器
OAAI
.png){kind=icon}
OAAI分享收藏A topology-based single-pool decomposition framework for large-scale global optimization一种基于拓扑的大规模全局优化单池分解框架
PREAI
分享收藏Cooperative Co-Evolution With Differential Grouping for Large Scale Optimization面向大规模优化的差分分组协同进化算法
OAAI
OAAI分享收藏
查看更多内容