Abstract
The Maximum Diversity Problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse characteristics between themselves. The identification of such solution is an NP-hard problem. This paper presents a GRASP heuristic associated with the path-relinking technique developed to obtain high-quality solutions for this problem in a competitive computational time. Experimental results illustrate the effectiveness of using the path-relinking method to improve results generated by pure GRASP.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: Probability distribution of solution time in GRASP: An experimental investigation. J. of Heuristics 8, 343–373 (2002)
Andrade, P.M.F., Plastino, A., Ochi, L.S., Martins, S.L.: GRASP for the Maximum Diversity Problem. In: Procs. of MIC 2003. CD-ROM Paper: MIC03_15 (2003)
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. of Global Optimization 6, 109–133 (1995)
Ghosh, J.B.: Computational aspects of the maximum diversity problem. Operations Research Letters 19, 175–181 (1996)
Glover, F., Laguna, M., Marti, R.: Fundamentals of scatter search and path-relinking. Control and Cybernetics 19, 653–684 (1977)
Glover, F., Hersh, G., McMillan, C.: Selecting subsets of maximum diversity, MS/IS Report No. 77-9, University of Colorado at Boulder (1977)
Glover, F., Kuo, C.-C., Dhir, K.S.: Integer programming and heuristic approaches to the minimum diversity problem. J. of Bus. and Management 4, 93–111 (1996)
Kochenberger, G., Glover, F.: Diversity data mining. Working Paper. The University of Mississipi (1999)
Resende, M.G.C., Ribeiro, C.C.: GRASP with path-relinking: Recent advances and applications. In: Ibaraki, T., Nonobe, K., Yagiura, M. (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. on Computing 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: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004, vol. 3059, pp. 498–512. Springer, Heidelberg (2004)
Weitz, R., Lakshminarayanan, S.: An empirical comparison of heuristic methods for creating maximally diverse groups. J. of the Op. Res. Soc. 49, 635–646 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Andrade, M.R.Q., de Andrade, P.M.F., Martins, S.L., Plastino, A. (2005). GRASP with Path-Relinking for the Maximum Diversity Problem. In: Nikoletseas, S.E. (eds) Experimental and Efficient Algorithms. WEA 2005. Lecture Notes in Computer Science, vol 3503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427186_48
Download citation
DOI: https://doi.org/10.1007/11427186_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25920-6
Online ISBN: 978-3-540-32078-4
eBook Packages: Computer ScienceComputer Science (R0)