.png){kind=icon}
.png){kind=icon}
Return
A two-stage evolutionary strategy based MOEA/D to multi-objective problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2021.115654.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The balance of convergence and diversity plays a significant role to the performance of multi-objective evolutionary algorithms (MOEAs). The MOEA/D is a very popular multi-objective optimization algorithm and has been used to solve various real world problems. Like many other algorithms, the MOEA/D also has insufficient ability of convergence and diversity when tackling certain complex multi-objective optimization problems (MOPs). In this paper, a novel algorithm named MOEA/D-TS is proposed for effectively solving MOPs. The new algorithm adopts two stages evolution strategies, the first stage is focused on pushing the solutions into the area of the Pareto front and speeding up its convergence ability, after that, the second stage conducts in the operating solution's diversity and makes the solutions distributed uniformly. The performance of MOEA/D-TS is validated in the ZDT, DTLZ and IMOP problems. Compared with others popular and variants algorithms, the experimental results demonstrate that the proposed algorithm has advantage over other algorithms with regard to the convergence and diversity in most of the tested problems.
Keywords:
Multi-objective optimization
Evolutionary algorithm
MOEA
D
Two-stage evolution
Pareto solution
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W