Simulated Annealing-Based Krill Herd Algorithm for Global Optimization

Algorithm 1

Krill selecting (KS) operator.

Begin

    𝑇=𝛼∗𝑇;

    Δ𝑓=𝑓(𝑋^′_𝑖)−𝑓(𝑋_𝑖);

   % Accept if improved

    If  (−Δ𝑓>𝑓_𝑛)  then do

    𝑋_𝑖+1=𝑋^′_𝑖;

    end if

   % Accept with a low probability if not improved

    If (Δ𝑓<=𝑓_𝑛 & exp(−Δ𝑓/(𝑘∗𝑇))  >𝑟)  then do

     𝑋_𝑖+1=𝑋^′_𝑖;

    end if

End.