2016
DOI: 10.1109/tcyb.2015.2403849
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive Replacement Strategies for MOEA/D

Abstract: Multiobjective evolutionary algorithms based on decomposition (MOEA/D) decompose a multiobjective optimization problem into a set of simple optimization subproblems and solve them in a collaborative manner. A replacement scheme, which assigns a new solution to a subproblem, plays a key role in balancing diversity and convergence in MOEA/D. This paper proposes a global replacement scheme which assigns a new solution to its most suitable subproblems. We demonstrate that the replacement neighborhood size is criti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
97
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 228 publications
(97 citation statements)
references
References 35 publications
0
97
0
Order By: Relevance
“…In MOEA/D, a multi-objective optimization problem (MOP) is transformed into a set of single optimization sub-problems by applying decomposition approaches, and then evolutionary algorithms are utilized to optimize these sub-problems simultaneously. With the use of different decomposition methods and different evolutionary algorithms, various versions of MOEA/D have been developed in recent years, e.g., MOEA/D-DE [22], MOEA/D-DRA [31], MOEA/D-XBS [21], and MOEA/D-GR [23]. Although different variants of MOEA/D are available in literature, a powerful single version of MOEA/D that integrates different advantages of the current versions is not yet in place.…”
Section: Moea/d Algorithmmentioning
confidence: 99%
See 3 more Smart Citations
“…In MOEA/D, a multi-objective optimization problem (MOP) is transformed into a set of single optimization sub-problems by applying decomposition approaches, and then evolutionary algorithms are utilized to optimize these sub-problems simultaneously. With the use of different decomposition methods and different evolutionary algorithms, various versions of MOEA/D have been developed in recent years, e.g., MOEA/D-DE [22], MOEA/D-DRA [31], MOEA/D-XBS [21], and MOEA/D-GR [23]. Although different variants of MOEA/D are available in literature, a powerful single version of MOEA/D that integrates different advantages of the current versions is not yet in place.…”
Section: Moea/d Algorithmmentioning
confidence: 99%
“…Although different variants of MOEA/D are available in literature, a powerful single version of MOEA/D that integrates different advantages of the current versions is not yet in place. With the aim of developing an efficient version of MOEA/D for real-life problems, a powerful MOEA/D version is therefore developed in this study that is a combination of MOEA/D-DE [22], an adaptive replacement strategy [23], a stopping condition criterion [24], and a constraint-handling technique [25]. The general framework of MOEA/D is presented in Algorithm 1.…”
Section: Moea/d Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…To validate the effectiveness and robustness of LSIAS, 22 well-known benchmark problems such as ZDT problems [28], DTLZ problems [29], and UF problems [30] are adopted. The comparative experiments are demonstrated when the MOEA/D-LSIAS compares with some versions of MOEA/D, for example, MOEA/D-DE [31], MOEA/D-DRA [27], MOEA/D-FRRMAB [16], MOEA/D-STM [32], MOEA/ D-UCB-T [21], and MOEA/D-AGR [33].…”
Section: Introductionmentioning
confidence: 99%