.png){kind=icon}
返回
DCDG-EA: Dynamic convergence-diversity guided evolutionary algorithm for many-objective optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2018.09.025.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Maintaining a good balance between the convergence and the diversity is particularly crucial for the performance of the evolutionary algorithms (EAs). However, the traditional multi-objective evolutionary algorithms, which have shown their competitive performance with a variety of practical problems involving two or three objectives, face significant challenges in case of problems with more than three objectives, namely many-objective optimization problems (MaOPs). This paper proposes a dynamic convergence diversity guided evolutionary algorithm, namely (DCDG-EA) for MaOPs by employing the decomposition technique. Besides, the objective space of MaOPs is divided into K subspaces by a set of uniformly distributed reference vectors. Each subspace has its own subpopulation and evolves in parallel with the other subspaces. In DCDG-EA, the balance between the convergence and the diversity is achieved through the convergence-diversity based operator selection (CDOS) strategy and convergence-diversity based individual selection (CDIS) strategy. In CDOS, for each operator of the set of operators, a selection probability is assigned which is related to its convergence and diversity capabilities. Based on the attributed selection probabilities, an appropriate operator is selected to generate the offsprings. Furthermore, CDIS is used which allows to greatly overcome the inefficiency of the Pareto dominance approaches. It updates each subpopulation by using two independent distance measures that represent the convergence and the control diversity, respectively. The experimental results on DTLZ and WFG benchmark problems with up to 15 objectives show that our algorithm is highly competitive comparing with the four state-of-the-art evolutionary algorithms in terms of convergence and diversity. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Many-objective optimization
Convergence
Diversity
Decomposition
Evolutionary algorithm
Pareto optimality
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective OptimizationPlatEMO: 用于进化多目标优化的MATLAB平台
OAAI
OAAI分享收藏Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏分享收藏分享收藏
查看更多内容