Algorithm 1 Pseudocode of ATOAcs

1:Initialize X, N, t, T, min, max, $\alpha$, $\mu$, and $ϵ$. 2:while t < T do 3:   Calculate the $best\left(x_j\right)$, $\mathrm{MOA}\left(t\right)$ and $\mathrm{MOP}\left(t\right)$. 4:   for $i=1:size(X,1)$ do 5:     for $j=1:size(X,2)$ do 6:        Generate $r_1\in [0,1]$ 7:        if $r_1$≤ MOA then 8:          Generate $r_2\in [0,1]$. 9:          if $r_2$≤ 0.5 then 10:             Compute the $x_{i,j}(t+1)$ using the first case in (17). 11:          else 12:             Compute the $x_{i,j}(t+1)$ using the second case in (17). 13:          end if 14:        else 15:          Generate $r_3\in [0,1]$. 16:          if $r_3$≤ 0.5 then 17:             Compute the $x_{i,j}(t+1)$ using the first case in (18). 18:          else 19:             Compute the $x_{i,j}(t+1)$ using the second case in (18). 20:          end if 21:        end if 22:     end for 23:   end for 24:   $t=t+1$ 25:end while 26:return  best(xj)