GRASP with Path-Relinking for the Maximum Diversity Problem
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.
KeywordsLocal Search Subset Size Restricted Candidate List Adaptive Search Procedure Grasp Algorithm
Unable to display preview. Download preview PDF.
- 2.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)Google Scholar
- 6.Glover, F., Hersh, G., McMillan, C.: Selecting subsets of maximum diversity, MS/IS Report No. 77-9, University of Colorado at Boulder (1977)Google Scholar
- 7.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)Google Scholar
- 8.Kochenberger, G., Glover, F.: Diversity data mining. Working Paper. The University of Mississipi (1999)Google Scholar
- 9.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)Google Scholar