Algorithm 1 Pseudo-code of MPA algorithm.

1: Initialization step, P, TP, TF, ${\mathrm{P}\mathrm{y}}_i$.

2: while t $<t_{max}$ do

3:     Compute the fitness value of each ${\overrightarrow{py}}_i,f\left({\overrightarrow{py}}_i\right)$

4:     Construct E

5:     Implement the memory saving

6:     Update $CF$ using Equation (16)

7:     for each $p{y}_i$ do

8:     if $\left(t<\frac{1}{3}\ast t_{max}\right)$ then

9:        Reposition the current ${\overrightarrow{py}}_i$ based on Equation (11)

10:     else

11:        if  $\left(\frac{1}{3}\ast t_{max}<t<\frac{2}{3}\ast t_{max}\right)$ then

12:         if $\left(i<\frac{1}{2}\ast n\right)$ then

13:         Reposition the current ${\overrightarrow{py}}_l$ using Equation (13)

14:         else

15:         Reposition the current ${\overrightarrow{py}}_i$ using Equation (15)

16:         end if

17:        else

18:         Reposition the current ${\overrightarrow{py}}_i$ using Equation (18)

19:        end if

20:     end if

21:    end for

22:    Compute the fitness value of each ${\overrightarrow{py}}_i,f\left({\overrightarrow{py}}_i\right)$

23:    Update $TopPradatorPos$, and $TopPredatorFit$.

24:    Apply the memory saving

25:    Apply the FADS for ∀ ${\mathrm{py}}_i$

26:    $\mathrm{t}++$

27: end while