Greedy randomized adaptive search procedure
id:
greedy-randomized-adaptive-search-procedure-283-8615323
title:
Greedy randomized adaptive search procedure
text:
The greedy randomized adaptive search procedure 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. 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 t
brand slug:
wiki
category slug:
encyclopedia
description:
Metaheuristic commonly used for optimization problems
original url:
https://en.wikipedia.org/wiki/Greedy_randomized_adaptive_search_procedure
date created:
date modified:
2023-08-11T07:35:33Z
main entity:
{"identifier":"Q3116070","url":"https://www.wikidata.org/entity/Q3116070"}
image:
fields total:
13
integrity:
14