.png){kind=icon}
Return
A steady-state weight adaptation method for decomposition-based evolutionary multi-objective optimisation
.png){kind=icon}
OA
AI
DOI：10.1016/j.swevo.2024.101641.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In decomposition-based multi-objective evolutionary algorithms (MOEAs), the inconsistency between a problem's Pareto front shape and the distribution of the weights can lead to a poor, unevenly distributed solution set. A straightforward way to overcome this undesirable issue is to adapt the weights during the evolutionary process. However, existing methods, which typically adapt many weights at a time, may hinder the convergence of the population since changing weights essentially means changing sub-problems to be optimised. In this paper, we aim to tackle this issue by designing a steady-state weight adaptation (SSWA) method. SSWA employs a stable approach to maintain/update an archive (which stores high-quality solutions during the search). Based on the archive, at each generation, SSWA selects one solution from it to generate only one new weight while simultaneously removing an existing weight. We compare SSWA with eight state-of-the-art weight adaptative decomposition-based MOEAs and show its general outperformance on problems with various Pareto front shapes.
Keywords:
Multi-objective optimisation
Evolutionary algorithms
Decomposition-based multi-objective
Weight adaptation
Convergence
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.5
Papers:
2.2K
Citations:
1.0W
Organization
Cited Papers
Refining Estimates of Bird Collision and Electrocution Mortality at Power Lines in the United States.png)
PLoS ONEOAAI
PLoS ONEIF0
OAAIShareSaveShareSaveShareSaveMultiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach
PREAI
ShareSave
View more