Algorithm 3 ABC main steps

$\mathbf{Initialize}$ the food source locations (solutions) $x_{ij}$, $i=1,\dots ,SN$ e $j=1,\dots ,D$ $\mathbf{Define}$ $N_{exh}$ e $E_{exp}$; t: = 1 while ($t\le MCN$) and (solution not yet found) do    $\mathbf{Compute}$ $v_{ij}=x_{ij}+{\varphi }_{ij}·(x_{ij}-x_{kj})$    $\mathbf{Evaluate}$ new solutions using objective function    $\mathbf{Apply}$ selection greedy process    $\mathbf{Compute}$ probabilities $P_i=\frac{f\left(x_i\right)}{{\sum }_1^{SN}f\left(x_n\right)}$    $\mathbf{Compute}$ onlookers $v_{ij}$ using selected $x_{ij}$ and $P_i$    $\mathbf{Evaluate}$ new solutions using objective function    $\mathbf{Apply}$ selection greedy process    $\mathbf{Determine}$ source to abandon when hitting $N_{exh}$    $\mathbf{Replace}$ the abandoned source $x_i^j=x_{best}^j+rand(0,1)·(x_{max}^j+x_{min}^j)$    $\mathbf{Store}$ the best solution (food source) found so fa    t: = t + 1 end while $\mathbf{Return}$ best solution