Adaptive Strategies Based on Differential Evolutionary Algorithm for Many-Objective Optimization

The decomposition-based algorithm, for example, multiobjective evolutionary algorithm based on decomposition (MOEA/D), has been proved effective and useful in a variety of multiobjective optimization problems (MOPs). On the basis of MOEA/D, the MOEA/D-DE replaces the simulated binary crossover (SBX)...

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux: Yifei Sun, Kun Bian, Zhuo Liu, Xin Sun, Ruoxia Yao
Format: article
Langue:EN
Publié: Hindawi Limited 2021
Sujets:
Accès en ligne:https://doaj.org/article/f14ad4450c044c63a132e65bd86bfae7
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
Description
Résumé:The decomposition-based algorithm, for example, multiobjective evolutionary algorithm based on decomposition (MOEA/D), has been proved effective and useful in a variety of multiobjective optimization problems (MOPs). On the basis of MOEA/D, the MOEA/D-DE replaces the simulated binary crossover (SBX) operator with differential evolution (DE) operator, which is used to enhance the diversity of the solutions more effectively. However, the amplification factor and the crossover probability are fixed in MOEA/D-DE, which would lead to a low convergence rate and be more likely to fall into local optimum. To overcome such a prematurity problem, this paper proposes three different adaptive operators in DE with crossover probability and amplification factors to adjust the parameter settings adaptively. We incorporate these three adaptive operators in MOEA/D-DE and MOEA/D-PaS to solve MOPs and many-objective optimization problems (MaOPs), respectively. This paper also designs a sensitive experiment for the changeable parameter η in the proposed adaptive operators to explore how η would affect the convergence of the proposed algorithms. These adaptive algorithms are tested on many benchmark problems, including ZDT, DTLZ, WFG, and MaF test suites. The experimental results illustrate that the three proposed adaptive algorithms have better performance on most benchmark problems.