Metaheuristic hybridization with GRASP

Mauricio G.C. Resende

To appear in TutORials in Operations Research, Zhi-Long Chen and S. Raghavan (Eds.), INFORMS, 2008


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.

PDF file of full paper
Go back
Mauricio G.C. Resende's Home Page
Last modified: 12 June 2008

Copyright Notice