Abstract
The maximum diversity problem (MDP) consists of identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse characteristics among the elements of the subset. The identification of such solution is an NP-hard problem. Some heuristics are available to obtain approximate solutions for this problem. In this paper, we propose different GRASP heuristics for the MDP, using distinct construction procedures and including a path-relinking technique. Performance comparison among related work and the proposed heuristics is provided. Experimental results show that the new GRASP heuristics are quite robust and are able to find high-quality solutions in reasonable computational times.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: Probability distribution of solution time in GRASP: An experimental investigation. J. Heuristics 8, 343–373 (2002)
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109–133 (1995)
Feo, T.A., Resende, M.G.C., Smith, S.H.: A greedy randomized adaptive search procedure for maximum independent set. Oper. Res. 42, 860–878 (1994)
Ghosh, J.B.: Computational aspects of the maximum diversity problem. Oper. Res. Lett. 19, 175–181 (1996)
Glover, F., Laguna, M., Martí, R.: Fundamentals of scatter search and path-relinking. Control Cybern. 19, 653–684 (1977)
Glover, F., Kuo, C., Dhir, K.: Analyzing and modeling the maximum diversity problem by zero–one programming. Decis. Sci. 24, 1171–1185 (1993)
Glover, F., Kuo, C.-C., Dhir, K.S.: Integer programming and heuristic approaches to the minimum diversity problem. J. Bus. Manag. 4, 93–111 (1996)
Kochenberger, G., Glover, F.: Diversity data mining. Working Paper, The University of Mississippi, 1999
Laguna, M., Martí, R.: GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J. Comput. 11, 44–52 (1999)
Prais, M., Ribeiro, C.C.: Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J. Comput. 12, 164–176 (2000)
Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 219–249 (2003)
Resende, M.G.C., Ribeiro, C.C.: GRASP with path-relinking: Recent advances and applications. In: Ibaraki, T. et al. (eds.) Metaheuristics: Progress as Real Problem Solvers, pp. 29–63 (2005)
Ribeiro, C.C., Uchoa, E., Werneck, R.F.: A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS J. Comput. 14, 228–246 (2002)
Silva, G.C., Ochi, L.S., Martins, S.L.: Experimental comparison of greedy randomized adaptive search procedures for the maximum diversity problem. In: Lecture Notes on Computer Science, vol. 3059, pp. 498–512. Springer, Berlin (2004)
Weitz, R., Lakshminarayanan, S.: An empirical comparison of heuristic methods for creating maximally diverse groups. J. Oper. Res. Soc. 49, 635–646 (1998)
Author information
Authors and Affiliations
Corresponding author
Additional information
G.C. Silva’s work sponsored by CAPES MSc scholarship. L.S. Ochi’s work sponsored by CNPq research grants 304103/2003-9 and 550059/2005-9. S.L. Martins’s work sponsored by CNPq research grant 475124/03-0. A. Plastino’s work sponsored by CNPq research grants 300879/00-8 and 475124/03-0.
Rights and permissions
About this article
Cite this article
Silva, G.C., de Andrade, M.R.Q., Ochi, L.S. et al. New heuristics for the maximum diversity problem. J Heuristics 13, 315–336 (2007). https://doi.org/10.1007/s10732-007-9010-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-007-9010-x