Algorithm 1 Global Foraging Strategy of the API Algorithm

1:Initialize the nest position $N\leftarrow \mathrm{Orand}$ 2:$T\leftarrow 0$                            ▹ Iteration counter 3:while stopping condition not met do 4:      for each ant $a_i\in A$ do 5:            Perform local exploration: API ← Foraging($a_i$) 6:      end for 7:      if nest relocation condition is satisfied then 8:            $N\leftarrow S^{+}$                  ▹ Move the nest to the best site 9:            Reset ant memories 10:    end if 11:    $T\leftarrow T+1$ 12:end while 13:return best solution $S^{+}$ and its evaluation $f\left(S^{+}\right)$