Smallest-Small-World Cellular Harmony Search for Optimization of Unconstrained Benchmark Problems

Algorithm 1

for each 𝑖∈[1,N]  do

  if  rand() ≤ HMCR  then

 𝑥^′_𝑖=𝑥^𝑗_𝑖𝑗=1,2,…,HMS % memory consideration

 if  rand() ≤ PAR   then

  𝑥^′_𝑖=𝑥^′_𝑖± rand() × 𝑏_𝑤 % pitch adjustment

  if  𝑥^′_𝑖>𝑥_𝑖𝑈

     𝑥^′_𝑖=𝑥_𝑖𝑈

  elseif 𝑥^′_𝑖<𝑥_𝑖𝐿

     𝑥^′_𝑖=𝑥_𝑖𝐿

  end

     end

  else

 𝑥^′_𝑖=𝑥_𝑖𝐿+ rand() × (𝑥_𝑖𝑈−𝑥_𝑖𝐿) % random selection

  end

end