.png){kind=icon}
.png){kind=icon}
Return
A Clustering-Based Adaptive Evolutionary Algorithm for Multiobjective Optimization With Irregular Pareto Fronts
.png){kind=icon}
PRE
AI
DOI：10.1109/TCYB.2018.2834466.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Carbon fiber
evolutionary multiobjective optimization
hierarchical clustering
irregular Pareto front
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W