Algorithm 2 Reptile Search Algorithm (RSA)

1:Initialize RSA parameters $\alpha ,\beta$ and initialize the population.   2:while $t<T$ do   3:      Calculate the fitness of individuals and the global best individual.   4:      Update the $ES$      The beginning of the RSA   5:      for $i=1$ to N do   6:            for $j=1$ to D do   7:               Update the ${\eta }_{(i,j)}^{\left(t\right)}$, $R_{(i,j)}^{\left(t\right)}$, $P_{(i,j)}^{\left(t\right)}$.                        Exploration phase   8:               if $\left(t⩽{\displaystyle \frac{T}{4}}\right)$ then   9:                   $x_{(i,j)}^{(t+1)}=Bes{t}_j^{\left(t\right)}\times -{\eta }_{(i,j)}^{\left(t\right)}\times \beta -R_{(i,j)}^{\left(t\right)}\times rand$                        High walking 10:               else if $\left(t⩽2{\displaystyle \frac{T}{4}}\right)$ and $\left(t>{\displaystyle \frac{T}{4}}\right)$ then 11:                   $x_{(i,j)}^{(t+1)}=Bes{t}_j^{\left(t\right)}\times x_{(r_1,j)}\times E{S}^{\left(t\right)}\times rand$                                Belly walking                        Exploitation phase 12:               else if $\left(t⩽3{\displaystyle \frac{T}{4}}\right)$ and $\left(t>2{\displaystyle \frac{T}{4}}\right)$ then 13:                   $x_{(i,j)}^{(t+1)}=Bes{t}_j^{\left(t\right)}\times P_{(i,j)}^{\left(t\right)}\times rand$                              Hunting Coordination 14:               else 15:                   $x_{(i,j)}^{(t+1)}=Bes{t}_j^{\left(t\right)}-{\eta }_{(i,j)}^{\left(t\right)}\times ϵ-R_{(i,j)}^{\left(t\right)}\times rand$               Hunting cooperation 16:               end if 17:            end for 18:      end for 19:      $t=t+1$ 20:end while 21:return the global best.