Abstract
One of the most studied methods to get approximate solutions in optimization problems are the heuristics methods. Heuristics are usually employed to find good, but not necessarily optima solutions. The primary purpose of the chapter at hand is to provide a survey of the Greedy Randomized Adaptive Search Procedures (GRASP). GRASP is an iterative multi-start metaheuristic for solving complex optimization problems. Each GRASP iteration consists of a construction phase followed by a local search procedure. In this paper, we first describe the basic components of GRASP and the various elements that compose it. We present different variations of the basic GRASP in order to improve its performance. The GRASP has encompassed a wide range of applications, covering different fields because of its robustness and easy to apply.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
