Parallel Greedy Randomized Adaptive Search Procedures

A GRASP (Greedy Randomized Adaptive Search Procedure) is a metaheuristic for producing good-quality solutions of combinatorial optimization problems. It is usually implemented with a construction procedure based on a greedy randomized algorithm followed by local search. In this Chapter, we survey parallel implementations of GRASP. We describe simple strategies to implement independent parallel GRASP heuristics and more complex cooperative schemes using a pool of elite solutions to intensify the search process. Some applications of independent and cooperative parallelizations are presented in detail.


AT&T Labs Research Technical Report TD-67EKXH. December 6, 2004.



View Parallel Greedy Randomized Adaptive Search Procedures