In Wiley Encyclopedia of Operations Research and Management Sciences, J.J. Cochran, L.A. Cox, Jr., P. Keskinocak, J.P. Kharoufeh, and J.C. Smith (Eds.), vol. 3, pp. 2118-2128, Wiley, 2011.
ABSTRACTGRASP, 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 chapter we review the basic building blocks of GRASP. We cover solution construction schemes, local search methods, and hybridization with path-relinking.
PDF file of full paper
Mauricio G.C. Resende's Home PageLast modified: 12 February 2011