Algorithm 10 GWO

Input: the parameters M, N,$\delta$ Begin S1: initialize M individuals $x_i\left(t\right)$randomly,$0<i\le M,$ iterative times t = 1; S2: compute$f\left(i\right), 0<i\le M$, rank the solutions and find the current top three best wolves:$x_{\alpha }\left(t\right)$,$x_{\beta }\left(t\right)$ and$x_{\delta }\left(t\right)$; if it satisfies (t > N or precision$\le \delta$), then go to step S4; otherwise, go to step S3; S3: update the solution of each individual via Equation (42), update coefficients a, A and C, iterative times t = t + 1; go to step S2; S4: output the optimized results. End