Algorithm 3: Mutation

1.Input:$Population\left[N,k\right]$; $t$; $t_{max}$; $P\left(B_i\right)$; 2.Output:$Population\left[end,k\right]$; 3. $i=1$ 4. while $i\le$ N do 5. if $\mathrm{rand}\le P_{mut}\left(0\right)\times \frac{t_{max}-t}{t_{max}}$ then 6.Randomly select gene node for mutation 7.Select the result of mutation by probability 8.The sub-individual is inserted at the end of the population 9. end if 10. $i=i+1$ 11. end while