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

Algorithm 3

The procedure of learner phase.

For each learner  𝑥^𝑗 (𝑗=1,2,…,NP)

 Randomly select another learner 𝑥^𝑘 (𝑗≠𝑘)

   If  𝑥^𝑗 is superior to 𝑥^𝑘 then

    𝑥^𝑗,new=𝑥^𝑗,old+rand()×(𝑥^𝑗−𝑥^𝑘)

   Else

    𝑥^𝑗,new=𝑥^𝑗,old+rand()×(𝑥^𝑘−𝑥^𝑗)

   End

End  for

If  𝑥^𝑗,new is superior to 𝑥^𝑗,old  then

 𝑥^𝑗=𝑥^𝑗,new

  End  If