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

Algorithm 2

The NGHS modifies improvisation step.

For  𝐢=𝟏  to  𝐃  do

 𝑥^𝑟_𝑖=2×𝑥^best_𝑖−𝑥^worst_𝑖

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

 𝑥^new_𝑖=𝑥^worst_𝑖+rand()×(𝑥^𝑟_𝑖−𝑥^worst_𝑖).

 If  rand( ) ≤ 𝑝_𝑚 //random mutation

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

 End  If

End  For.