利用成对连锁检测、增量连锁集和限制/反向混合的优化算法:DSMGA- II
Optimization by Pairwise Linkage Detection, Incremental Linkage Set, and Restricted / Back Mixing: DSMGA-II
摘要:
本文提出了一种新的进化算法,称为DSMGA-II,有效地解决优化问题,通过利用问题的子结构。该算法采用两两连接检测,并以依赖结构矩阵(DSM)的形式存储信息。一个新的联动模型,称为增量联动集,然后构造使用DSM。受最优混合思想的启发,提出了约束混合和返混混合。前者的目的是在一定的约束条件下进行有效的勘探。后者旨在通过细化DSM以减少不必要的评估来进行开发。实验结果表明,DSMGA-II优于LT-GOMEA和hBOA的级联/折叠/循环陷阱问题,NK景观问题与各种程度的重叠,二维伊辛自旋玻璃问题,和MAX-SAT的功能评价的数量。并与P3进行了性能比较。
英文摘要:
This paper proposes a new evolutionary algorithm, called DSMGA-II, to efficiently solve optimization problems via exploiting problem substructures. The proposed algorithm adopts pairwise linkage detection and stores the information in the form of dependency structure matrix (DSM). A new linkage model, called the incremental linkage set, is then constructed by using the DSM. Inspired by the idea of optimal mixing, the restricted mixing and the back mixing are proposed. The former aims at efficient exploration under certain constrains. The latter aims at exploitation by refining the DSM so as to reduce unnecessary evaluations. Experimental results show that DSMGA-II outperforms LT-GOMEA and hBOA in terms of number of function evaluations on the concatenated/folded/cyclic trap problems, NK-landscape problems with various degrees of overlapping, 2D Ising spin-glass problems, and MAX-SAT. The investigation of performance comparison with P3 is also included.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。