.png){kind=icon}
返回
MOEA/D: A multiobjective evolutionary algorithm based on decomposition
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2007.892759.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Decomposition is a basic strategy in traditional multiobjective optimization. However, it has not yet been widely used in multiobjective evolutionary optimization. This paper proposes a multiobjective evolutionary algorithm based on decomposition (MOEA/D). It decomposes a multiobjective optimization problem into a number of scalar optimization subproblems and optimizes them simultaneously. Each subproblem is optimized by only using information from its several neighboring subproblems, which makes MOEA/D have lower computational complexity at each generation than MOGLS and nondominated sorting genetic algorithm H (NSGA-II). Experimental results have demonstrated that MOEA/D with simple decomposition methods outperforms or performs similarly to MOGLS and NSGA-II on multiobjective 0-1 knapsack problems and continuous multiobjective optimization problems. It has been shown that MOEA/D using objective normalization can deal with disparately-scaled objectives, and MOEA/D with an advanced decomposition method can generate a set of very evenly distributed solutions for 3-objective test instances. The ability of MOEA/D with small population, the scalability and sensitivity of MOEA/D have also been experimentally investigated in this paper.
Keyword:
computational complexity
decomposition
evolutionary algorithm
multiobjective optimization
Pareto optimality
期刊
IF:
12
论文数:
1.8K
被引数:
2.4W
机构
暂无机构信息
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏
分享收藏
Influence of biochar on soil physical and chemical properties and crop yields in rainfed field.png)
IF0
PREAI
分享收藏
查看更多内容