Digital Signal Processing Reference
In-Depth Information
Algorithm 1:
BBO
1
Initialize a set of solutions (islands) to a problem
2
while
Termination condition not met
do
3
Evaluate the fitness (HSI) for each solution
Compute
S
,
λ
and
μ
for each solution
4
Migration
:
5
for
i
=
1to
N
do
6
Use
λ
i
to probabilistically decide whether to immigrate to
X
i
7
if
rand
(
0
,
1
)<λ
i
then
8
for
j
=
1to
N
do
9
Select the emigrating island
X
j
with probability
∝
μ
j
10
if
rand
(
0
,
1
)<μ
j
then
11
Replace a randomly selected decision variable (
SIV
)of
X
i
with its corresponding variable in
X
j
12
end
13
end
14
end
15
end
16
Mutation
:
17
for
i
=
1to
N
do
18
Compute the probability
P
i
using
λ
i
and
μ
i
19
Use the probability
P
i
to compute the mutation rate
m
i
20
for
j
=
1to
D
do
21
Select a variable (SIV)
X
i,j
with probability
∝
P
i
22
if
rand
(
0
,
1
)<m
i
then
23
Replace
X
i,j
with a randomly generated variable from its
range
24
end
25
end
26
end
27
Implement elitism to retain the best solutions in the population from one
generation to the next.
28
29
end
Search WWH ::
Custom Search