A Cooperative Harmony Search Algorithm for Function Optimization

Pseudocode 1

Pseudocode for the SHS algorithm.

Initialize parameters and HM

while  𝑡<𝑇_max  do

 For  𝑖=1  to  𝑛  do

  if  rand()≤HMCR  then

   𝑥^new_𝑖=𝑥^𝑗_𝑖, where 𝑗∼𝑈(1,2,…,HMS)

   if  rand()≤PAR  then

    𝑥^new_𝑖=𝑥^new_𝑖±bw×rand()

   end if

  else

   𝑥^new_𝑖=𝐿𝑥_𝑗+(𝑈𝑥_𝑖−𝐿𝑥_𝑖)×rand()

  end if

 end for

 Update HM

end while