GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES (GRASP)

This paper is a survey of greedy randomized adaptive search procedures (GRASP). GRASP is a multi-start or iterative procedure where each GRASP iteration consists of a construction phase, where a feasible solution is constructed, followed by a local search procedure that finds a locally optimal solution. The construction phase of GRASP is essentially a randomized greedy algorithm. Repeated applications of the construction procedure yields diverse starting solutions for the local search. We review a basic GRASP, followed by enhancements to the basic procedure. We conclude by surveying operations research and industrial applications of GRASP.

[1]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[2]  Scott Kirkpatrick,et al.  Optimization by simulated annealing: Quantitative studies , 1984 .

[3]  Andrew W. Shogan,et al.  Semi-greedy heuristics: An empirical study , 1987 .

[4]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[5]  Jonathan F. Bard,et al.  Note-Operations Sequencing in Discrete Parts Manufacturing , 1989 .

[6]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[7]  Jonathan F. Bard,et al.  Flight Scheduling and Maintenance Base Planning , 1989 .

[8]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[9]  Jonathan F. Bard,et al.  The cutting path and tool selection problem in computer aided process planning , 1989 .

[10]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[11]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[12]  José Luis González Velarde,et al.  A search heuristic for just-in-time scheduling in parallel machines , 1991, J. Intell. Manuf..

[13]  T. Feo,et al.  An algorithm for the manufacturing equipment selection problem , 1991 .

[14]  J. G. Klincewicz,et al.  Avoiding local optima in thep-hub location problem using tabu search and GRASP , 1993, Ann. Oper. Res..

[15]  Mauricio G. C. Resende,et al.  A GRASP for satisfiability , 1993, Cliques, Coloring, and Satisfiability.

[16]  Panos M. Pardalos,et al.  A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[17]  Arvind Rajan,et al.  Using grasp to solve the component grouping problem , 1994 .

[18]  Manuel Laguna,et al.  A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem , 1994, Oper. Res..

[19]  Mauricio G. C. Resende,et al.  A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set , 1994, Oper. Res..

[20]  Jonathan F. Bard,et al.  Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly , 1995, Oper. Res..

[21]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[22]  Jonathan F. Bard,et al.  A GRASP for the Vehicle Routing Problem with Time Windows , 1995, INFORMS J. Comput..

[23]  Panos M. Pardalos,et al.  A Parallel Grasp Implementation for the Quadratic Assignment Problem , 1995 .

[24]  Thomas A. Feo,et al.  A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties , 1996, Comput. Oper. Res..

[25]  John L. Bresina,et al.  Heuristic-Biased Stochastic Sampling , 1996, AAAI/IAAI, Vol. 1.

[26]  Thomas A. Feo,et al.  Randomized methods for the number partitioning problem , 1996, Comput. Oper. Res..

[27]  Jonathan F. Bard,et al.  A GRASP for scheduling printed wiring board assembly , 1996 .

[28]  Panos M. Pardalos,et al.  Approximate solution of weighted MAX-SAT problems using GRASP , 1996, Satisfiability Problem: Theory and Applications.

[29]  Panos M. Pardalos,et al.  Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP , 1996, TOMS.

[30]  Panos M. Pardalos,et al.  A Parallel GRASP for MAX-SAT Problems , 1996, PARA.

[31]  Celso C. Ribeiro,et al.  Greedy randomized adaptive search procedures for the Steiner problem in graphs. , 1997 .

[32]  R. Tarjan,et al.  Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using Grasp , 1997 .

[33]  P. Pardalos,et al.  Greedy Randomized Adaptive Search for a Location Problem with Economies of Scale , 1997 .

[34]  Panos M. Pardalos,et al.  Algorithm : FORTRAN Subroutines for Approximate Solution of Dense Quadratic Assignment Problems using GRASP , 2008 .

[35]  Panos M. Pardalos,et al.  A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem , 1997, Network Design: Connectivity and Facilities Location.

[36]  Panos M. Pardalos,et al.  A GRASP algorithm for the single source uncapacitated minimum concave-cost network flow problem , 1997, Network Design: Connectivity and Facilities Location.

[37]  M. Resende,et al.  A GRASP for graph planarization , 1997, Networks.

[38]  Gang Yu,et al.  A Grasp for Aircraft Routing in Response to Groundings and Delays , 1997, J. Comb. Optim..

[39]  Piet Demeester,et al.  Design techniques for SDH mesh-restorable networks , 1997 .

[40]  Panos M. Pardalos,et al.  An Exact Parallel Algorithm for the Maximum Clique Problem , 1998 .

[41]  Mauricio G. C. Resende,et al.  Computing Approximate Solutions of the Maximum Covering Problem with GRASP , 1998, J. Heuristics.

[42]  H. R. Lourenço,et al.  Adaptive Approach Heuristics for The Generalized Assignment Problem , 1998 .

[43]  Helena Ramalhinho-Lourenço,et al.  Metaheuristics for the bus-driver scheduling problem , 1998 .

[44]  Moshe Dror,et al.  A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities , 1998, Transp. Sci..

[45]  Panos M. Pardalos,et al.  A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem , 1998, J. Comb. Optim..

[46]  Dushyant Sharma,et al.  New neighborhood search structures for the capacitated minimum spanning tree problem , 1998 .

[47]  E. T RIANTAPHYLLOU,et al.  A Greedy Randomized Adaptive Search Procedure ( GRASP ) for Inferring Logical Clauses from Examples in Polynomial Time and some Extensions , 1998 .

[48]  Panos M. Pardalos,et al.  A GRASP for the biquadratic assignment problem , 1998, Eur. J. Oper. Res..

[49]  Panos M. Pardalos,et al.  On maximum clique problems in very large graphs , 1999, External Memory Algorithms.

[50]  Jonathan F. Bard,et al.  Heuristics for the flow line problem with setup costs , 1998, Eur. J. Oper. Res..

[51]  Celso C. Ribeiro,et al.  A Parallel GRASP for the Steiner Problem in Graphs , 1998, IRREGULAR.

[52]  Jonathan F. Bard,et al.  An Enhanced TSP-Based Heuristic for Makespan Minimization in a Flow Shop with Setup Times , 1999, J. Heuristics.

[53]  Fred Glover,et al.  Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory , 1999, INFORMS J. Comput..

[54]  Celso C. Ribeiro,et al.  Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP , 1999, TOMS.

[55]  E. Fern,et al.  Comparing New Heuristics for the Pure Integer Capacitated Plant Location Problem , 1999 .

[56]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

[57]  Panos M. Pardalos,et al.  A Parallel Grasp for the Data Association Multidimensional Assignment Problem , 1999 .

[58]  Celso C. Ribeiro,et al.  Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment , 2000, INFORMS J. Comput..

[59]  Ashish Tiwari,et al.  A greedy genetic algorithm for the quadratic assignment problem , 2000, Comput. Oper. Res..

[60]  Alexander J. Robertson,et al.  A Set of Greedy Randomized Adaptive Local Search Procedure (GRASP) Implementations for the Multidimensional Assignment Problem , 2001, Comput. Optim. Appl..

[61]  Rafael Martí,et al.  A GRASP for Coloring Sparse Graphs , 2001, Comput. Optim. Appl..

[62]  S. Binato,et al.  A Greedy Randomized Adaptive Search Procedure for Transmission Expansion Planning , 2001 .