Maximum Diversity
We refer the reader to the web site of the OPTSICOM project where references, instances and best known solutions for this problem are available.
Papers
Tabu search with Strategic Oscillation for the maximally diverse grouping problem
Micael Gallego, Manuel Laguna, Rafael Martí and Abraham Duarte,
Journal of the Operational Research Society. To appear
GRASP and PR for the Equitable Dispersion Problem
Rafael Martí and Fernando Sandoya,
Computers and Operations Research (2012) To appear
Heuristics and Metaheuristics for the Maximum Diversity Problem
Rafael Martí, Micael Gallego and Abraham Duarte,
Journal of Heuristics. To appear
GRASP and Path Relinking for the Max-Min Diversity Problem
M. Resende, R. Martí, M. Gallego and A. Duarte,
Computers and Operations Research 37, 498-508 (2010)
Download MMDP instances.
(75 Glover instances,
60 Geo instances and 60 Ran instances).
Download best known solutions for the Max-Min Diversity problem.
A Branch and Bound algorithm for the Maximum Diversity Problem
Rafael Martí, Micael Gallego and Abraham Duarte,
European Journal of Operational Research 200(1), 36-44 (2010)
Hybrid heuristics for the Maximum Diversity Problem
M. Gallego, A. Duarte, M. Laguna and R. Martí,
Computational Optimization and Applications 44(3), 411-426 (2009)
Tabu Search for the Maximum Diversity Problem
Abraham Duarte and Rafael Martí,
European Journal of Operational Research 178, 71-84 (2007)