A Novel Modified Sparrow Search Algorithm with Application in Side Lobe Level Reduction of Linear Antenna Array

Algorithm 2

Modified sparrow search algorithm.

Input:N (Population size), D (Dimension size), P_Num (Producers size), S_{Num (}Scouters size), ST

   (Safety threshold), t (Initial iteration), t_max (Maximum iterations)

Output:X_best (Global optimal position), F_best (Fitness of global optimal position)

1: /Initializing/

2: Randomly generate the positions of N sparrows X_i,j by homogeneous chaotic system

  (i=1,2,…,N, j=1,2,…,D);

3: Calculate the fitness of each sparrow F_i;

4: Find X_best and F_best;

5: /Iterating/

6: whilet < t_maxdo

7:   Sort the F_i and find global worst position X_worst;

8:   R₂ = rand(1);

9:   fori = 1 : P_Num

10:    Evaluate and calculate the adaptive weight w;

11:    Update the position X_i,j by (7);

12:    Check and adjust position that overstep the boundary by Algorithm 1;

13:   end for

14:   Sort the F_i and find the best position of producers X_p;

15:   fori = (P_Num + 1) : N

16:    Update the position X_i,j by (2);

17:    Check and adjust position that overstep the boundary by Algorithm 1;

18:   end for

19:   fori = 1 : S_Num

20:    Update the position X_i,j by (3);

21:    Check and adjust position that overstep the boundary by Algorithm 1;

22:   end for

23:    Evaluate and update X_best and F_best;

24:    t = t + 1;

25: end while

26: returnX_best and F_best;