@techreport{TD:100124,
	att_abstract={{The generalized quadratic assignment problem (GQAP) is a generalization
of the NP-hard quadratic assignment problem (QAP) that allows multiple
facilities to be assigned to a single location as long as the capacity
of the location allows.  The GQAP has numerous applications, including
facility design, scheduling, and network design.  In this paper, we
propose several GRASP with path-relinking heuristics for the GQAP using
different construction, local search, and path-relinking procedures.
We introduce a novel approximate local search scheme, as well as a new
variant of path-relinking that deals with infeasibilities.  Extensive
experiments on a large set of test instances show that the best of the
proposed variants is both effective and efficient.
}},
	att_authors={mr5626},
	att_categories={C_CCF.1, C_CCF.2, C_CCF.7, C_CCF.8},
	att_copyright={{Springer}},
	att_copyright_notice={{The definitive version was published in Journal of Heuristics. {{, Volume 17}}{{, Issue 5}}{{, 2011-10-01}}}},
	att_donotupload={},
	att_private={false},
	att_projects={},
	att_tags={Generalized quadratic assignment problem,  heuristic,  GRASP,  path-relinking,  experimental algorithm},
	att_techdoc={true},
	att_techdoc_key={TD:100124},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:100124_DS1_2010-07-21T20:20:41.416Z.pdf},
	author={Mauricio Resende and Geraldo R. Mateus and Ricardo M. A. Silva},
	institution={{Journal of Heuristics}},
	month={October},
	title={{GRASP with path-relinking for the generalized quadratic assignment problem}},
	year=2011,
}