Algorithm 1: Pseudocode of SSO algorithm

Define $Ite{r}_{\max }$, $NP, n, P_{dp}, sf, G_c, F{S}_U$ and $F{S}_L$ Arbitrarily initializing the flying squirrels places $$F{S}_{i,j}=F{S}_L+rand()\ast \left(F{S}_U-F{S}_L\right), i=1,2, \dots , NP, j=1,2, \dots , n$$ Compute fitness value $$f_i=f_i\left(F{S}_{i,1},F{S}_{i,2},\dots , \mathrm{F}{S}_{i,n}\right), i=1,2, \dots , NP$$ while $Iter<Ite{r}_{ \max }$ $$\left[sorted‐f, sorte‐index\right] =sort\left(f\right)$$ $$F{S}_{ht}=FS\left(sorte\_index\left(1\right)\right)$$ $$F{S}_{at}\left(1:3\right)=FS\left(sort{e}_{-}index\left(2:4\right)\right)$$ $$F{S}_{nt}\left(1:NP-4\right)=FS\left(sorte\_index\left(5:NP\right)\right)$$ Create novel places for $t=1:n1$($n1=$ entire count of squirrels on acorn trees)     if $R_1\ge P_{dp}$ $$F{S}_{at}^{new}=F{S}_{at}^{old}+d_g{G}_c\left(F{S}_{ht}^{old}-F{S}_{at}^{old}\right)$$     else $$F{S}_{at}^{new}=random location$$     end end for $t=1:n2$($n2=$ entire count of squirrels on normal trees moving to acorn trees)     if $R_2\ge P_{dp}$ $$F{S}_{nt}^{new}=F{S}_{nt}^{old}+d_g{G}_c\left(F{S}_{at}^{old}-F{S}_{nt}^{old}\right)$$     else $$F{S}_{nt}^{new}=random location$$     end end for $t=1:n3$($n3=$ entire count of squirrels on normal trees moving to hickory trees)     if $R_3\ge P_{dp}$ $$F{S}_{nt}^{new}=F{S}_{nt}^{old}+d_g{G}_c\left(F{S}_{ht}^{old}-F{S}_{nt}^{old}\right)$$     else $$F{S}_{nt}^{new}=random location$$     end end $$S_c^t=\sqrt{{\displaystyle \sum }_{k--1}^n{(F{S}_{atk}^t-F{S}_{htk})}^2}, S_{c \min }=\frac{10B-6}{{365}^{Iter/\left(Ite{r}_{ \max }\right)/2.5}}$$ if $s_c^t<s_{c \min }$ $$F{S}_{nt}^{new}=F{S}_L+L\acute{e}vy\left(n\right)\times \left(F{S}_U-F{S}_L\right)$$ end Compute fitness value of novel places $$f_i=f_i\left(F{S}_{i,1}^{new},F{S}_{i,2}^{new}, \dots ,F{S}_{i,n}^{new}\right), i=1,2, \dots ,NP$$ $$Iter=Iter+1$$ end