Maximum Diversity

We refer the reader to the website of our OPTSICOM project where references, instances and best-known solutions for this problem are available. You can download here the set of benchmark instances and results for the Maximum Diversity Problem that we have compiled. The original library compiled in 2010 is: Download MDPLIB

The extended library, compiled in 2021, includes larger instances with capacity and cost: Download MDPLIB 2.0
Please, cite as: Martí, R., A. Duarte, A. Martínez-Gavara, and J. Sánchez-Oro (2021) The MDPLIB 2.0 Library of Benchmark Instances for Diversity Problems. https://www.uv.es/rmarti/paper/mdp.html.

Details about the instances and their source can be downloaded here

Papers

Discrete diversity and dispersion maximization. A review and an empirical analysis from an OR perspective
Martí, R., Martínez-Gavara, A., Sánchez-Oro, J., and S. Pérez-Peló European Journal of Operational Research Invited review, Submitted March 2021

The Capacitated Dispersion Problem. A mathematical model and a scatter search metaheuristic
Martí, R., Martínez-Gavara, A., Sánchez-Oro, J. Memetic Computing 13, 131-146 (2021)

Measuring diversity. A review and an empirical analysis
Francisco Parreño, Ramón Álvarez-Valdés, Rafael Martí European Journal of Operational Research 289, 515-532 (2021)

Heuristics for the Capacitated Dispersion Problem,
Peiró, J, I. Jiménez, J. Laguardia, R. Martí, International Transactions in Operational Research 28, 119 - 141 (2021)

Randomized Heuristics for the Capacitated Clustering Problem,
Martínez-Gavara, Landa-Silva, Campos, and Martí, Information Sciences 417, 154-168 (2017)

Heuristic Approaches for the Maximum MinSum Dispersion Problem,
Martínez-Gavara, Campos, Laguna, and Martí Journal of Global Optimization , 67, 671-686 (2017)

Tabu search for the max-mean dispersion problem,
Carrasco, Pham, Gallego, Gortázar, Martí, and Duarte Knowledge based systems 85, 256-264, (2015)

GRASP with Exterior Path Relinking for Differential Dispersion Minimization,
A. Duarte, J. Sánchez-Oro, M. Resende, F. Glover, and R. Martí, Information Sciences 296, 46-60, (2015)

Tabu Search and GRASP for the Capacitated Clustering Problem,
Martínez-Gavara, Campos, Gallego, Laguna and Martí, Computational Optimization and Applications, 62, 589-607, (2015)

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. 64, 724-734 (2013)

GRASP and PR for the Equitable Dispersion Problem
Rafael Martí and Fernando Sandoya, Computers and Operations Research 40, 3091-3099 (2013)

Heuristics and Metaheuristics for the Maximum Diversity Problem
Rafael Martí, Micael Gallego and Abraham Duarte, Journal of Heuristics, 19, 591-615 (2013)

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)