返回
A Clustering-Based Adaptive Evolutionary Algorithm for Multiobjective Optimization With Irregular Pareto Fronts
DOI:10.1109/TCYB.2018.2834466.png)
摘要
En 中文
Existing multiobjective evolutionary algorithms (MOEAs) perform well on multiobjective optimization problems (MOPs) with regular Pareto fronts in which the Pareto optimal solutions distribute continuously over the objective space. When the Pareto front is discontinuous or degenerated, most existing algorithms cannot achieve good results. To remedy this issue, a clustering-based adaptive MOEA (CA-MOEA) is proposed in this paper for solving MOPs with irregular Pareto fronts. The main idea is to adaptively generate a set of cluster centers for guiding selection at each generation to maintain diversity and accelerate convergence. We investigate the performance of CA-MOEA on 18 widely used benchmark problems. Our results demonstrate the competitiveness of CA-MOEA for multiobjective optimization, especially for problems with irregular Pareto fronts. In addition, CA-MOEA is shown to perform well on the optimization of the stretching parameters in the carbon fiber formation process.
Keyword:
Carbon fiber
evolutionary multiobjective optimization
hierarchical clustering
irregular Pareto front
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
An Improved Multiobjective Optimization Evolutionary Algorithm Based on Decomposition for Complex Pareto Fronts一种改进的基于复杂帕累托前沿分解的多目标优化进化算法
Refining Estimates of Bird Collision and Electrocution Mortality at Power Lines in the United States
PLoS ONE
IF0

