×

zbMATH — the first resource for mathematics

An annotated bibliography of GRASP. I. Algorithms. (English) Zbl 1153.90553
Summary: 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 from 1989 to 2008. This paper covers algorithmic aspects of GRASP.

MSC:
90C35 Programming involving graphs or networks
90-00 General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming
Software:
GRASP
PDF BibTeX XML Cite
Full Text: DOI