Algorithm 2 Local Foraging Behavior of an Ant

1:if  $nc\left(a_i\right)<p$  then 2:      Increment memory counter: $nc\left(a_i\right)\leftarrow nc\left(a_i\right)+1$ 3:      Create a new hunting site near the nest 4:      $S_{nc}\left(a_i\right)\leftarrow {\mathrm{\Theta }}_{expo}(N,A_{site})$ 5:      $en\left(a_i\right)\leftarrow 0$                      ▹ Failure counter 6: end if 7:Let $s_j$ be the last visited site 8:if  $e_j>0$  then 9:      Randomly choose another site from memory 10: end if 11:Perform local exploration: $S_u\leftarrow {\mathrm{\Theta }}_{local}(s_j,A_{local})$ 12:if  $f\left(S_u\right)>f\left(s_j\right)$  then 13:      Update site: $s_j\leftarrow S_u$ 14:      $e_j\leftarrow 0$ 15: else 16:      Increment failure counter: $e_j\leftarrow e_j+1$ 17:      if $e_j>P_{local}$ then 18:           Remove $s_j$ from memory 19:           $nc\left(a_i\right)\leftarrow nc\left(a_i\right)-1$ 20:      end if 21: end if