DLEA: A dynamic learning evolution algorithm for many-objective optimization

For many-objective problems, how to maintain the diversity and convergence of the distribution of the solution set over Pareto front (PF) has always been the research emphasis. In the iteration process, the state of population is critical to improve the level of evolution. Therefore, this paper will...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Information sciences Ročník 574; s. 567 - 589
Hlavní autori: Li, Gui, Wang, Gai-Ge, Dong, Junyu, Yeh, Wei-Chang, Li, Keqin
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Inc 01.10.2021
Predmet:
Dynamic learning strategy
Evolutionary algorithms (EAs)
Many-objective optimization
Performance indicators
Evolutionary algorithms (EAs)
Many-objective optimization
Performance indicators
Dynamic learning strategy
ISSN:0020-0255, 1872-6291
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:For many-objective problems, how to maintain the diversity and convergence of the distribution of the solution set over Pareto front (PF) has always been the research emphasis. In the iteration process, the state of population is critical to improve the level of evolution. Therefore, this paper will use two convergence and diversity indicators to further strengthen the usage of evolutionary state information and propose a dynamic learning strategy. In addition, a dynamic learning strategy based many-objective evolutionary algorithm (MaOEA) is proposed, called dynamic learning evolution algorithm (DLEA), which continuously changes the direction of learning: convergence and diversity in the iteration process. The purpose is to make the algorithm prefer to convergence in the early iteration and prefer to diversity when it is close to PF in the late iteration, so that the convergence and diversity of the final solution set can be well maintained. And then, the performance of DLEA is measured by two indicators. Meanwhile, DLEA will be compared with four state-of-the-art algorithms on the DTLZ and MaF, and its performance will be verified on a many-objective combinatorial problem. And the experimental results and Friedman test show that DLEA has great advantages.
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2021.05.064