An improvement decomposition-based multi-objective evolutionary algorithm using multi-search strategy

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 decompositi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Knowledge-based systems Ročník 163; s. 572 - 580
Hlavní autoři: Dong, Ning, Dai, Cai
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.01.2019
Elsevier Science Ltd
Témata:
Algorithms
Convergence
Crossovers
Decomposition
Evolutionary algorithms
Experiments
Exploitation
Genetic algorithms
Global local relationship
Multi-objective optimization
Multi-search strategy
Multiple objective analysis
Objectives
Operators
Optimization
Search methods
Search strategies
State of the art
Strategies
Strategy
Multi-search strategy
Multi-objective optimization
Decomposition
ISSN:0950-7051, 1872-7409
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0950-7051
1872-7409
DOI:10.1016/j.knosys.2018.09.018