Cellular Harmony Search for Optimization Problems

Algorithm 1

The pseudocode of cellular harmony search (cHS).

Set HMCR, PAR, NI, HMS, bw.

𝑥^𝑗_𝑖=𝐿𝐵_𝑖+𝑈(0,1)×(𝑈𝐵_𝑖−𝐿𝐵_𝑖), ∀𝑖=1,2,…,𝑁, ∀𝑗=1,2,…,HMS, 𝑈(0,1);

Calculate (𝑓(𝑥́_𝑖)), ∀𝑗=1,2,…,HMS;

Generate(NM) {generate the neighborhood matrix}

While  !𝑆𝑡𝑜𝑝𝐶𝑜𝑛𝑑𝑖𝑡𝑖𝑜𝑛()  do

 select random individual 𝐱^𝑟

 𝑥́=Ø;

 for  𝑖=1,…,𝑁  do

  if  𝑈(0,1)≤HMS  then

   𝑥́^𝑖∈𝜉_𝑟; {Memory Consideration}

   if  𝑈(0,1)≤PAR  then

      𝑥́^𝑖=𝑥́^𝑖+𝑈 (−1,1)×𝑏𝑤;  {Pitch Adjustment}

   end if

  else

   𝑥́^𝑖=𝐿𝐵_𝑖+𝑈 (0,1)×(𝑈𝐵_𝑖−𝐿𝐵_𝑖);  {Random Consideration}

  end if

 end for

 find(𝑥^worst) where 𝑥^worst∈𝜉_𝑟

 if  𝑓(𝑥)́<𝑓(𝑥^worst)  then

  include 𝑥́ to HM;

  exclude 𝑥́^worst from HM;

 end if

end while