.png){kind=icon}
返回
A decomposition based multiobjective evolutionary algorithm with self-adaptive mating restriction strategy
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-018-00919-w.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
MOEA/D decomposes the multiobjective optimization problem into a number of subproblems. However, one subproblem's requirement for exploitation and exploration varies with the evolutionary process. Furthermore, different subproblems' requirements for exploitation and exploration are also different as the subproblems have been solved in distinct degree. This paper proposes a decomposition based multiobjective evolutionary algorithm with self-adaptive mating restriction strategy (MOEA/D-MRS). Considering the distinct solved degree of the subproblems, each subproblem has a separate mating restriction probability to control the contributions of exploitation and exploration. Besides, the mating restriction probability is updated by the survival length at each generation to adapt to the changing requirements. The experimental results validate that MOEA/D-MRS performs well on two test suites.
Keyword:
Multiobjective optimization
Evolutionary algorithm
MOEA/D
Self-adaptive mating restriction
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.7
论文数:
3.2K
被引数:
5.6K
机构
引用论文
.png){kind=icon}
An Improved Multiobjective Optimization Evolutionary Algorithm Based on Decomposition for Complex Pareto Fronts一种改进的基于复杂帕累托前沿分解的多目标优化进化算法
OAAI
OAAI分享收藏Enhanced Multiobjective Evolutionary Algorithm Based on Decomposition for Solving the Unit Commitment Problem基于分解的改进多目标进化算法求解机组组合问题OAAI
OAAI分享收藏Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏分享收藏
查看更多内容