.png){kind=icon}
Return
A historical solutions based evolution operator for decomposition-based many-objective optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2018.02.008.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
As a kind of iterative algorithm based on population, an evolutionary algorithm generates many solutions at each generation. The historical solutions can provide information about the former generations and in turn help to guide the evolving of population. Thus, this paper utilizes the historical solutions and proposes a new evolution operator for decomposition-based many-objective optimization. The new operator combines the vertical information across different generations and the horizontal information from the current generation. Moreover, a two-stage bound-checking mechanism and an adaptive parameter setting scheme are designed to assist the proposed operator. After incorporating the proposed operator and some related techniques into the decomposition-based framework, we form a new algorithm called MOEA/D-HSE. The experimental results on well-known benchmark problems ranging from 5 to 15 objectives show that MOEA/D-HSE significantly outperforms other peer algorithms on the vast majority of the test instances, demonstrating the effectiveness and competitiveness of the proposed operator.
Keywords:
Many-objective optimization
Evolutionary algorithm
MOEA/D
Reproduction operator
Historical solutions
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
.png){kind=icon}
ShareSave
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach
PREAI
ShareSave
ShareSaveShareSaveShareSave
View more