Algorithm 1: Pseudo-code of SMA

1. Initialize the parameters $z,max\_t,N,Dim$;

2. Initialize slime mould’s random location $\overrightarrow{X_i}(i=\mathrm{1,2},\cdots ,N)$;

3. While ($t\le max\_t$)

4.  Check the boundary and determine the fitness $\overrightarrow{S}$;

5.  Sort the fitness $\overrightarrow{S}$;

6.  Update $bF,wF,DF,\overrightarrow{X_b}$;

7.  Calculate $\overrightarrow{W}$ as per Equation (4);

8.  Update $p,\overrightarrow{vb},\overrightarrow{vc},A,B$;

9.  For each search agents

10.   Update location as per Equation (1);

11.  End For

12.  $t=t+1$;

13. End While

14. Return $DF,\overrightarrow{X_b}$;