2011•Wiley Encyclopedia of Operations Research and Management ScienceRequires access

Grasp: Greedy Randomized Adaptive Search Procedures

Maurício G. C. Resende, Ricardo M. A. Silva

Abstract

Abstract GRASP or greedy randomized adaptive search procedure, is a multistart metaheuristic that repeatedly applies local search starting from solutions constructed by a randomized greedy algorithm. In this article we review the basic building blocks of GRASP. We cover solution construction schemes, local search methods, and the use of path‐relinking as a memory mechanism in GRASP.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 42 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: GRASP, Greedy randomized adaptive search procedure, Metaheuristic, Computer science, Greedy algorithm, Mathematical optimization, Path (computing), Cover (algebra)