.png){kind=icon}
Return
A many-objective optimization algorithm using a two-space interactive evolutionary framework
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2022.101185.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The challenge of many-objective optimization evolutionary algorithms with weight vectors is to generate a set of weight vectors that can adapt well to the distribution of the evolving population. In this paper, a many-objective optimization algorithm using a two-space interactive evolutionary framework, called MaO-TIEF, is proposed. In MaO-TIEF, the population space and weight space evolve simultaneously by interacting mutually to achieve the balance of convergence and population diversity in the algorithm. To utilize the useful information in the searching history of individuals, a modified decomposition-based evolutionary algorithm is introduced to update the population space. Moreover, inspired by Steffensen's method, a local search strategy is adopted to enhance the searching ability of MaO-TIEF. In the experimental section, the proposed algorithm and 5 commonly-used MaOEAs have been tested on 27 test problems with different numbers of objectives and the statistical results demonstrate the effectiveness of MaO-TIEF.
Keywords:
Many-objective optimization
Decomposition
Weight space
Local search
Steffensen?s method
Journal
IF:
8.5
Papers:
2.2K
Citations:
1.0W
Organization
Cited Papers
.png){kind=icon}
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach
PREAI
ShareSaveShareSave
ShareSaveShareSaveShareSaveShareSave
View more