GRASP with Path-relinking for the maximum diversity problem

Lecture Notes in Computer Science

Volumn 3503, Issue , 2005, Pages 558-569

  De Andrade, Maxcos R Q ^a   De Andrade, Paulo M F ^a   Martins, Simone L ^a   Plastino, Alexandre ^a  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; HEURISTIC METHODS; SET THEORY;

COMPUTATIONAL TIME; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE (GRASP); MAXIMUM DIVERSITY PROBLEMS; PATH-RELINKING;

PROBLEM SOLVING;

EID: 24944557915     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11427186_48     Document Type: Conference Paper

References (12)

1. Aiex, R. M., Resende, M. G. G., Ribeiro, C. C.: Probability distribution of solution time in GRASP: An experimental investigation, J. of Heuristics 8 (2002), 343-373.
2. Andrade, P. M. F., Plastino, A., Ochi, L. S., Martins, S. L.: GRASP for the Maximum Diversity Problem, Procs. of MIC 2003, CD-ROM Paper: MIC03_15, (2003).
3. Feo, T. A., Resende, M. G. C.: Greedy randomized adaptive search procedures, J. of Global Optimization 6 (1995), 109-133.
4. Ghosh, J. B.: Computational aspects of the maximum diversity problem, Operations Research Letters 19 (1996), 175-181.
5. Glover, F., Laguna, M., Marti, R.: Fundamentals of scatter search and path-relinking, Control and Cybernetics 19 (1977), 653-684.
6. Glover, F., Hersh, G., McMillan, C.: Selecting subsets of maximum diversity, MS/IS Report No. 77-9, University of Colorado at Boulder, (1977).
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, (1996), 93-111.
8. Kochenberger, G., Glover, F.: Diversity data mining, Working Paper, The University of Mississipi, (1999).
9. Resende, M. G. C., Ribeiro, C. C.: GRASP with path-relinking: Recent advances and applications, Metaheuristics: Progress as Real Problem Solvers (T. Ibaraki, K. Nonobe, and M. Yagiura, editors), (2005), 29-63.
10. Ribeiro, C. C., Uchoa, E., Werneck, R. F.: A hybrid GRASP with perturbations for the Steiner problem in graphs, INFORMS J. on Computing 14 (2002), 228-246.
11. Silva, G. C., Ochi, L. S., Martins, S. L.: Experimental comparison of greedy randomized adaptive search procedures for the maximum diversity problem, Lecture Notes on Computer Science 3059 (2004), 498-512.
12. Weitz, R., Lakshminarayanan, S.: An empirical comparison of heuristic methods for creating maximally diverse groups, J. of the Op. Res. Soc. 49 (1998), 635-646.