.png){kind=icon}
返回
Evolutionary Many-Objective Optimization Based on Dynamical Decomposition
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2018.2865590.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Decomposition-based many-objective evolutionary algorithms generally decompose the objective space into multiple subregions with the help of a set of reference vectors. The resulting subregions are fixed since the reference vectors are usually predefined. When the optimization problem has a complicated Pareto front (PF), this decomposition may decrease the algorithm performance. To deal with this problem, this paper proposes a dynamical decomposition strategy. Instead of using predefined reference vectors, solution themselves are used as reference vectors. Thus, they are adapted to the shape of PF automatically. Besides, the subregions are produced one by one through successively bipartitioning the objective space. The resulting subregions are not fixed but dynamically determined by the population solutions as well as the subregions produced previously. Based on this strategy, a solution ranking method, named dynamical-decomposition-based ranking method (DDR), is proposed which can be employed in the mating selection and environmental selection in commonly used algorithm frameworks. Compared with those in the other decomposition-based algorithms, DDR has the following properties: 1) no predefined reference vectors arc required; 2) less parameters are involved; and 3) the ranking results can not only be utilized directly to select solutions but also serve as a secondary criterion in traditional Pareto-based algorithms. In this paper, DDR is equipped in two algorithm frameworks for handling many-objective optimization problems. Comparisons with five state-of-the-art algorithms on 31 widely used test problems are carried out to test the performance of the proposed approach. The experimental results have shown the effectiveness of the proposed approach in keeping a good tradeoff between convergence and diversity.
Keyword:
Dynamical decomposition
evolutionary algorithm
many-objective optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.8K
被引数:
2.4W
机构
引用论文
An Improved Multiobjective Optimization Evolutionary Algorithm Based on Decomposition for Complex Pareto Fronts一种改进的基于复杂帕累托前沿分解的多目标优化进化算法
OAAI
OAAI分享收藏Refining Estimates of Bird Collision and Electrocution Mortality at Power Lines in the United States.png)
PLoS ONEOAAI
PLoS ONEIF0
OAAI分享收藏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
分享收藏分享收藏
查看更多内容