Algorithm 1 Pseudo-code of SMA

Initialize the positions of search agent;

While current iteration < maximum iteration do

Check if any search agent goes beyond the search space and amend it;

Calculate the fitness of all slime mould;

For each search agent do

Update positions by Equation (1);

End For

t = t + 1;

End While

Return the best solution;