Simulated Annealing-Based Krill Herd Algorithm for Global Optimization

Algorithm 2

Simulated annealing-based krill herd algorithm.

Begin

  Step  1: Initialization. Set the generation counter 𝑡, the population P of 𝑁𝑃 krill, the foraging

      speed 𝑉_𝑓, the diffusion speed 𝐷^max, and the maximum speed 𝑁^max,

      temperature 𝑇₀, Boltzmann constant 𝑘, cooling factor 𝛼, and an acceptance threshold number 𝑓_𝑛,

      and elitism parameter KEEP.

  Step  2: Fitness calculation. Calculate the fitness for each krill based on their initial position.

  Step  3: While  𝑡 < MaxGeneration  do 

      Sort all the krill according to their fitness.

      Store the KEEP best krill.

      for  𝑖=1∶𝑁𝑃 (all krill)  do

        Implement three motion as described in Section 2.1.

        Update position for krill 𝑖 by krill selecting operator in Algorithm 1.

        Calculate the fitness for each krill based on its new position 𝑋_𝑖+1.

      end for  𝑖

      Substitute the KEEP best krill for the KEEP worst krill.

      Sort all the krill according to their fitness and find the current best.

      𝑡=𝑡+1;

  Step  4: end while

  Step  5: Output the best solution.

End.