.png){kind=icon}
返回
Adaptively weighted decomposition based multi-objective evolutionary algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-020-01969-w.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multi-objective evolutionary algorithm based on Decomposition (MOEA/D) decomposes a multi-objective problem into a number of scalar optimization problems using uniformly distributed weight vectors. However, uniformly distributed weight vectors do not guarantee uniformity of solutions on approximated Pareto-Front. This study proposes an adaptive strategy to modify these scalarizing weights after regular intervals by assessing the crowdedness of solutions using crowding distance operator. Experiments carried out over several benchmark problems with complex Pareto-Fronts show that such a strategy helps in improving the convergence and diversity of solutions on approximated Pareto-Front. Proposed algorithm also shows better performance when compared with other state-of-the-art multi-objective algorithms over most of the benchmark problems.
Keyword:
Multi-objective evolutionary algorithms
MOEA
D algorithm
Inverted generational distance
Crowding distance
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
Polarized accumulations of endoplasmic reticulum and other ultrastructural features of leptoids inPolytrichadelphus magellanicus gametophytes.png)
Protoplasma
ProtoplasmaIF0
PREAI
分享收藏An Improved Multiobjective Optimization Evolutionary Algorithm Based on Decomposition for Complex Pareto Fronts一种改进的基于复杂帕累托前沿分解的多目标优化进化算法
OAAI
OAAI分享收藏Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏
分享收藏
查看更多内容