Algorithm 3 Proposed BERSFS algorithm |
-
1:
Initialize BERSFS population with size d, iterations , fitness function , , BERSFS parameters
-
2:
Calculate fitness function for each
-
3:
Find best solution as
-
4:
whiledo
-
5:
if () then
-
6:
for () do
-
7:
Update ,
-
8:
Calculate
-
9:
Update positions to head toward best solution as
-
10:
end for
-
11:
for () do
-
12:
Update ,
-
13:
Calculate
-
14:
Update positions Elitism of best solution as
-
15:
Calculate
-
16:
Update positions Investigating area around best solution as
-
17:
Compare and to select best solution
-
18:
if best fitness is not changed for last two iterations then
-
19:
Mutate solution as
-
20:
end if
-
21:
end for
-
22:
else
-
23:
for () do
-
24:
Calculate updated best solution as
-
25:
end for
-
26:
end if
-
27:
Update the fitness function for each
-
28:
Find best solution as
-
29:
Update BERSFS parameters,
-
30:
end while
-
31:
Return
|