2013 IEEE Congress on Evolutionary Computation 2013
DOI: 10.1109/cec.2013.6557763
|View full text |Cite
|
Sign up to set email alerts
|

Super-fit Multicriteria Adaptive Differential Evolution

Abstract: This paper proposes an algorithm to solve the CEC2013 benchmark. The algorithm, namely Super-fit Multicriteria Adaptive Differential Evolution (SMADE), is a Memetic Computing approach based on the hybridization of two algorithmic schemes according to a super-fit memetic logic. More specifically, the Covariance Matrix Adaptive Evolution Strategy (CMAES), run at the beginning of the optimization process, is used to generate a solution with a high quality. This solution is then injected into the population of a m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 37 publications
(23 citation statements)
references
References 29 publications
0
23
0
Order By: Relevance
“…It is clear from the three tables that the proposed SinDE is much more powerful than both other approaches. In fact, it significantly outperforms the calssical DE in 75 cases out of 84 and the LADE in 55 In addition to its comparison to the classical variants, the proposed SinDE is compared against stronger recent variants of the DE algorithm, namely: The Super-fit Multicriteria Adaptive Differential Evolution (SMADE) [30], the Differential Evolution with Concurrent Fitness Based Local Search (DEcfbLS) [31], a powerful variant of the competitive differential Evolution [32] called b6e6rl [33] and the Teaching and Learning Based Self-adaptive DE (TLBSade) [34].…”
Section: Numerical Resultsmentioning
confidence: 98%
“…It is clear from the three tables that the proposed SinDE is much more powerful than both other approaches. In fact, it significantly outperforms the calssical DE in 75 cases out of 84 and the LADE in 55 In addition to its comparison to the classical variants, the proposed SinDE is compared against stronger recent variants of the DE algorithm, namely: The Super-fit Multicriteria Adaptive Differential Evolution (SMADE) [30], the Differential Evolution with Concurrent Fitness Based Local Search (DEcfbLS) [31], a powerful variant of the competitive differential Evolution [32] called b6e6rl [33] and the Teaching and Learning Based Self-adaptive DE (TLBSade) [34].…”
Section: Numerical Resultsmentioning
confidence: 98%
“…Corresponding results of the four comparison algorithms come from Caraffini et al (2013), and they are listed in the three tables too. The best results of the five algorithms are shown in bold.…”
Section: Experimental Results and Analysismentioning
confidence: 99%
“…Error values and standard deviations smaller than 10 −8 are taken as zero. The experimental results are compared with four state-of-the-art algorithms (SMADE, MDE-pBX, CMAES and CCPSO2) listed in Caraffini et al (2013). In this paper, the parameter settings of COOA are listed in Table 2.…”
Section: The Effectiveness Test and Analysis Of Cooamentioning
confidence: 99%
“…Zhao et al [29] modified 3 EPSDE by incorporating an SaDE type learning scheme. SMADE, proposed in [30], makes use of a multiple mutation strategy consisting of four different mutation operators and selects one operator via a roulette-wheel selection scheme for each target individual in current generation. Researchers in [31] proposed a variant of jDE, i.e., jDEsoo (jDE for single objective optimization), which concurrently applies three different DE strategies in three sub-populations.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Therefore, the single-mutation operator strategies with composite searching features (such as BDE [18], DEGL [19], JADE [20], ProDE [21], BoRDE [22], and TDE [23]) and the multi-mutation operators strategies with different searching features (such as SaDE [24], [25], TLBSaDE [26], CoDE [27], EPSDE [28], [29], SMADE [30], jDEsoo [31], and SPSRDEMMS [32]) were proposed. Epitropakis et al [18] linearly combined an explorative and an exploitive mutation operator to form a hybrid approach (BDE) with an attempt to balance these two operators.…”
Section: Literature Reviewmentioning
confidence: 99%