@techreport{TD:100711,
	att_abstract={{A greedy randomized adaptive search procedure (GRASP) is a metaheuristic
for combinatorial optimization. GRASP heuristics are multistart procedures
which apply local search to a set of starting solutions generated with
a randomized greedy algorithm or semi-greedy method.  The best local
optimum found over the iterations is returned as the heuristic solution.
Path-relinking is a search intensification procedure that explores paths
in the neighborhood solution space connecting two good-quality solutions.
A local search procedure is applied to the best solution found in the path
and the local optimum found is returned as the solution of path-relinking.
The hybridization of path-relinking and GRASP adds memory mechanisms
to GRASP.  This paper describes basic concepts of GRASP, path-relinking,
and the hybridization of GRASP with path-relinking.
}},
	att_authors={mr5626},
	att_categories={C_CCF.8, C_CCF.7, C_CCF.2, C_CCF.6},
	att_copyright={{Springer}},
	att_copyright_notice={{The definitive version was published in the book "Hybrid Metaheuristics" edited by E.G. Talbi. {{, 2012-06-30}}{{, http://rd.springer.com/chapter/10.1007%2F978-3-642-30671-6_5}}
}},
	att_donotupload={},
	att_private={false},
	att_projects={},
	att_tags={GRASP,  path-relinking,  GRASP with path-relinking,  metaheuristic,  local search,  parallel computing,  combinatorial optimization,  discrete mathematics},
	att_techdoc={true},
	att_techdoc_key={TD:100711},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:100711_DS1_2011-10-25T13:07:17.633Z.pdf},
	author={Mauricio Resende},
	institution={{This will be chapter in the book "Hybrid Metaheuristics" edited by E.G. Talbi and to be publ}},
	month={June},
	title={{Hybridizations of GRASP with path-relinking}},
	year=2012,
}