.png){kind=icon}
.png){kind=icon}
Return
An improvement decomposition-based multi-objective evolutionary algorithm using multi-search strategy
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2018.09.018.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The main goal of multi-objective optimization evolutionary algorithms (MOEAs) is to obtain a set of solutions with good diversity and convergence. However, how to concurrently improve the diversity and convergence is a difficult work. To address this problem, an updated strategy based on decomposition is used to maintain the diversity, and the convergence is enhanced by improving the search efficiency. In this paper, an improvement decomposition-based multi-objective evolutionary algorithm using multi-search strategy is aimed at improving the search efficiency. In this work, three search strategies are used to help crossover operators to carry out the local search and global search. This multi-search strategy selects sparse non-dominated solutions to carry out the exploration, and selects convergent solutions to implement the exploitation. In the experiments, the proposed algorithm is compared with seven efficient state-of-the-art algorithms, e.g., NSGAII, MOEA/D, MOEA-DVA, MOEA-IGD-NS, MOEA/D-PaS, RVEA and MPSOD, on twenty-two benchmark functions. Empirical results show that the proposed algorithm can find a set of solutions with better diversity and convergence than six compared algorithms. (C) 2018 Elsevier B.V. All rights reserved.
Keywords:
Multi-objective optimization
Decomposition
Multi-search strategy
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W