According to [1]}, [2]}, the population update procedure aims to keep the best individuals, but also to ensure a minimum spacing distance between the \(p\)  individuals. The update procedure is sequential, as we need to compare one by one existing individuals in the population \(P_t = \lbrace S_1, \dots , S_p \rbrace \)  at generation \(t\)  and the tabu search improved offspring solutions in the population \(P^{\prime } = \lbrace S^{\prime }_1, \dots , S^{\prime }_p\rbrace \) .
