Algorithm 1: Pseudo Code of Improved GWO
1	Initialize (Xi (i = 1, 2…, n)) t, Tmax, a, A, C
2	Initialize Tent map x0
3	Calculate the fitness of each wolf
4	Xa = best wolf. Xβ = second wolf. Xw = third wolf.
5	While t < Tmax
6	Sort  fitness of each wolf
7	Update chaotic number, a
8	for each search agent
9	Update position current wolf using
10	end
11	Calculate  fitness of each wolf
12	Update Xa, Xβ, Xw
13	t = t + 1
14	end