An annotated bibliography of GRASP. II: Applications.

*(English)*Zbl 1168.90582Summary: 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 second of two papers with an annotated bibliography of the GRASP literature from 1989 to 2008. In the companion paper, algorithmic aspects of GRASP are surveyed. In this paper, 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.

For the first part, cf. Int. Trans. Oper. Res. 16, No. 1, 1–24 (2009; Zbl 1153.90553).

For the first part, cf. Int. Trans. Oper. Res. 16, No. 1, 1–24 (2009; Zbl 1153.90553).

##### MSC:

90C27 | Combinatorial optimization |