Enhanced Differential Evolution Algorithm with Local Search Based on Hadamard Matrix

Algorithm 1 The steps of HLS.

	Input:
(1)	Divide into four subvectors randomly
(2)	Read the information of H4
(3)	for i = 1 : 4
(4)	for j = 1 : 4
(5)	if H4[i][j] = = 1
(6)	offspring[i][j] = [i][j]
(7)	else
(8)	offspring[i][j] = [i][j]
(9)	end
(10)	end
(11)	end
	Output: offspring