Algorithm 1. Salp Swarm Algorithm

1. Initialization:

Salp swarm random population generation $X_i$ where i = 1,2,3, . . . ., n

2. Determine each salp’s fitness value.

3. Assign $X^{\mathrm{*}}$ as one of the best searching agents.

4. While the end condition has not arrived

5. Update the convergence factor $r_1$ by Equation (7)

6. For each and every salp

7. If (n = = 1)

8. Update leader salp’s position, $x_{1,d}$ using Equation (6)

9. Else

10. Update the follower salps’ position, $x_{k,d}^{i+1}$ using Equation (12)

11. End if

12. End for

13. Estimate each salp’s fitness value using Equation (14).

14. Update the $X^{\mathrm{*}}$ with its finest solution.

15. End while

16. Return $X^{\mathrm{*}}$ along with its best fitness value.