Optimization Online


GRASP: An annotated bibliography

P. Festa (paofes***at***unisa.it)
M. G. C. Resende (mgcr***at***research.att.com)

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 2001.

Keywords: GRASP, metaheuristics, bibliography

Category 1: Combinatorial Optimization (Meta Heuristics )

Citation: In "Essays and Surveys in Metaheuristics," Celso C. Ribeiro and Pierre Hansen (eds.), Kluwer Academic Publishers, pp. 325-367, 2002.

Download: [PDF]

Entry Submitted: 01/19/2001
Entry Accepted: 01/19/2001
Entry Last Modified: 11/13/2002

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society