arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.09703cs.NE
收藏

基于细粒度计算资源分配策略的协同进化算法

Boosting Cooperative Coevolution for Large Scale Optimization with a Fine-Grained Computation Resource Allocation Strategy

Zhigang Ren, Yongsheng Liang, Aimin Zhang, Yang Yang, Zuren Feng, Lin Wang

摘要:

协同进化在解决大规模优化问题中显示出巨大的潜力。然而,传统的CC算法往往浪费部分计算资源(CR),因为他们平均分配CR的所有子问题。最近发展起来的基于贡献的CC(CBCC)算法通过根据启发式规则自适应地分配CR,在一定程度上改进了传统的CC算法。与现有研究不同,本文针对CC中的CR分配(CRA)问题,建立了明确的数学模型,并充分考虑CRA模型的理论最优解和CC的演化特性,提出了一种新的细粒度CRA(FCRA)策略. FCRA以单次迭代为基本单元,选择对总适应度提高贡献最大的子问题进行新一次迭代,根据子问题当前的贡献、当前的演化状态以及当前贡献的估计来估计子问题在新一次迭代中的贡献.我们通过将FCRA与SHADE相结合来验证FCRA的效率,SHADE是一种优秀的差分进化变体,但从未在CC框架中使用过。两个基准套件的LSOP的实验结果表明,FCRA显着优于现有的CRA策略和由此产生的CC算法在解决LSOP具有很强的竞争力。

英文摘要:

Cooperative coevolution (CC) has shown great potential in solving large scale optimization problems (LSOPs). However, traditional CC algorithms often waste part of computation resource (CR) as they equally allocate CR among all the subproblems. The recently developed contribution-based CC (CBCC) algorithms improve the traditional ones to a certain extent by adaptively allocating CR according to some heuristic rules. Different from existing works, this study explicitly constructs a mathematical model for the CR allocation (CRA) problem in CC and proposes a novel fine-grained CRA (FCRA) strategy by fully considering both the theoretically optimal solution of the CRA model and the evolution characteristics of CC. FCRA takes a single iteration as a basic CRA unit and always selects the subproblem which is most likely to make the largest contribution to the total fitness improvement to undergo a new iteration, where the contribution of a subproblem at a new iteration is estimated according to its current contribution, current evolution status as well as the estimation for its current contribution. We verified the efficiency of FCRA by combining it with SHADE which is an excellent differential evolution variant but has never been employed in the CC framework. Experimental results on two benchmark suites for LSOPs demonstrate that FCRA significantly outperforms existing CRA strategies and the resultant CC algorithm is highly competitive in solving LSOPs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑