Digital Signal Processing Reference
In-Depth Information
p
1
α
p
1
(1-α)
p
2
p
2
FIGURE 8.3
Example of an arithmetic crossover.
0
0
1
0
1
1
1
1
Original
population
1
1
1
1
0
0
0
0
1
0
1
0
0
0
1
0
0
0
1
0
1
1
1
1
0
1
1
1
0
0
0
0
Mutated
population
1
0
1
0
0
0
1
1
FIGURE 8.4
Binary mutation.
improvements in the quality of the obtained solutions. Figure 8.4 illustrates
the process.
In the real coding case, mutation is typically implemented with the aid of
continuous random variables. We may consider, for instance, that the rela-
tionship between the mutated and the original solutions obeys the following
form:
x
=
+
x
m
(8.2)
