Efficient parallel cooperative implementations of GRASP heuristics

Parallel Computing

Volumn 33, Issue 1, 2007, Pages 21-35

  Ribeiro, Celso C ^a   Rosseti, Isabel ^a  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

Combinatorial optimization; GRASP; Heuristics; Metaheuristics; Network design; Parallel GRASP; Parallel implementation; Parallelization

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTER NETWORKS; HEURISTIC METHODS; LINEAR SYSTEMS; NUMERICAL METHODS; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION; METAHEURISTICS; NETWORK DESIGN; PARALLEL GRASP; PARALLEL IMPLEMENTATION; PARALLELIZATION;

PARALLEL PROCESSING SYSTEMS;

EID: 33847102744     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2006.11.007     Document Type: Article

References (21)

1. Aiex R.M., Resende M.G.C., Pardalos P.M., and Toraldo G. GRASP with path-relinking for the three-index assignment problem. INFORMS Journal on Computing 17 (2005) 224-247
2. Aiex R.M., Resende M.G.C., and Ribeiro C.C. Probability distribution of solution time in GRASP: an experimental investigation. Journal of Heuristics 8 (2002) 343-373
3. Alba E. Parallel Metaheuristics: A New Class of Algorithms (2005), Wiley, New York
4. Battiti R., and Tecchiolli G. Parallel biased search for combinatorial optimization: genetic algorithms and tabu. Microprocessors and Microsystems 16 (1992) 351-367
5. Cung V.-D., Martins S.L., Ribeiro C.C., and Roucairol C. Strategies for the parallel implementation of metaheuristics. In: Ribeiro C.C., and Hansen P. (Eds). Essays and Surveys in Metaheuristics (2002), Kluwer Academic Publishers, Dordrecht 263-308
6. Dahl G., and Johannessen B. The 2-path network problem. Networks 43 (2004) 190-199
7. Dodd N. Slow annealing versus multiple fast annealing runs: an empirical investigation. Parallel Computing 16 (1990) 269-272
8. Feo T.A., and Resende M.G.C. Greedy randomized adaptive search procedures. Journal of Global Optimization 6 (1995) 109-133
9. Festa P., Pardalos P.M., Resende M.G.C., and Ribeiro C.C. Randomized heuristics for the max-cut problem. Optimization Methods and Software 7 (2002) 1033-1058
10. Festa P., and Resende M.G.C. GRASP: an annotated bibliography. In: Ribeiro C.C., and Hansen P. (Eds). Essays and Surveys in Metaheuristics (2002), Kluwer Academic Publishers, Dordrecht 325-367
11. Glover F., Laguna M., and Martí R. Scatter search and path relinking: advances and applications. In: Glover F., and Kochenberger G. (Eds). Handbook of Metaheuristics (2003), Kluwer Academic Publishers, Dordrecht 1-35
12. Glover F. Tabu search and adaptive memory programing - 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
13. Glover F. Multi-start and strategic oscillation methods - principles to exploit adaptive memory. In: Laguna M., and Gonzáles-Velarde J.L. (Eds). Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research (2000), Kluwer Academic Publishers, Dordrecht 1-24
14. Osborne L., and Gillett B. A comparison of two simulated annealing algorithms applied to the directed Steiner problem on networks. ORSA Journal on Computing 3 (1991) 213-225
15. Resende M.G.C., and Ribeiro C.C. A GRASP with path-relinking for private virtual circuit routing. Networks 41 (2003) 104-114
16. 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-249
17. Resende M.G.C., and Ribeiro C.C. GRASP with path-relinking: recent advances and applications. In: Ibaraki T., Nonobe K., and Yagiura M. (Eds). Metaheuristics: Progress as Real Problem Solvers (2005), Springer, Berlin 29-63
18. 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
19. Souza M.C., Duhamel C., and Ribeiro C.C. A GRASP with path-relinking heuristic for the capacitated minimum spanning tree problem. In: Resende M.G.C., and Souza J. (Eds). Metaheuristics: Computer Decision Making (2003), Kluwer Academic Publishers, Dordrecht 627-658
20. Taillard E.D. Robust taboo search for the quadratic assignment problem. Parallel Computing 17 (1991) 443-455
21. Verhoeven M.G.A., and Aarts E.H.L. Parallel local search. Journal of Heuristics 1 (1995) 43-66