Reliable Node Clustering for Mobile Ad Hoc Networks

Algorithm 1

Scatter search.

(1)  for  𝑖 = 0 to 𝑀𝑎𝑥𝐼𝑡𝑒𝑟  do

(2)  pool of solutions 𝑃∶=  Diversification()

(3)  for  𝑝∈𝑃  do

(4)   𝑝:= {𝑝}  ∪  Improvement (𝑝)

(5)   𝑅𝑒𝑓𝑆𝑒𝑡 ∶=  Reference Set Update (𝑝)

(6)  end for

(7)  repeat

(8)   pool of subsets 𝑆 ∶=  Subset Generation (𝑅𝑒𝑓𝑆𝑒𝑡)

(9)   for  (𝑠₁,𝑠₂)∈𝑆  do

(10)    𝑠′∶=  Solution Combination (𝑠₁,𝑠₂)

(11)    𝑠̂∶= {𝑠′}  ∪  Improvement(𝑠′)

(12)    𝑅𝑒𝑓𝑆𝑒𝑡∶=  Reference Set Update (𝑠)̂

(13)        end for

(14)      until  𝑅𝑒𝑓𝑆𝑒𝑡 remains the same

(15)  end for