.png){kind=icon}
返回
A Clustering-Based Evolutionary Algorithm for Many-Objective Optimization Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2018.2866927.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper suggests a novel clustering-based evolutionary algorithm for many-objective optimization problems. Its main idea is to classify the population into a number of clusters, which is expected to solve the difficulty of balancing convergence and diversity in high-dimensional objective space. The individuals showing high similarities on the vector angles are gathered into the same cluster, such that the population's distribution can be well portrayed by the clusters. To efficiently find these clusters, partitional clustering is first used to classify the union population into in main clusters based on the m axis vectors (m is the number of objectives), and then hierarchical clustering is further run on these in main clusters to get N final clusters (N is the population size and N > m). At last, in environmental selection, one individual from each of N clusters closest to the axis vectors is selected to maintain diversity, while one individual from each of the other clusters is preferred by a simple convergence indicator to ensure convergence. When tackling some well-known test problems with 5-15 objectives, extensive experiments validate the superiority of our algorithm over six competitive many-objective EAs, especially on problems with incomplete and irregular Pareto-optimal fronts.
Keyword:
Evolutionary algorithm (EA)
hierarchical clustering
many-objective optimization
partitional clustering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.8K
被引数:
2.4W
机构
引用论文
Refining Estimates of Bird Collision and Electrocution Mortality at Power Lines in the United States.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏
查看更多内容