The greedy randomized adaptive search procedure (also known as GRASP) is a metaheuristic algorithm commonly applied to combinatorial optimization problems. GRASP typically consists of iterations made up from successive constructions of a greedy randomized solution and subsequent iterative improvements of it through a local search.[1] The greedy randomized solutions are generated by adding elements to the problem's solution set from a list of elements ranked by a greedy function according to the quality of the solution they will achieve. To obtain variability in the candidate set of greedy solutions, well-ranked candidate elements are often placed in a restricted candidate list (RCL), and chosen at random when building up the solution. This kind of greedy randomized construction method is also known as a semi-greedy heuristic, first described in Hart and Shogan (1987).[2]
GRASP was first introduced in Feo and Resende (1989).[3] Survey papers on GRASP include Feo and Resende (1995),[1] and Resende and Ribeiro (2003).[4]
There are variations of the classical algorithm, such as the Reactive GRASP. In this variation, the basic parameter that defines the restrictiveness of the RCL during the construction phase is self-adjusted according to the quality of the solutions previously found.[5] There are also techniques for search speed-up, such as cost perturbations, bias functions, memorization and learning, and local search on partially constructed solutions.[4]
YouTube Encyclopedic
-
1/2Views:1 259608
-
metaheuristica grasp 2
-
fase De Búsqueda GRASP
Transcription
See also
- Constructive cooperative coevolution
- Cooperative coevolution
- Local search (optimization)
- Metaheuristic
- Simulated annealing
- Tabu search
References
- ^ a b Feo, Thomas A.; Resende, Mauricio G. C. (1995). "Greedy Randomized Adaptive Search Procedures". Journal of Global Optimization. 6 (2): 109–133. doi:10.1007/BF01096763. S2CID 2110014.
- ^ Hart, J. P.; Shogan, A. W. (July 1987). "Semi-greedy heuristics: An empirical study". Operations Research Letters. 6 (3): 107–114. doi:10.1016/0167-6377(87)90021-6.
- ^ Feo, Thomas A.; Resende, Mauricio G. C. (April 1989). "A probabilistic heuristic for a computationally difficult set covering problem". Operations Research Letters. 8 (2): 67–71. doi:10.1016/0167-6377(89)90002-3.
- ^ a b Resende, Mauricio G. C.; Ribeiro, Celso C. (2003). "Greedy Randomized Adaptive Search Procedures". Handbook of Metaheuristics. Springer. pp. 219–249. ISBN 978-0-306-48056-0.
- ^ Prais, Marcelo; Ribeiro, Celso C. (2000). "Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment". INFORMS Journal on Computing. 12 (3): 164–176. doi:10.1287/ijoc.12.3.164.12639.
 | This combinatorics-related article is a stub. You can help Wikipedia by expanding it. |
This page was last edited on 11 August 2023, at 07:35