Algorithm 1: Pseudocode of SSARM-SCA.

Initialize population X by using Equation (5)

repeat

Compute the objective function for each solution $x_i$

Update the best salp (solution) $(F=Xb)$

for $i=1:N$ do

if $i==1$ then

Update the position of salp using Equation (1)

end if

if $\varphi <0.5$ then

Update followers by using SSA search and Equation (4)

else

Update followers by using SCA search and Equation (6)

end if

end for

Sort all individuals according to fitness

if $l<rmp$ then

Replace $wrs$ worst solutions by random ones using Equation (5).

end if

Update $c_1$ using Equation (2)

Update $r_1$ using Equation (7)

until$(l<L)$

Return the best solution F.