GRASP: An annotated bibliography

P. Festa and M.G.C. Resende 

In Essays and Surveys on Metaheuristics,  C.C. Ribeiro and P. Hansen, eds., Kluwer Academic Publishers, pp. 325-367, 2002.

ABSTRACT

A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization.  It is a multi-start or iterative process, in which each {GRASP} iteration consists of two phases, a construction phase, in which a feasible solution is produced, and a local search phase, in which a local optimum in the neighborhood of the constructed solution is sought.  Since 1989, numerous papers on the basic aspects of GRASP, as well as enhancements to the basic metaheuristic have appeared in the literature.  GRASP has been applied to a wide range of combinatorial optimization problems, ranging from scheduling and routing to drawing and turbine balancing.  This paper is an annotated bibliography of the GRASP literature from 1989 to 1999.

PDF file of full paper

Go back

Mauricio G.C. Resende's Home Page

Last modified: 27 January 2000

Copyright Notice