Algorithm 1: GWO pseudo-code.
1.	Randomly initialize the grey wolves’ population.
2.	Initialize ${\mathit{\vartheta }}_{j,0}$, ${\mathit{\upsilon }}_{j,0}$, and ${\lambda }_{j,0}^i$.
3.	Calculate the objective values for each search agent and select ${\mathit{x}}_0^{\alpha }$, ${\mathit{x}}_0^{\beta }$, and ${\mathit{x}}_0^{\delta }$.
4.	Update the position of the current search agent.
5.	Update ${\mathit{\vartheta }}_{j,k}$, ${\mathit{\upsilon }}_{j,k}$, and ${\lambda }_{j,k}^i$
6.	Calculate the objective values of all search agents by applying Equation (10).
7.	Update the positions ${\mathit{x}}_k^{\alpha }$, ${\mathit{x}}_k^{\beta }$, and ${\mathit{x}}_k^{\delta }$.
8.	Check the termination criterion and make iterations repeated.