Journal
TELECOMMUNICATION SYSTEMS
Volume 46, Issue 3, Pages 253-271Publisher
SPRINGER
DOI: 10.1007/s11235-010-9289-z
Keywords
GRASP; Path-relinking; Metaheuristics; Hybrid metaheuristics
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available