.png){kind=icon}
返回
DMOEA-εC: Decomposition-Based Multiobjective Evolutionary Algorithm With the ε-Constraint Framework
.png){kind=icon}
OA
AI
DOI：10.1109/TEVC.2017.2671462.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Decomposition is an efficient and prevailing strategy for solving multiobjective optimization problems (MOPs). Its success has been witnessed by the multiobjective evolutionary algorithm MOEA/D and its variants. In decomposition-based methods, an MOP is decomposed into a number of scalar subproblems by using various scalarizing functions. Most decomposition schemes adopt the weighting method to construct scalarizing functions. In this paper, another classical generation method in the field of mathematical programming, that is the epsilon-constraint method, is adopted for the multiobjective optimization. It selects one of the objectives as the main objective and converts other objectives into constraints. We incorporate the epsilon-constraint method into the decomposition strategy and propose a new decomposition-based multiobjective evolutionary algorithm with the epsilon-constraint framework (DMOEA-epsilon C). It decomposes an MOP into a series of scalar constrained optimization subproblems by assigning each subproblem with an upper bound vector. These subproblems are optimized simultaneously by using information from neighboring subproblems. Besides, a main objective alternation strategy, a solution-to-subproblem matching procedure, and a subproblem-to-solution matching procedure are proposed to strike a balance between convergence and diversity. DMOEA-epsilon C is compared with a number of state-of-theart multiobjective evolutionary algorithms. Experimental studies demonstrate that DMOEA-epsilon C outperforms or performs competitively against these algorithms on the majority of 34 continuous benchmark problems, and it also shows obvious advantages in solving multiobjective 0-1 knapsack problems.
Keyword:
epsilon-constraint method
decomposition
main-objective alternation strategy
multiobjective optimization
solution-to-subproblem matching procedure
subproblem-tosolution matching procedure
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
Polarized accumulations of endoplasmic reticulum and other ultrastructural features of leptoids inPolytrichadelphus magellanicus gametophytes.png)
Protoplasma
ProtoplasmaIF0
PREAI
分享收藏Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏
分享收藏
查看更多内容