Algorithm 4 Population Evaluation.

1:for individual $p_i,i=1$ to n do 2:   Get the index $j_b$ of the biggest in ${\mathbf{\varphi }}_i={\left\{{\varphi }_{i,j}\right\}}_{j=1}^k$. 3:   for task $T_j,j=1$ to k do 4:     if $j\in j_b$ or $rand<{\varphi }_{i,j}$ then 5:        $fitnes{s}_{i,j}=f_j\left(positio{n}_i\right)$. 6:     else 7:        $fitnes{s}_{i,j}=\infty$. 8:     end if 9:     if $fitnes{s}_{i,j}$ is better than ${\mathit{pbest}}_i$’s fitness on j then 10:        Update the ${\mathit{pbest}}_i$. 11:        if $fitnes{s}_{i,j}$ is better than fitness of ${\mathit{gbest}}_j$ then 12:          Update the ${\mathit{gbest}}_j$. 13:        end if 14:     end if 15:   end for 16:end for