Algorithm 3. The pseudocode of the proposed local search procedure

Inputs: search agents ($X$), the best search agent ($X_B$), current iteration ($c_i$), maximum number of iterations ($m_i$), and lower ($LB$) and upper ($UB$) boundaries of search space

Outputs: the best search agent ($X_B$) and its fitness ($F_B$)

for ($i=1 to \phi$)

Select $X_j$ and $X_k$ randomly from the X

Calculate $\delta$ using Equation (53)

Obtain ${newX}_B$ using Equation (52)

Check and rectify the ${newX}_B$ using Equation (45)

Compute ${newF}_B$ by Equation (42)

if ${newF}_B<F_B$

$X_B= {newX}_B$

$F_B={newF}_B$

end if

end for

Return $X_B$ and $F_B$