Skip to search formSkip to main contentSkip to account menu

Greedy randomized adaptive search procedure

Known as: Grasp (disambiguation) 
The greedy randomized adaptive search procedure (also known as GRASP) is a metaheuristic algorithm commonly applied to combinatorial optimization… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations

Broader (1)

Combinatorial optimization
Constructive cooperative coevolutionCooperative coevolutionGreedy algorithmList of algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Phase Balancing in Distribution Systems Using Greedy Randomized Adaptive Search Procedure (GRASP)
In distribution networks, the phase unbalancing is one of the major problems for electric utilities, since this can cause heavy… 
2016
2016
Efficient Greedy Randomized Adaptive Search Procedure for the Generalized Regenerator Location Problem
AbstractOver the years, there has been an evolution in the manner in which we perform traditional tasks. Nowadays, almost every… 
2014
2014
A Metaheuristic Scheduler for Time Division Multiplexed Networks-on-Chip
This paper presents a metaheuristic scheduler for inter-processor communication in multi-processor platforms using time division… 
2010
2010
Application of Greedy Randomized Adaptive Search Procedure to the Biclustering of Gene Expression Data
technology demands the development of data mining algorithms for extracting useful and novel patterns. A bicluster of a gene… 
2010
2010
Multiple satellites united imaging scheduling based on greedy randomized adaptive search procedure
Earth observing satellite(EOS) imaging scheduling is characterized by multiple complex constraints including power,thermal,data… 
2010
2010
Greedy Randomized Adaptive Search Procedure (GRASP), uma alternativa valiosa na minimização da tardança total ponderada em uma máquina
A GRASP algorithm was implemented in a common spreadsheet for single machine scheduling total weighted tardiness problem, and was… 
2009
2009
Assembly Workshops Scheduling Optimization Based on Advanced Greedy Randomized Adaptive Search Procedure
The greedy randomized adaptive search procedure(GRASP)is a new metaheuristic for combinatorial optimization with few applications… 
2006
2006
Application of Greedy Randomized Adaptive Search Procedure in Transmission Network Planning
Greedy randomized adaptive search procedure(GRASP) is a high-efficient heuristic randomly iterative algorithm,which can… 
2000
2000
A Greedy Randomized Adaptive Search Procedure to the Clustering Problem
The aim of this paper is to present a new proposal for Cluster Analysis based on a Greedy Randomized Adaptive Search Procedure… 
Highly Cited
1991
Highly Cited
1991
A GRASPTM for a difficult single machine scheduling problem,
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)