Algorithm 2 Pseudo-code of ESMA

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 (20);

End For

Apply QOBL strategy by Equation (10);

Select the best position into next iteration by greedy strategy;

t = t + 1;

End While

Return the best solution;