Scribd
Upload
40 views14 pages

Crossover Operation in Differential Evolution

Differential evolution (DE) is a population-based global optimization algorithm that has been successfully applied in many scientific and engineering areas. DE operates on a population containing individuals that evolves over generations through three main operations: differential mutation, crossover, and selection. Differential mutation generates a mutant vector for each individual by adding weighted vector differences to a base vector. Binomial and exponential crossover methods are commonly used in DE to combine the mutant vector with the target vector and produce a trial vector. Selection determines whether the target or trial vector survives to the next generation.

Uploaded by

purvi bajoria
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
40 views14 pages

Crossover Operation in Differential Evolution

Differential evolution (DE) is a population-based global optimization algorithm that has been successfully applied in many scientific and engineering areas. DE operates on a population containing individuals that evolves over generations through three main operations: differential mutation, crossover, and selection. Differential mutation generates a mutant vector for each individual by adding weighted vector differences to a base vector. Binomial and exponential crossover methods are commonly used in DE to combine the mutant vector with the target vector and produce a trial vector. Selection determines whether the target or trial vector survives to the next generation.

Uploaded by

purvi bajoria
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 14

Submitted to:

Mrs. Vaishali yadav Ma’am


Differential evolution (DE) is a
population-based global
optimization algorithm. Due to its
simplicity, effectiveness and
robustness, differential evolution
has been successfully applied in
many scientific and engineering
areas.
 A differential evolution algorithm is marked as
DE/x/y/z,
 where x denote show the differential mutation base is
chosen,
 y denotes the number of vector differences added to
the base vector
 and z indicates the crossover method.
 There are two crossover variants widely used in
differential evolution, i.e., binomial and exponential
crossover among which the former has been more
often implemented.
Differential evolution operates on a population containing
Np individuals. It involves two stages, namely, initialization
and evolution. Initialization generates initial population P0.
Then the population evolves from one generation (Pn) to
the next (Pn+1) until termination conditions are met. While
evolving from Pn to Pn+1, three evolutionary operations,
namely, differential mutation, crossover and selection are
executed in sequence.
Differential mutation generates a mutant vi,n for each individual
xi,n in Pn by adding one or more vector differences to the base
vector bi,n
vi,n = bi,n +σ𝑦≥1 𝐹𝑦 (xp1y ,n −xp2y ,n ) , 1 ≤ i≠ p1y ≠p2y ≤ Np
Differential mutation base bi,n can be chosen in a variety of ways.
Best and random are the two most often implemented differential
mutation bases.
DE/best/*/* uses the best individual xbest, n in Pn as the differential
mutation base while DE/rand/*/* randomly chooses an individual
different from xi,n as the differential mutation base.
Although various crossover methods are
applicable, binomial crossover and
exponential crossover are widely used in
differential evolution.
In the selection phase, the child ci,n competes with the
target individual xi,n and the better one survives in the
next generation. It is mathematically expressed as
In this scheme, ci,n is generated as follows:

𝑣𝑖,𝑗,𝑛 𝛽𝑖,𝑗,𝑛 ≤𝐶𝑟


ci,j,n = ቐ (2)
𝑥𝑖,𝑗,𝑛 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒

where βi,j,n is a real random number uniform in the range [0, 1] and Cr , a
constant in [0, 1], is the crossover probability or crossover rate.
In this paper, the child ci,n is required to be different from any of its parents.
This convention is often used in evolutionary algorithms. If the child duplicates
vi,n, a randomly chosen parameter of xi,n, xi,j,n, will replace the corresponding
parameter of the child ci,n, ci,j,n.
On the other hand, if ci,n inherits no parameter from vi,n and hence no evolution
happens, a randomly chosen parameter of the child ci,n, ci,j,n,
will be replaced by the corresponding parameter of the mutant vi,n, vi,j,n.
In this scheme, an integer r is first randomly chosen from [1,N]. It
is the starting point for exponential crossover. ci,r,n of the child ci,n
is taken from vi,r,n of the mutant vi,n.
Parameters of the child after (in cyclic sense) r depends on a
series of Bernoulli experiments of probability Cr . The mutant will
keep donating its parameters to the child until the Bernoulli
experiment is unsuccessful for the first time or the crossover
length is already N −1. The remaining parameters of the child
come from xi,n.
 The probability distribution of crossover
length as their names indicate.
 How the child inherits parameters from the
mutant.
a. The child inherits a fraction of the mutant
consecutively (in cyclic sense) through
exponential crossover
b. while inheritance through binomial
crossover is non-consecutive.
The Fortran-style pseudo-code of consecutive
binomial crossover. N Bernoulli experiments of
probability Cr are carried out. The number of
successful Bernoulli experiment is the crossover
length L. A staring point r is then randomly
chosen between 1 and N. ci,n inherits L
parameters of mutant vi,n consecutively (in
cyclic sense) from the starting point r
(including). The remaining parameters of ci,n
come from xi,n.
A series of Bernoulli experiments of probability
Cr are carried out in the same way as described
in consecutive exponential crossover to
determine the crossover length L for non-
consecutive exponential crossover. L
parameters are then randomly chosen from vi,n
and inherited by ci,n. xi,n donates the remaining
parameters of ci,n. The Fortran-style pseudo-
code of non-consecutive exponential crossover.
Submitted by:
Purvi bajoria

You might also like