An annotated bibliography of GRASP, Part I: Algorithms

P. Festa and M.G.C. Resende 

International Transactions in Operational Research,  vol. 16, pp. 1-24, 2009.

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 is the first of two papers with an annotated bibliography of the GRASP literature fro  1989 to 2008. This paper covers algorithmic aspects of GRASP.

PDF file of full paper

Go back

Mauricio G.C. Resende's Home Page

Last modified: 28 January 2009

Copyright Notice