“…is met, the number of halted generations, or the best fitness value is obtained. Algorithm 1: The main steps of the GOA algorithm Initialize a set of random solutions xi (i = 1,2,3, … , n) as an initial population Initialize the GOA parameters cMax, cMin, and Max number of iterations Evaluate the fitness of all individuals T = the best solution while (k < maximum number of iterations) do Update c using equation (7) for each solution in the population, do Standardize the distance between grasshopper into [1,4] Update the position vectors using equation (8) Update the step vectors according to equation ( 10) end for there is a better solution, update T k = k+1 end while Output the T Algorithm 1 presents the pseudo-code of the conventional GOA algorithm. It can be observed that the GOA algorithm randomly generates its initial population and assesses each search agent using an objective criterion upon the optimization process begin.…”