Effective Application of GRASP
Published Online: 14 JAN 2011
Copyright © 2010 John Wiley & Sons, Inc. All rights reserved.
Wiley Encyclopedia of Operations Research and Management Science
How to Cite
Festa, P. and Resende, M. G. C. 2011. Effective Application of GRASP. Wiley Encyclopedia of Operations Research and Management Science. .
- Published Online: 14 JAN 2011
A greedy randomized adaptive search procedure (GRASP) is an iterative multistart metaheuristic for difficult combinatorial optimization. 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, GRASP has been applied to a wide range of combinatorial optimization problems, ranging from scheduling and routing to drawing.
In this article, we cover the literature where GRASP is applied to scheduling, routing, logic, partitioning, location, graph theory, assignment, manufacturing, transportation, telecommunications, biology and related fields, automatic drawing, power systems, and VLSI design.
- local search