Algorithm 4 Update function

1:input:$P\left(t\right),in{d}^c$;                      ▹ the sub-populations $P\left(t\right)$ 2:output:$P(t+1)$;                     ▹ the new sub-population $P(t+1)$ 3:$[o1,o2]\leftarrow$ generate new offspring by crossover from the $in{d}^c$ and best individual of $P\left(t\right)$; 4:$P(t+1)\leftarrow \{o1,o2\}$; 5:while$\left|P\right(t+1\left)\right|<\left|P\right(t\left)\right|$do                ▹ keep the number of individuals in the P 6:    $p1\leftarrow$ select an individual at random among the $in{d}^c$ and best individual of the $P\left(t\right)$; 7:    $p2\leftarrow$ select an individual at random among remaining individuals of $P\left(t\right)$; 8:    $[o1,o2]\leftarrow$ generate new offspring by crossover from the $p1$ and $p2$; 9:    $P(t+1)\leftarrow P(t+1)\cup \{o1,o2\}$; 10:end while 11:$P(t+1)\leftarrow$ run a mutation on overlapping individuals;