An Improved Harmony Search Based on Teaching-Learning Strategy for Unconstrained Optimization Problems

Algorithm 1

The improvisation procedure of new harmony vector by HS.

  For  i = 1 to D  do

 If  rand( ) ≤ HMCR  then

  𝑥^new_𝑖=𝑥^𝑗_𝑖,𝑗∈U{1,2,…,HMS}

  If  rand( ) ≤ PAR  then

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

   𝑥^new_𝑖=min(max(𝑥^new_𝑖,𝑥^𝐿_𝑖),𝑥^𝑈_𝑖)

  End  If

 Else

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

 End  If

End  For