Adaptively Allocating Search Effort in Challenging Many-Objective Optimization Problems
Adaptively Allocating Search Effort in Challenging Many-Objective Optimization Problems
复制标题
自适应分配搜索工作量以应对多目标优化问题
DOI:
10.1109/tevc.2017.2725902
复制
发表时间:
2018-06
期刊:
影响因子:
--
通讯作者:
Kdeb
中科院分区:
文献类型:
--
作者:
Hai-Lin Liu;Lei Chen;Qingfu Zhang;Kdeb
An effective allocation of search effort is important in multiobjective optimization, particularly in many-objective optimization problems (MaOPs). This paper presents a new adaptive search effort allocation strategy for multiobjective evolutionary algorithm based on decomposition MOEA/D-M2M, a recent MOEA/D algorithm for challenging MaOPs. This proposed method adaptively adjusts the subregions of its subproblems by detecting the importance of different objectives in an adaptive manner. More specifically, it periodically resets the subregion setting based on the distribution of the current solutions in the objective space such that the search effort is not wasted on unpromising regions. The basic idea is that the current population can be regarded as an approximation to the Pareto front (PF) and thus one can implicitly estimate the shape of the PF and such estimation can be used for adjusting the search focus. The performance of proposed algorithm has been verified by comparing it with eight representative and competitive algorithms on a set of degenerated MaOPs with disconnected and connected PFs. Performances of the proposed algorithm on a number of nondegenerated test instances with connected and disconnected PFs are also studied.
登录
查看更多内容
影响因子:
14.3
作者:
Wang, Handing;Jiao, Licheng;Yao, Xin
通讯作者:
Yao, Xin
DOI:
10.1007/11844297_54
发表时间:
2006-09
期刊:
--
影响因子:
--
作者:
D. Brockhoff;E. Zitzler
通讯作者:
D. Brockhoff;E. Zitzler
影响因子:
14.3
作者:
Jain, Himanshu;Deb, Kalyanmoy
通讯作者:
Deb, Kalyanmoy
影响因子:
14.3
作者:
D. Saxena;João A. Duro;A. Tiwari;K. Deb;Qingfu Zhang
通讯作者:
D. Saxena;João A. Duro;A. Tiwari;K. Deb;Qingfu Zhang
影响因子:
8.8
作者:
D. Saxena;K. Deb
通讯作者:
D. Saxena;K. Deb