= Greedy randomized adaptive search procedure
{wiki=Greedy_randomized_adaptive_search_procedure}
The Greedy Randomized Adaptive Search Procedure (GRASP) is a metaheuristic optimization algorithm designed to solve combinatorial and discrete optimization problems. It involves two main phases: construction and local search, repeated iteratively until a stopping criterion is met. Here's a more detailed breakdown of its components: \#\#\# 1. **Construction Phase:** During the construction phase, a feasible solution is built incrementally.
Back to article page
