2021
DOI: 10.1007/s00500-021-06077-6
|View full text |Cite
|
Sign up to set email alerts
|

A new mutation operator for differential evolution algorithm

Abstract: The widely employed mutation operator DE/current − to − pbest/1 in the differential evolution algorithm (DE) is further developed to a new version DE/current −to− pbest/1− X in this paper. To test its performance, it has been embedded in the novel successful history-based adaptive DE (L-SHADE) and compared with other recently proposed mutation operators. In DE/current − to − pbest/1 − X , the updated parameter memories in each generation are not adopted when the initial value can still maintain an acceptable s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 26 publications
0
4
0
Order By: Relevance
“…Among many paradigms of evolutionary algorithms, the differential evolution algorithm is very typical and widely used. In addition to the original guidance strategy, numerous enhanced guidance strategies have been proposed for the differential evolution algorithms, like the DE/current-to-pbest/1-X [55] . Existing differential guidance strategies can be divided into the following three categories: i) DE/best/1 and DE/best/2; ii) DE/rand/1 and DE/rand/2; and iii) DE/current-to-pbest/1.…”
Section: 𝜑 =mentioning
confidence: 99%
“…Among many paradigms of evolutionary algorithms, the differential evolution algorithm is very typical and widely used. In addition to the original guidance strategy, numerous enhanced guidance strategies have been proposed for the differential evolution algorithms, like the DE/current-to-pbest/1-X [55] . Existing differential guidance strategies can be divided into the following three categories: i) DE/best/1 and DE/best/2; ii) DE/rand/1 and DE/rand/2; and iii) DE/current-to-pbest/1.…”
Section: 𝜑 =mentioning
confidence: 99%
“…We have used three algorithms from this family of methods, as several L-SHADEbased variants won various IEEE Competitions or achieved very good performances in comparison studies [94]. The efficient L-SHADE algorithms, include the three variants applied in this study, as well as SPS-L-SHADE-EIG that uses rotation invariant mechanism [107], L-SHADE-cnEpSin [108] that uses ensemble of sinusoidal approaches in parameter adaptation, L-SHADE-X [109] that introduces dimensionalitydependent spread parameter in distribution from which scaling factor is generated and an archive with offsprings that did not reach the main population despite having good performance, or OLSHADE-CS [110] that uses novel initialization and conservative selection mechanisms. In our opinion large successes of L-SHADE-based algorithms justify testing various their variants on different practical applications, as in [111]- [113].…”
Section: A Chosen Optimization Algorithmsmentioning
confidence: 99%
“…To adjust the search direction, the multiple-operator method is a candidate. In this method, use of different reproduction operators leads to the generation of diverse types of solutions, aiding in adjusting the search direction of the population [3,[6][7][8]. However, the selection of reproduction operators also usually relies on subjective human experience, making it tough to determine the timing and scope of their application.…”
Section: Introductionmentioning
confidence: 99%