Following [1]}, [2]}, [3]}, for population updating, we use a \(p \times p\)  matrix to record all the distances between any two solutions of the population. This symmetric matrix is initialized with the \(p \times (p-1)/2\)  pairwise distances computed for each pair of individuals in the initial population, and then updated each time a new individual is inserted in the population.
