Paper Info
Title
GRASP: basic components and enhancements
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 paper gives an overview of GRASP describing its basic components and enhancements to the basic procedure, including reactive GRASP and intensification strategies.
Year
DOI
Venue
2011
10.1007/s11235-010-9289-z
Telecommunications Systems
Keywords
Field
DocType
GRASP,Path-relinking,Metaheuristics,Hybrid metaheuristics
Mathematical optimization,GRASP,Combinatorial optimization problem,Computer science,Greedy algorithm,Local search (optimization),Greedy randomized adaptive search procedure,Metaheuristic
Journal
Volume
Issue
ISSN
46
3
1018-4864
Citations 
PageRank 
References 
31
1.32
89
Authors
2
Name
Order
Citations
PageRank
Paola Festa128725.32
Mauricio G. C. Resende23729336.98