Metaheuristic hybridization with GRASP

GRASP or greedy randomized adaptive search procedure is a multi-start metaheuristic that repeatedly applies local search starting from solutions constructed by a randomized greedy algorithm. In this paper we consider ways to hybridize GRASP to create new and more effective metaheuristics. We consider several types of hybridizations: constructive procedures, enhanced local search, memory structures, and cost reformulations.


AT&T Labs Research Technical Report, AT&T Labs Research, Florham Park, NJ, April 14, 2008.



View Metaheuristic hybridization with GRASP