.png){kind=icon}
返回
A random dynamic grouping based weight optimization framework for large-scale multi-objective optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2020.100684.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
For large-scale multi-objective problems (LSMOPs), it is necessary to get a good grouping strategy or another way to reduce dimensions because of the curse of dimensions. In this paper, a weighted optimization framework with random dynamic grouping is proposed for large-scale problems. A weight optimization framework utilizes a problem transformation scheme in which weights are chosen to be optimized instead of the decision variables in order to reduce the dimensionality of the search space. Random dynamic grouping is used to determine sizes of each group adaptively. And multi-objective particle swarm optimization with multiple search strategies (MMOPSO) is employed as an optimizer for both original variables and weight variables. The proposed algorithm is performed on 28 benchmark test problems with 1000 dimensions, and the experimental results show that it can get better performance than some the-state-of-art algorithms in fewer function evaluations. In addition, it can be extended to solve LSMOPs with 5000 dimensions.
Keyword:
Large-scale multi-objective problem
Weighted optimization framework
Random dynamic grouping
MMOPSO
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
分享收藏
分享收藏分享收藏Transcranial direct current stimulation on prefrontal and parietal areas enhances motor imagery.png)
NeuroReport
NeuroReportIF0
PREAI
分享收藏
查看更多内容