Skip to main content
. 2016 Aug 12;16(8):1275. doi: 10.3390/s16081275
Algorithm 1. EKH algorithm
Begin
Step 1: Initialization. Initialize the Iteration counter I=1, the population P of NP krill, Vf, Dmax and Nmax.
Step 2: Fitness calculation. Calculate fitness for each krill according to its initial position.
Step 3: While I < Maximum Iteration do
Sort all the population according to their fitness.
for i=1:NP (all krill) do
Perform the following motion calculation.
Motion induced by other individuals
Foraging motion
Physical diffusion
Compute dxi/dt according to Equation (7).
Implement the crossover operator.
Updating the krill individual position in the search space.
Calculate fitness for each krill according to its new position.
end for i
I = I+1.
Step 4: end while
End.