
224 Hunting Search Algorithm
where x
0
i
is the position value of the leader for the i
th
variable, rand is a
uniform random number between [0,1]. x
max
i
and x
min
i
are the maximum and
minimum possible values of variable x
i
, respectively. EN counts the number
of times that the group has been trapped until this step. As the algorithm
goes on, the solution gradually converges to the optimum point. Parameters
α and β are positive real values.
Step 6. Repeat Steps 3–5 until the termination criterion is satisfied.
In this step, the computations are terminated when the termination criterion
is satisfied. If not, Step 3 and Step 5 are then repeated. The termination
criterion ...