Algorithm 1 Pseudocode of PL-AOA

1: Initialize the parameters related to the algorithm: $ub,lb,Dim,max\_iter$$group=4$.

2: Generate initial population $X$ containing $N$ individuals $X_i\left(i=0,1,2,3,\cdots ,N\right)$.

3: Divide $X$ into 4 groups.

4: Do

5:    if $r_1>MOA$

6:          Update the $X$ by Equation (1).

7:     else

8:          Update the $X$ by Equation (2).

9:     for i = 1:$group$

10:          for i = 1:$Dim$

11:            if $f_{winner}<f_{gbest}$

12:               Update the best solution obtained so far.

13:               Change flight status according to iteration.

14:            end

15:            if $iteration=50$

16:               Update the $pbest$ by Equation (6) and calculate its fitness value.

17:            if $f_{gbest}<f_{pbest\prime }$

18:               Update the best solution obtained so far.

19:               Change flight status according to iteration.

20:        end

21:     end

22: While ($t<max\_iter)$$or \left( get the expected function value\right).$

23: Return the best solution obtained so far as the global optimum.