A Novel Harmony Search Algorithm Based on Teaching-Learning Strategies for 0-1 Knapsack Problems

Algorithm 5

𝑋^new2=𝑋^worst

i  =  round(rand()*D) //Generating a random integer between 1 and D.

𝑥^new2_𝑖=𝑥^𝑗_𝑖,𝑗∈𝑈{1,2,…,HMS}