Abstract. Today, a variety of heuristic approaches are available to the operations research practitioner. One methodology that has a strong intuitive appeal, a prominent empirical track record, and is trivial to efficiently implement on parallel processors is GRASP (Greedy Randomized Adaptive Search Procedures). GRASP is an iterative randomized sampling technique in which each iteration provides a solution to the problem at hand. The incumbent solution over all GRASP iterations is kept as the final result. There are two phases within each GRASP iteration: the first intelligently constructs an initial solution via an adaptive randomized greedy function; the second applies a local search procedure to the constructed solution in hope of finding an improvement. In this paper, we define the various components comprising a GRASP and demonstrate, step by step, how to develop such heuristics for combinatorial optimization problems. Intuitive justifications for the observed empirical behavior of the methodology are discussed. The paper concludes with a brief literature review of GRASP implementations and mentions two industrial applications.

. A greedy randomized adaptive search procedure (Grasp) is a randomized heuristic that has been shown to quickly produce good quality solutions for a wide variety of combinatorial optimization problems. In this paper, we describe a Grasp for the satisfiability (SAT) problem. This algorithm can be also directly applied to both the weighted and unweighted versions of the maximum satisfiability (MAX-SAT) problem. We review basic concepts of Grasp: construction and local search algorithms. The implementation of Grasp for the SAT problem is described in detail. Computational experience on a large set of test problems is presented. Key words. Combinatorial optimization, logic, satisfiability, artificial intelligence, local search, Grasp, computer implementation AMS(MOS) subject classifications. 90B80, 90C20, 90C35, 90C27, 65H20, 65K05 1. Introduction. Let x be a Boolean variable, i.e. a variable that takes on only the values true or false, and let a literal be a variable x or its negation...

In this work we discuss production planning in electronics assembly---and, in particular, in PCB assembly. Our intention is to identify the typical problems arising from production planning and to give a survey of the solution methods suggested in the literature. In addition to this theoretical perspective, we will briefly review applications designed for production planning in PCB assembly.

This document contains references related to GRASP (greedy randomized adaptive search procedure) that have either appeared in the literature or as technical reports. If you are aware of any uncited reference, incorrectly cited reference, or update to a cited reference, please contact Mauricio G. C. Resende at the address given at the end of this document.

Abstract. GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration is usually made up of a construction phase, where a feasible solution is constructed, and a local search phase which starts at the constructed solution and applies iterative improvement until a locally optimal solution is found. While, in general, the construction phase of GRASP is a randomized greedy algorithm, other types of construction procedures have been proposed. Repeated applications of a construction procedure yields diverse starting solutions for the local search. This chapter gives an overview of GRASP describing its basic components and enhancements to the basic procedure, including reactive GRASP and intensification strategies. 1.

Abstract not found