Cluster Optimization in Mobile Ad Hoc Networks Based on Memetic Algorithm: memeHoc

Algorithm 3

Pseudocode for function replace.

(1)	Procedure Replace
(2)	Input: pop, CHs, k
(3)	Output: CHs
(4)	for (j = 1; j  k; J++) do \\ Generate new population
(5)	New_CHs [j] = rand ( [n])
(6)	end for
(7)	New_pop [j] = new_CHs [j]
(8)	for ( = 1; j  k; ++) do \\ apply crossover and mutation
(9)	Temp = pop []
(10)	Pop [] = New_pop [j]
(11)	New_pop [j] = Temp
(12)	end for
(13)	m = k/2
(14)	New_pop [m] = pop [m]
(15)	return new_pop;
(16)	end procedure