GRASP and path relinking for the max-min diversity problem

Computers and Operations Research

Volumn 37, Issue 3, 2010, Pages 498-508

  Resende, M G C ^a   Marti R ^b   Gallego, M ^c   Duarte, A ^c  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF VALENCIA   (Spain)

^c UNIVERSIDAD REY JUAN CARLOS   (Spain)

Author keywords

Adaptive memory programming; GRASP; Max min diversity problem; Metaheuristics; Path relinking

Indexed keywords

ADAPTIVE MEMORY PROGRAMMING; GRASP; MAX-MIN DIVERSITY PROBLEM; METAHEURISTICS; PATH RELINKING;

BIOLOGY; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; INTEGER PROGRAMMING; TABU SEARCH;

SIMULATED ANNEALING;

EID: 70349286817     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.05.011     Document Type: Article

References (24)

1. Kuo C.C., Glover F., and Dhir K.S. Analyzing and modeling the maximum diversity problem by zero-one programming. Decision Sciences 24 (1993) 1171-1185
2. Glover F., Kuo C.C., and Dhir K.S. Heuristic algorithms for the maximum diversity problem. Journal of Information and Optimization Sciences 19 (1998) 109-132
3. G.C. Silva, L.S. Ochi, S.L. Martins, Experimental comparison of greedy randomized adaptive search procedures for the maximum diversity problem. In: Lecture Notes in Computer Science, vol. 3059; 2004. p. 498-512.
4. Duarte A., and Martí R. Tabu Search and GRASP for the maximum diversity problem. European Journal of Operational Research 178 (2007) 71-84
5. Erkut E. The discrete p-dispersion problem. European Journal of Operational Research 46 (1990) 48-60
6. Kincaid R.K. Good solutions to discrete noxious location problems via metaheuristics. Annals of Operations Research 40 (1992) 265-281
7. Ghosh J.B. Computational aspects of the maximum diversity problem. Operations Research Letters 19 (1996) 175-181
8. Chandrasekaran R., and Daughety A. Location on tree networks: p-centre and n-dispersion problems. Mathematics of Operations Research 6 (1981) 50-57
9. Kuby M.J. Programming models for facility dispersion: the p-dispersion and maximum dispersion problems. Geographical Analysis 19 (1987) 315-329
10. Lundi M., and Mess A. Convergence of an annealing algorithm. Mathematical Programming 34 (1986) 111-124
11. Feo T.A., and Resende M.G.C. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8 (1989) 67-71
12. Feo T.A., and Resende M.G.C. Greedy randomized adaptive search procedures. Journal of Global Optimization 6 (1995) 109-133
13. Feo T.A., Resende M.G.C., and Smith S.H. A greedy randomized adaptive search procedure for maximum independent set. Operations Research 42 (1994) 860-878
14. Resende M.G.C., and Ribeiro C.C. Greedy randomized adaptive search procedures. In: Glover F., and Kochenberger G. (Eds). Handbook of metaheuristics (2003), Kluwer Academic Publishers, Dordrecht 219-250
15. Resende M.G.C., and Werneck R.F. A hybrid heuristic for the p-median problem. Journal of Heuristics 10 (2004) 59-88
16. Prais M., and Ribeiro C.C. Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing 12 (2000) 164-176
17. Glover F. Tabu search and adaptive memory programming-advances, applications, and challenges. In: Barr R.S., Helgason R.V., and Kennington J.L. (Eds). Interfaces in computer science and operations research (1996), Kluwer Academic Publishers, Dordrecht 1-75
18. Glover F., and Laguna M. Tabu search (1997), Kluwer Academic Publishers, Dordrecht
19. Laguna M., and Martí R. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing 11 (1999) 44-52
20. Faria Jr. H., Binato S., Resende M.G.C., and Falcão D.J. Transmission network design by a greedy randomized adaptive path relinking approach. IEEE Transactions on Power Systems 20 (2005) 43-49
21. Andrade DV, Resende MGC. GRASP with evolutionary path-relinking. In: Proceedings of the seventh metaheuristics international conference (MIC 2007); 2007.
22. Martí R., Laguna M., and Glover F. Principles of scatter search. European Journal of Operational Research 169 (2006) 359-372
23. Ribeiro C.C., Uchoa E., and Werneck R.F. A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing 14 (2002) 228-246
24. Laguna M., and Martí R. Scatter search: methodology and implementations in C (2003), Kluwer Academic Publishers, Dordrecht