.png){kind=icon}
返回
Adaptive Epsilon dominance in decomposition-based multiobjective evolutionary algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2018.12.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Complicated geometric shapes of Pareto fronts can cause difficulties for multiobjective evolutionary algorithms. To deal with these difficulties, efficient diversity strategies must be highly addressed in order to obtain a set of representative Pareto solutions. In decomposition-based multiobjective evolutionary algorithms, this is often done by optimizing multiple single objective subproblems defined by a set of weight vectors. For complicated Pareto fronts with extreme convexity, disconnection or degeneracy, however, it is nontrivial to set these weight vector properly. To overcome this shortcoming, we propose a new decomposition-based multiobjective evolutionary algorithm based on a hybrid weighting strategy, which optimizes both random subproblems and fixed subproblems. To maintain diversity of nondominated solutions stored in external population, a new archiving strategy based on adaptive Epsilon dominance is also suggested in our proposed algorithm. Our experimental results have showed that our proposed algorithm is superior to several other state-of-the-art multiobjective evolutionary algorithms on a set of benchmark multiobjective test problems with different challenging difficulties regarding the geometric shapes of Pareto fronts.
Keyword:
Adaptive Epsilon dominance
Evolutionary multiobjective optimization
Complicated Pareto front
Decomposition
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
.png){kind=icon}
An Improved Multiobjective Optimization Evolutionary Algorithm Based on Decomposition for Complex Pareto Fronts一种改进的基于复杂帕累托前沿分解的多目标优化进化算法
OAAI
OAAI分享收藏分享收藏分享收藏分享收藏
查看更多内容