Pseudo (MSD-SSA)

Initialize the salp population $x_i\left(i=1,2,\cdots ,N\right)$ considering upper and lower

Calculate the fitness of each salp

While (end condition is not satisfied)

F = the best salp

Equation (3) Calculate c₁

if $\text{0}\le t<T/2$

for each salp ( $x_i$ )

if (leaders)

Equations (7)-(10) calculates the random step of Levy flight

Update the position of the search agents by Equation (14) or Equation (15)

Equation (12) leader crossover operator operation

Greedy algorithm selects better leaders

else (followers)

Update the position of the search agents by Equation (17)

end

else $T/2\le t<T$

for each salp ( $x_i$ )

if (leaders)

Calculate the random step of Brownian motion

Update the position of the search agents by Equation (16)

else (followers)

Update the position of the search agents by Equation (17)

end

end

Amend the salp based on the upper and lower bounds of variables

end

return F