@Article{AhuOrlTiw00a,
	author = "R.K. Ahuja and J.B. Orlin and A. Tiwari",
	title = "A greedy genetic algorithm for the quadratic
		assignment problem",
	journal = "Computers and Operations Research",
	volume = "27",
	pages = "917--934",
	year = "2000",
        annote   =     "This report suggests a genetic algorithm
                	for the QAP that incorporates the construction phase of the
                	{GRASP} for QAP of Li, Pardalos, and Resende (1994)
                	to generate the initial population.",
}

@phdthesis{Aie02a,
        author = "R.M. Aiex",
        title = "Uma investiga\c{c}\~ao experimental da distribui\c{c}\~ao
		 de probabilidade de tempo de solu\c{c}\~ao em heur\'{\i}sticas
		 {GRASP} e sua aplica\c{c}\~ao na an\'alise de
		 implementa\c{c}\~oes paralelas",
	school = "Department of Computer Science, Catholic University of
		  Rio de Janeiro",
        address = "Rio de Janeiro, Brazil",
        year = "2002",
	annote	= "This thesis describes a new methodology
		   for the analysis of {GRASP}.  Hybrid strategies
		   with path-relinking are also proposed.  These
		   are studied on the 3-index assignment problem
		   as well as the job shop scheduling problem and
		   analyzed with the proposed methodology to predict
		   qualitatively how the quality of the solution
		   varies in a parallel independent {GRASP}.",
}

@techreport{AieResParTor00a,
	 author = "R.M. Aiex and M.G.C. Resende and P.M. Pardalos
		   and G. Toraldo",
	 title  = "{GRASP} with path relinking for the three-index assignment
		   problem",
        institution = "AT\&T Labs Research",
        address = "Florham Park, NJ 07733",
	year = "2000",
	note = {To appear in {\em INFORMS J. on Computing}.},
	annote =	"This paper describes variants of {GRASP}
            		with path relinking for the
            		three index assignment problem (AP3).  Computational
            		results show clearly that this {GRASP} for AP3 benefits from
            		path relinking and that the variants considered in this
            		paper compare well with previously proposed heuristics
            		for this problem.  The authors also show that the random
            		variable time to target solution, for all proposed
            		{GRASP} with path relinking variants, fits a two-parameter
            		exponential distribution.  To illustrate the consequence
            		of this, one of the variants of {GRASP} with path relinking
            		is shown to benefit from parallelization."
}

@Article{Bar97a,
	author = "J.F. Bard",
	title = "An analysis of a rail car unloading area for a consumer
	         products manufacturer",
	journal = "Journal of the Operational Research Society",
        volume = "48",
        pages = "873--883",
	year = "1997",
        annote   =     "This paper discusses how to design and analyze the 
			railcar unloading area of Procter \& Gamble's 
			principal laundry detergent plant. 
			The related combinatorial problem of
                	assigning railcars to positions on the platform and 
			unloading equipment to railcars is modeled as a 
			mixed-integer nonlinear program. 
			To approximately solve the problem, four
                	alternatives are proposed and evaluated with the help 
			of a {GRASP}.",
}

@techreport{CooKwoGloSchTayWit02a,
        author = "B.P. Cooke and D. Kwon and D. Glotov and
                  S. Schurr and D. Taylor and T. Wittman",
        title = "Mobility management in cellular telephony",
        institution = "Institute of Mathematics and its Applications,
                       University of Minnesota, USA",
        year = "2002",
	annote = "This paper deals with the problem of minimizing 
		the cost of transferring calls from transceiver to 
		transceiver and from controller to controller. 
		Four different algorithms are proposed in this paper 
		for solving the problem: a branch-and-bound, 
		a metropolis algorithm with annealing, a 
		genetic algorithm, and a greedy search. 
		The last one has been derived from a {GRASP} 
		proposed for the quadratic assignment problem."
}

@Article{FeoGon95a,
        author = "T.A. Feo and J.L Gonz\'alez-Velarde",
        title = "The intermodal trailer assignment problem: {M}odels,
                 algorithms, and heuristics",
	journal = "Transportation Science",
	volume = "29",
        pages = "330--341",
	year = "1995",
        annote   =     "This paper deals with the problem of optimally
                	assigning highway trailers to railcar hitches
                	in intermodal transportation. Using a set covering
                	formulation, the problem is modeled as an integer 
			linear program, whose linear programming relaxation 
			yields a tight lower bound. 
			This formulation also provides the basis for 
			developing a branch-and-bound algorithm and a {GRASP} 
			for solving the problem. 
			The greedy strategy of the construction phase of 
			{GRASP} consists in selecting at each step a feasible 
			assignment of the most difficult to use available 
			railcar together with the most difficult to assign 
			trailer.
                	To improve the constructed solution, a $2$-exchange
                	local search is applied, carrying out a
                	complete enumeration of the solutions in the
                	neighborhood.",
}

@Article{JinGalHab00a,
        author = {H. Jin-Kao and P. Galinier and M. Habib},
	title = {M\'etaheuristiques pour l'optimisation combinatoire 
	         et l'affectation sous contraintes},
        journal = {Revue d'Intelligence Artificielle},
	volume = {13},
	number = {2},
	pages = {283--324},
	annote = {Scope of this paper is to highlight main properties 
		of existing metaheuristics in order to help researchers 
		in choosing the most suitable one in practice. 
		One of the metaheuristic addressed is {GRASP}. In French.},
	year = {2000}
}

@incollection{LiParRes94a,
	author = "Y. Li and P.M. Pardalos and M.G.C. Resende",
	title = "A Greedy Randomized Adaptive Search Procedure for
		 the Quadratic Assignment Problem",
	booktitle = "Quadratic assignment and related problems",
	editor = "P.M. Pardalos and H. Wolkowicz",
        series = "{DIMACS} Series on Discrete Mathematics and Theoretical
                  Computer Science",
	publisher = "American Mathematical Society",
	volume = "16",
	pages = "237--261",
	year = "1994",
        annote =     	"A {GRASP} for the quadratic assignment problem is 
			described.
                	Construction first makes two assignments, and then
                	completes the solution by making assignments, one 
			at a time.
                	The greedy function is assignment interaction cost.
                	The local search procedure is a $2$ assignment 
			exchange.",
}

@incollection{LiuParRajRes00a,
	author = "X. Liu and P.M. Pardalos and S. Rajasekaran and
		  M.G.C. Resende",
        title = "A {GRASP} for frequency assignment in mobile radio networks",
        booktitle = "Mobile Networks and Computing",
        editor = "S. Rajasekaran and P.M. Pardalos and F.Hsu",
        series = "{DIMACS} Series on Discrete Mathematics and Theoretical
                   Computer Science",
        publisher = "American Mathematical Society",
        volume = "52",
        pages = "195--201",
        year = "2000",
        annote = 	"A {GRASP} for frequency assignment is described.
                	Local search uses simulated annealing.
                	The construction phase uses two greedy functions. The first
                	chooses a vertex from
                	the set of unselected vertices with high saturation degrees.
                	The second function is used to assign a frequency to the
                	selected vertex. A frequency is selected from a set of
                	permissible frequencies that contribute little additional
                	cost to the objective function."
}

@techreport{LouSer98a,
	 author = {H. R. Louren\c{c}o and D. Serra},
	 title = "Adaptive approach heuristics for the generalized
	          assignment problem",
	 institution = "Department of Economics and Business,
	                Universitat Pompeu Fabra",
         series = {Economics Working Papers},
	 number = {288},
	 address = "Barcelona, Spain",
	 year = "1998",
	 annote = "For the generalized assignment problem, the authors 
		propose several heuristics based an hybrid approaches, 
		including a {GRASP}, whose greedy choice is to prefer 
		tasks using small amounts of agent resource. 
		In the improvement phase, several local searches  
		are implemented, among them a descent 
		local search and a search based on ejection chain 
		neighborhood."
}

@Article{MavParPitRes98a,
	author = "T. Mavridou and P.M. Pardalos and L.S. Pitsoulis and
		  M.G.C. Resende",
	title = "A {GRASP} for the biquadratic assignment problem",
	journal = "European Journal of Operational Research",
	volume = "105",
        pages = "613--621",
	year = "1998",
        annote   =     "This paper proposes a {GRASP} for finding approximate 
			solutions of the biquadratic assignment problem.
                	As in the case of {GRASP} for the quadratic assignment
                	problem, the construction phase has two stages. 
			The first stage simultaneously makes
                	four assignments, selecting the pairs corresponding
                	to the smallest interaction costs, while the second 
			stage makes the remaining assignments, one at time. 
			The greedy function in the second stage selects the 
			assignment corresponding to the minimum interaction 
			cost with respect to the already-made assignments. 
			In the local search phase, $2$-exchange local search 
			is applied to the permutation constructed in the first 
			phase.",
}

@incollection{MurParPit98a,
	author = "R.A. Murphey and P.M. Pardalos and L.S. Pitsoulis",
	title = "A greedy randomized adaptive search procedure
                 for the multitarget multisensor tracking problem",
	booktitle = "Network design: {C}onnectivity and facilities
                     location",
	editor = "P.M. Pardalos and D.-Z. Du",
        series = "{DIMACS} Series on Discrete Mathematics and Theoretical
                  Computer Science",
	publisher = "American Mathematical Society",
        volume = "40",
	pages = "277--301",
	year = "1998",
        annote =     	"A {GRASP} is presented for approximately solving the 
			multitarget multisensor tracking problem, which
                	can be interpreted as a collection of multidimensional
                	assignment problems. Since the objective is to select a
                	target hypothesis and partition of the measurements
                	that is most likely to occur, a likelihood cost
                	function and partitioning constraint set are developed.
                	The {GRASP} construction phase creates the restricted
                	candidate list containing the most likely to occur
                	(lower cost) tuples. The local search explores
                	all $2$-exchange permutations."
}

@incollection{MurParPit98b,
	author = "R.A. Murphey and P.M. Pardalos and L.S. Pitsoulis",
	title = "A parallel {GRASP} for the data association multidimensional 
		assignment problem",
	booktitle = "Parallel Processing of Discrete Problems",
	editor = "P.M.  Pardalos",
	series = "The {IMA} Volumes in Mathematics and its Applications",
	publisher = "Springer-Verlag",
	volume = "106", 
	pages = "159--180", 
	year = "1998",
        annote =     	"A {GRASP} for finding good solutions for
                	the data association multidimensional assignment problem
                	is described.
                	At each discrete time interval, the data set is 
			formulated as a multidimensional assignment problem 
			(MAP) with a maximum likelihood cost function. 
			A near-optimal solution to each MAP is obtained with 
			a {GRASP}.
                	The proposed method can be easily parallelized to 
			substantially decrease the running time."
}

@inproceedings{OliParRes03a,
	author = {C.A. Oliveira and P.M. Pardalos and M.G.C. Resende},
	title = {{{GRASP} with path-relinking for the {QAP}}},
	booktitle = {{Proceedings of the Fifth Metaheuristics International
	              Conference (MIC2003)}}, 
        editor = {T. Ibaraki and Y. Yoshitomi},
	city = {Kyoto, Japan},
        pages = {57-1 -- 57-6}, 
	annote = {In this paper, a {GRASP} using path relinking as 
		intensification phase is proposed for the quadratic 
		assignment problem. 
		The {GRASP} has essentially the same implementation 
		as in Li et al. (1994).},
	year = {2003} 
}

@techreport{OliGom99a,
	author = "C.A.S. Oliveira and F.C. Gomes",
	title = "Two metaheuristics for channel allocation in mobile
		   telephony",
	institution = "Artificial Intelligence Laboratory,
			Universidade Federal do Cear\'a",
	address = "Fortaleza, Brazil",
	month = "August",
	year = "1999",
	annote =	"The frequency assignment problem
                	described consists in minimizing the total system 
			interference in mobile phone covered areas,
                	with respect to co-channel and adjacent-channel 
			interference.
                	Two metaheuristics are proposed: {GRASP} and 
			Asynchronous Team (A-Team). 
			The construction phase of the proposed {GRASP} is
                	realized by a procedure that at each step chooses the 
			next antenna to which a frequency will be assigned. 
			In the RCL construction, priority is given to 
			transmitters with fewer options of frequency 
			assignment. To implement the local search phase, 
			the authors use a down hill
                	algorithm, that performs random perturbations in the
                	solution, exchanging the frequency of one antenna by 
			another randomly chosen. 
			The stopping criterion used for the
                	down hill algorithm is execution time."
}

@incollection{ParPitRes95a,
	author = "P.M. Pardalos and L.S. Pitsoulis and M.G.C. Resende",
	title = "A parallel {GRASP} implementation for the quadratic
                 assignment problem",
	booktitle = "Parallel Algorithms for Irregularly
	             Structured Problems~-- Irregular'94",
        editor = "A. Ferreira and J. Rolim",
	publisher = "Kluwer Academic Publishers",
	year = "1995",
	pages = "115--130",
        annote =	"Efficient parallel techniques for large-scale sparse 
			quadratic assignment problems are discussed.  
			The paper provides a detailed description of a
                	parallel implementation on an MIMD computer of the 
			sequential {GRASP} proposed by Li, Pardalos, and 
			Resende (1994) for solving the QAP.
                	The {GRASP} iterations are distributed among the 
			processors.
                	Each processor is given its own input data and random 
			number sequence and are run independently.
                	A shared global variable stores the
                	value of the incumbent solution."
}

@Article{ParPitRes97a,
	author = "P.M. Pardalos and L.S. Pitsoulis and M.G.C. Resende",
	title = "Algorithm 769: {F}ortran subroutines for approximate
		 solution of
		 sparse quadratic assignment problems using {GRASP}",
	journal = "ACM Transactions on Mathematical Software",
	volume = "23",
	pages = "196--208",
	year = "1997",
        annote   =     "A version of the {GRASP}
                	for the quadratic assignment problem of Li, Pardalos,
                	and Resende (1994), tailored for sparse instances
                	is proposed.
                	A set of ANSI standard Fortran 77 subroutines are i
			described.",
}

@Article{ParRamResLi97a,
        author = "P.M. Pardalos and K.G. Ramakrishnan and M.G.C. Resende 
		and Y. Li",
        title = "Implementation of a variance reduction based lower bound 
		in a branch and bound algorithm for the quadratic 
		assignment problem", 
        journal = "SIAM Journal on Optimization",
        volume = "7",
        pages = "280--294",
        year = "1997",
        annote   =     "This paper describes a branch \& bound algorithm for
                	the quadratic assignment problem which uses a {GRASP}
                	to compute upper bounds.",
}

@techreport{Pas98a,
	 author = "E.L. Pasiliao",
	 title = "A greedy randomized adaptive search procedure
                  for the multi-criteria radio link frequency
                  assignment problem",
	 institution = "Department of ISE,
			University of Florida",
	 address = "Gainesville, FL 32611-6595",
	 year = "1998",
        annote   =      "A {GRASP} for computing approximate solutions to a 
			radio link frequency assignment problem is proposed.
                	The objective is to minimize the order and the span of 
			the solution set.
                	The local search procedure attempts to
                	eliminate each channel from the communication network.
                	This process is repeated until an attempt to eliminate
                	every frequency in the solution set has been made 
			without success."
}

@phdthesis{Pit99a,
        author = "L.S. Pitsoulis",
	title = "Algorithms for nonlinear assignment problems",
	school = "Department of Industrial and Systems Engineering,
	          University of Florida",
        city = "Gainesville",
	year = "1999",
	annote =	"This dissertation presents {GRASPs} for solving
                 	the following NP-hard nonlinear assignment problems (NAPs):
                 	quadratic assignment
                 	problem (QAP), biquadratic assignment problem (BiQAP),
                 	turbine balancing problem (TBP), and multidimensional
                 	assignment problem (MAP).
                 	Computational results indicate that all of the suggested
                 	algorithms are among the best in the literature in
                 	terms of solution quality and computational time."
}

@Article{PitParHea01a,
	author = "L.S. Pitsoulis and P.M. Pardalos and D.W. Hearn",
	title = "Approximate solutions to the turbine balancing problem",
	journal = "European J. of Operational Research",
	volume = "130",
	pages = "147--155",
	year = "2001",
        annote   =     "In this paper, the turbine balancing problem is 
			formulated as a standard quadratic assignment problem, 
			and a {GRASP} for solving the resulting problem is 
			presented.",
}

@Article{PraRib00a,
	 author = "M. Prais and C.C. Ribeiro",
	 title = "Reactive {GRASP}: {A}n application to a matrix
                  decomposition problem in {TDMA} traffic assignment",
	 journal = "INFORMS Journal on Computing",
	 volume = "12",
	 pages = "164--176",
	 year = "2000",
        annote   =     "This paper describes a {GRASP} for matrix decomposition
                	problem arising in the context of traffic assignment
                	in communication satellites. A geostationary communication
                	satellite has a number of spot beam antennas covering
                	geographically distributed areas. According to the slot
                	switching configuration on the on-board switch, the uplink
                	traffic received at the satellite has to be immediately sent
                	to ground areas through a set of transponders. The slot
                	switching configurations are determined through the solution
                	of a time slot assignment problem, which is equivalent to
                	the decomposition of a nonnegative traffic matrix into
                	the sum of a family of switching mode matrices.
			A refinement of {GRASP}, called Reactive {GRASP},
                	is proposed.
                	Instead of using a fixed value for the basic
                	parameter that defines the restrictiveness
                	of the candidate list during the construction phase,
                	Reactive {GRASP} self-adjusts the parameter value
                	according to the quality of the solutions previously found. 
			The local search phase of the {GRASP} proposed is based on
                	a new neighborhood, defined by constructive and
                	destructive moves.",
}

@Article{RanAbrBoa00a,
	author = "M.C. Rangel and N.M.M. Abreu and P.O. {Boaventura Netto}",
	title = "{GRASP} para o {PQA}: {U}m limite de aceita\c{c}\~{a}o 
		para solu\c{c}\~{o}es iniciais",
        journal = "Pesquisa Operacional",
        volume = "20",
        year = "2000",
        pages = "45--58",
        annote   =     "This paper presents a modified version of the 
			{GRASP} algorithm proposed by Li, Pardalos, and 
			Resende (1994) for the quadratic assignment problem. 
			The new {GRASP} uses a criterion to accept or 
			reject a given initial solution, thus trying to 
			avoid searches that eventually can be fruitless. 
			It computes a normalized limit cost, defined
                	with the aid of {QAP} upper and lower bounds easily 
			obtained and discards all solutions with cost less 
			than the computed limit. In Portuguese.",
}

@techreport{RanAbrBoaSil98a,
	author = "M.C. Rangel and N.M.M. de Abreu and P.O.
                  {Boaventura Netto} and M.C.S. Boeres",
	title = "A modified local search for {GRASP} in the quadratic
                 assignment problem",
	institution = "Production Engineering Program, COPPE, Federal
                     University of Rio de Janeiro",
	address = "Rio de Janeiro, RJ Brazil",
	year = "1998",
	annote = 	"An improvement of the local search phase of the 
			{GRASP} proposed by Li, Pardalos, and Resende (1994) 
			for solving the quadratic assignment problem
                	is proposed.
                	The new strategy amplifies the local search range and
                	improves the local search's efficiency."
}

@Article{ResParLi96a,
	author = "M.G.C. Resende and P.M. Pardalos and Y. Li",
	title = "Algorithm 754: {F}ortran subroutines for approximate
		 solution of
		 dense quadratic assignment problems using {GRASP}",
	journal = "ACM Transactions on Mathematical Software",
	volume = "22",
	pages = "104--118",
	year = "1996",
        annote   =     "This paper describes a set of ANSI standard Fortran 77
                	subroutines to find approximate solutions to dense
                	quadratic assignment problems having at least one
                	symmetric flow or distance matrix. It is an
                	optimized implementation
                	of the algorithm described in Li, Pardalos, and 
			Resende (1994).",
}

@Article{Rob01a,
	author = "A.J. Robertson",
	title = "A set of greedy randomized adaptive local search procedure
                 ({GRASP}) implementations for the multidimensional
                 assignment problem",
	 journal = "Computational Optimization and Applications",
	 volume = "19",
	 pages = "145--164",
	 year = "2001",
        annote   =     "This paper introduces four {GRASP} implementations for the
                	multidimensional assignment problem by combining
                	two constructive methods (randomized greedy
                	and randomized max regret) and two local search
                	methods ($2$-exchange and variable depth exchange).
                	At each iteration of the randomized greedy construction
                	phase, a set of best assignments is constructed from which
                	a random element is selected and added to the solution set.
                	The greedy function of the randomized max regret construction
                	method is a measure of the competition between the two
                	leading cost candidates. The maximum regret value corresponds
                	to the candidate assignment that has the largest winning
                	margin between itself and its next highest competitor.
                	The variable depth exchange is an extension of the
                	$2$-exchange method that allows a more extensive search
                	of the surrounding neighborhood space.",
}

@incollection{Sos00a,
	author = "D. Sosnowska",
	title = "Optimization of a simplified fleet assignment problem
		 with metaheuristics: {S}imulated annealing and {GRASP}",
	booktitle = "Approximation and complexity in numerical optimization",
	editor = "P.M. Pardalos",
	publisher = "Kluwer Academic Publishers",
	year = "2000",
	annote = 	"Two heuristics based on simulated
                	annealing and {GRASP} are presented for finding approximate
                	solutions for a simplified fleet assignment problem. Both
                	methods are based on swapping parts of sequence of flight
                	legs assigned to an aircraft (rotation cycle) between two
                	randomly chosen aircrafts. In simulated annealing, the
                	exchange is such that a solution is accepted according
                	to a probability distribution, while in {GRASP} only exchanges
                	leading to a better solution are permitted and the potentially
                	best part of the assignment is conserved and the rest is
                	randomly reattributed. The construction phase does not use
                	a restricted candidate list explicitly, but a solution is built
                	by simply trying to make the time interval between two flights
                	as small as possible."
}

@Article{UrbChiRus00a,
	author = "T.L. Urban and W.-C. Chiang and R.A. Russel",
	title = "The integrated machine allocation and layout problem",
	journal = "International Journal of Production Research",
        volume = "38",
	pages = "2911--2930",
	year = "2000",
        annote   =     "{GRASP} is used to solve quadratic assignment sub-problems
                	in a model that aggregates quadratic assignment
                	problems with several network flow problems with side
                	constraints.  This model is used to produce machine
                	layouts where machines are not required to be placed in
                	a functional or cellular layout.",
}

@techreport{VieGon01a,
        author = {C.E.C. Vieira and P.R.L. Gondim},
	title = {Uma Nova Estrat\'egia para Aplica\c{c}\~ao do {GRASP}
                  ao problema de aloca\c{c}\~ao de canal},
        number = {070/DE9/01},
	institution = {Departamento de Engenharia de Sistemas,
                       Instituto Militar de Engenharia},
        address = {Rio de Janeiro, Brazil},
	annote = {A special location problem arising in telecommunications 
		is addressed in this paper. 
		The authors propose a heuristic that uses the {GRASP} 
		randomized construction idea and 
		the chosen greedy function measures the difficulty 
		in assigning a frequency.},
	year = {2001}
}

@Article{FleGlo99a,
	 author = "C. Fleurent and F. Glover",
	 title = "Improved constructive multistart strategies
                  for the quadratic assignment problem using
                  adaptive memory",
	 journal = "INFORMS Journal on Computing",
	 volume = "11",
         year = "1999",
	 pages = "198--204",
        annote   =     "Adaptive memory strategies that are the heart of tabu
                	search methods are shown to be a foundation for 
			alternative, enhanced, multistart approaches.
                	This paper illustrates that constructive multistart 
			methods, such as Random Restart and {GRASP}, can be 
			improved by the addition of memory and associated 
			heuristic search principles.
                	The improved results indicate that these principles 
			(learning, intensification, candidate list
                	strategies, POP) are not limited to applications with
                	transition neighborhoods, as in local search, but
                	can also be useful for applications characterized by
                	constructive (and destructive) neighborhoods.
                	The paper shows that the {GRASP} for QAP of Li, Pardalos,
                	and Resende (1994) can be improved upon by using these
                	memory strategies.
			Study of alternatives to memoryless
                	multistart approaches like {GRASP} is conducted for the
                	quadratic assignment problem. Adaptive memory strategies
                	retain and analyze features of selected solutions in
                	order to provide a basis for improving future executions
                	of the constructive process. The authors show that the
                	most effective strategies are tabu search methods,
                	which use memory in both improving and constructive 
			phases.",
}