Algorithm 1 Grey wolf optimization |
-
1:
Initialize the number of iterations for optimization
-
2:
Initialize the positions of n grey wolves , 1, 2, …, N
-
3:
Calculate the fitness value of each grey wolf
-
4:
Choose the best three grey wolves as , , base on there fitness
-
5:
.
-
6:
whilet <
do
-
7:
Update the position of the wolves using to Equation (6)
-
8:
Update , A, and C
-
9:
Calculate the fitness of each grey wolf
-
10:
Update the first three grey wolves , ,
-
11:
.
-
12:
end while
-
13:
return
|