Algorithm 1 The main steps of the GOA algorithm

Initializes the swarm $xi\left(i=1,2,3,\dots ,n\right)$

Initialize $cmax,cmin$, and maximum number of iterations

Calculate the fitness of each search agent

T = the best search agent

while ($I<Maxnumberofiterations$)

Update $c$ using Equation (11)

For each search agent

Normalize the distance between grasshopper in [1,4]

Update the position of current search agent by the Equation (10)

Bring the current search agent back if it goes outside the boundaries

End for

update $T$ if a better solution is achieved

solution $i=i+1$

End while

Return