A novel two-phase evolutionary algorithm for solving constrained multi-objective optimization problems

A novel two-phase evolutionary algorithm for solving constrained multi-objective optimization problems
复制标题

一种求解约束多目标优化问题的新型两阶段进化算法

DOI:
10.1016/j.swevo.2022.101166
复制
发表时间:
2022-08
影响因子:
10
通讯作者:
杨圣祥
杨圣祥
中科院分区:
计算机科学1区
文献类型:
--
作者:
王艳萍;刘元;邹娟;郑金华;杨圣祥

文献摘要

参考文献

相似文献

由于复杂的约束条件会将可行域分散到整个搜索区域的许多不同的小部分,因此在约束多目标优化问题(CMOP)中如何平衡收敛和多样性是一个挑战。虽然已经有一些关于CMOP的研究,但现有的进化算法仍然不能使进化种群收敛到一个多样化的可行Pareto最优前沿。为了解决这一问题,我们提出了一种新的求解CMOP问题的两阶段进化算法DTAEA。DTAEA将种群的共同进化过程分为两个阶段。在第一阶段,将双种群弱协同进化与互补环境选择策略相结合,改进了算法在约束条件下的搜索能力,使进化种群快速遍历不可行域,搜索所有可行域。当可行解在种群中的比例达到一定阈值或可行解的收敛达到一定程度时,种群的进化过程进入第二阶段,即渐进阶段。在第二阶段,一种面向可行性的方法引导单个种群在第一阶段探索的可行域中广泛分布。对比实验表明,DTAEA算法在CMOP基准测试中比其他算法更具竞争力。
It is challenging to balance convergence and diversity in constrained multi-objective optimization problems (CMOPs) since the complex constraints will disperse the feasible regions into many diverse, small parts of the entire search region. Although there has been some research on CMOPs, existing evolutionary algorithms still cannot cause the evolutionary population to converge a diversified feasible Pareto-optimal front. In order to solve this problem, we propose a novel two-phase evolutionary algorithm for solving CMOPs, named DTAEA. DTAEA divides the population’s coevolutionary process into two phases. In the first phase, the dual population weak coevolution is combined with the complementary environmental selection strategy to improve the algorithm’s exploration under constraints, which makes the evolutionary population quickly traverse the infeasible regions and search for all of the feasible regions. When the proportion of feasible solutions in the population reaches a certain threshold or the convergence of feasible solutions reaches a certain level, the population’s evolutionary process enters the second phase, that is, the progressive phase. In the second phase, a feasibility-oriented method guides a single population to distribute itself widely in the feasible regions explored in the first phase. Comparative experiments show that the DTAEA is more competitive than other algorithms on CMOP benchmarks.
DOI: 10.1109/tevc.2013.2281534
发表时间: 2014-08-01
影响因子: 14.3
作者:
Jain, Himanshu;Deb, Kalyanmoy
通讯作者: Deb, Kalyanmoy
DOI: 10.1504/ijbic.2019.098406
发表时间: 2019-03
影响因子: 3.5
作者:
Zeng Sanyou;Jiao Ruwang;Li Changhe;Wang Rui
通讯作者: Wang Rui
DOI: 10.1109/tsmc.2021.3061698
发表时间: 2021-03
期刊: IEEE transactions on systems, man, and cybernetics
影响因子: --
作者:
Kunjie Yu;Jing Liang;Boyang Qu;Yong Luo;Caitong Yue
通讯作者: Caitong Yue
DOI: 10.1109/tevc.2021.3131124
发表时间: 2021
影响因子: 14.3
作者:
Mengjun Ming;Rui Wang;Hisao Ishibuchi;Tao Zhang
通讯作者: Tao Zhang
DOI: 10.1109/tevc.2021.3055538
发表时间: 2021-06
影响因子: 14.3
作者:
Zhaopin Su;Guofu Zhang;Feng Yue;Dezhi Zhan;Miqing Li;Bin Li;X. Yao
通讯作者: Zhaopin Su;Guofu Zhang;Feng Yue;Dezhi Zhan;Miqing Li;Bin Li;X. Yao