Wu, Qinghua; Hao, Jin-Kao - In: European Journal of Operational Research 231 (2013) 2, pp. 452-464
The Maximum Diversity Problem (MDP) consists in selecting a subset of m elements from a given set of n elements (nm) in such a way that the sum of the pairwise distances between the m chosen elements is maximized. We present a hybrid metaheuristic algorithm (denoted by MAMDP) for MDP. The...