.png){kind=icon}
.png){kind=icon}
Return
A many-objective algorithm based on staged coordination selection
.png){kind=icon}
OA
AI
DOI：10.1016/j.swevo.2020.100737.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Convergence and diversity are two performance requirements that should be paid attention to in evolutionary algorithms. Most multiobjective evolutionary algorithms (MOEAs) try their best to maintain a balance between the two aspects, which poses a challenge to the convergence ofMOEAs in the early evolutionary process. In this paper, a many-objective optimization algorithm based on staged coordination selection, which consists of the convergence and diversity stages, is proposed in which the two stages are considered separately in each iteration. In the convergence exploring stage, the decomposition method is adopted to rapidly make the population close to the true PF. In the diversity exploring stage, a diversity maintenance mechanism same to the archive truncation method of SPEA2 is used to push distributed individuals to the true PF. The convergence stage serves for the diversity stage, and the second stage turns into the first stage when it fails to reach the convergence requirement and so forth. Our algorithm is compared with eight state-of-the-art many-objective optimization algorithms on DTLZ, WFG and MaOP benchmark instances. Results show that our algorithm outperformed the comparison algorithms for most test problems.
Keywords:
Many-objective optimization
Evolutionary algorithm
Pareto optimality
Coordination selection
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.1K
Citations:
1.0W