.png){kind=icon}
返回
Constrained Subproblems in a Decomposition-Based Multiobjective Evolutionary Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2015.2457616.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A decomposition approach decomposes a multiobjective optimization problem into a number of scalar objective optimization subproblems. It plays a key role in decomposition-based multiobjective evolutionary algorithms. However, many widely used decomposition approaches, originally proposed for mathematical programming algorithms, may not be very suitable for evolutionary algorithms. To help decomposition-based multiobjective evolutionary algorithms balance the population diversity and convergence in an appropriate manner, this letter proposes to impose some constraints on the subproblems. Experiments have been conducted to demonstrate that our proposed constrained decomposition approach works well on most test instances. We further propose a strategy for adaptively adjusting constraints by using information collected from the search. Experimental results show that it can significantly improve the algorithm performance.
Keyword:
Constraint
decomposition approach
evolutionary multiobjective optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.9K
被引数:
2.5W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容