A Simple Genetic Algorithm for the Maximum Min-Sum Dispersion Problem (Max-MinSum DP) and New Node Similarity-Based Variants

Dispersion problems are NP-hard optimization problems with several applications in facility location problems or social network analysis. In this article, a new genetic algorithm is proposed to solve the base variant of the problem. Comparisons with other methods show the effectiveness of the proposed algorithm. As a further step, we extend the dispersion problem: Instead of the basic distance function, other node similarity-based measures are used, and real-world networks are analysed.