Grasp: Greedy Randomized Adaptive Search Procedures
Maurício G. C. Resende, Ricardo M. A. Silva · Wiley Encyclopedia of Operations Research and Management Science · 2011
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.