Metaheuristic Hybridization with Greedy Randomized Adaptive Search Procedures

GRASP, or greedyrandomized adaptive search procedure, is a multistart metaheuris- tic that repeatedlyapplies local search starting from solutions constructed bya ran- domized greedy algorithm. In this tutorial, I consider ways to hybridize GRASP to create new and more effective metaheuristics. I consider several types of hybridiza- tions: constructive procedures, enhanced local search, memorystructures, and cost reformulations.

[1]  John Baxter,et al.  Local Optima Avoidance in Depot Location , 1981 .

[2]  E. Baum.  Towards practical `neural' computation for combinatorial optimization problems , 1987 .

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

[4]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[5]  James B. Orlin,et al.  Theory of cyclic transfers , 1989 .

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

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

[8]  David S. Johnson,et al.  Local Optimization and the Traveling Salesman Problem , 1990, ICALP.

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

[10]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[11]  Edward W. Felten,et al.  Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..

[12]  Paul M. Thompson,et al.  Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..

[13]  Irène Charon,et al.  The noising method: a new method for combinatorial optimization , 1993, Oper. Res. Lett..

[14]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

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

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

[17]  Olivier C. Martin,et al.  Combining simulated annealing with local search heuristics , 1993, Ann. Oper. Res..

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

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

[20]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

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

[22]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

[23]  Mauricio G. C. Resende,et al.  Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP , 1998, TOMS.

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

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

[26]  Panos M. Pardalos,et al.  Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP , 2000, Discret. Appl. Math..

[27]  Xin Liu,et al.  A GRASP FOR FRE-QUENCY ASSIGNMENT IN MOBILE RADIO NETWORKS , 2000 .

[28]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[29]  Sue Abdinnour-Helm,et al.  Tabu search based heuristics for multi-floor facility layout , 2000 .

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

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

[32]  Fred Glover,et al.  Multi-Start and Strategic Oscillation Methods - Principles to Exploit Adaptive Memory , 2000 .

[33]  Celso C. Ribeiro,et al.  Local search with perturbations for the prize‐collecting Steiner tree problem in graphs , 2001, Networks.

[34]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[35]  Dushyant Sharma,et al.  Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem , 2001, Math. Program..

[36]  Celso C. Ribeiro,et al.  Variable neighborhood search for the degree-constrained minimum spanning tree problem , 2002, Discret. Appl. Math..

[37]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

[38]  Panos M. Pardalos,et al.  Randomized heuristics for the Max-Cut problem , 2002, Optim. Methods Softw..

[39]  Lúcia Maria de A. Drummond,et al.  Distributed parallel metaheuristics based on GRASP and VNS for solving the traveling purchaser problem , 2002, Ninth International Conference on Parallel and Distributed Systems, 2002. Proceedings..

[40]  Celso C. Ribeiro,et al.  A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs , 2002, INFORMS J. Comput..

[41]  Irène Charon,et al.  The Noising Methods: A Survey , 2002 .

[42]  Mauricio G. C. Resende,et al.  Grasp: An Annotated Bibliography , 2002 .

[43]  Michel Gendreau,et al.  An Introduction to Tabu Search , 2003, Handbook of Metaheuristics.

[44]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[45]  Panos M. Pardalos,et al.  GRASP with Path-Relinking for the Quadratic Assignment Problem , 2004, WEA.

[46]  José A. Moreno-Pérez,et al.  GRASP-VNS hybrid for the Strip Packing Problem , 2004, Hybrid Metaheuristics.

[47]  Celso C. Ribeiro,et al.  A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy , 2004 .

[48]  Andrew Lim,et al.  Improved GRASP with Tabu search for vehicle routing with both time window and limited number of vehicles , 2004 .

[49]  Andrew Lim,et al.  A smoothed dynamic tabu search embedded GRASP for m-VRPTW , 2004, 16th IEEE International Conference on Tools with Artificial Intelligence.

[50]  Mauricio G. C. Resende,et al.  A Hybrid Heuristic for the p-Median Problem , 2004, J. Heuristics.

[51]  Celso C. Ribeiro,et al.  GRASP with Path-Relinking: Recent Advances and Applications , 2005 .

[52]  Andrew Lim,et al.  A very large-scale neighborhood search approach to capacitated warehouse routing problem , 2005, 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05).

[53]  Celso C. Ribeiro,et al.  A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure , 2005, Int. Trans. Oper. Res..

[54]  Panos M. Pardalos,et al.  GRASP with Path Relinking for Three-Index Assignment , 2005, INFORMS J. Comput..

[55]  José Luis González Velarde,et al.  Grasp Embedded Scatter Search for the Multicommodity Capacitated Network Design Problem , 2005, J. Heuristics.

[56]  A. Moura,et al.  A GRASP approach to the container-loading problem , 2005, IEEE Intelligent Systems.

[57]  Mauricio G. C. Resende,et al.  A hybrid multistart heuristic for the uncapacitated facility location problem , 2006, Eur. J. Oper. Res..

[58]  Celso C. Ribeiro,et al.  Referee Assignment in Sports Leagues , 2006, PATAT.

[59]  Günther R. Raidi.  A unified view on hybrid metaheuristics , 2006 .

[60]  El-Ghazali Talbi,et al.  Using Datamining Techniques to Help Metaheuristics: A Short Survey , 2006, Hybrid Metaheuristics.

[61]  Panos M. Pardalos,et al.  GRASP with path relinking for the weighted MAXSAT problem , 2007, ACM J. Exp. Algorithmics.

[62]  Alexandre Plastino,et al.  Hybridization of GRASP Metaheuristic with Data Mining Techniques , 2006, J. Math. Model. Algorithms.

[63]  Jifeng He,et al.  A Hybrid Heuristic Algorithm for HW-SW Partitioning Within Timed Automata , 2006, KES.

[64]  Juan A. Díaz,et al.  Hybrid scatter search and path relinking for the capacitated p , 2006, Eur. J. Oper. Res..

[65]  Celso C. Ribeiro,et al.  Heuristics for the mirrored traveling tournament problem , 2007, Eur. J. Oper. Res..

[66]  Celso C. Ribeiro,et al.  A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy , 2007, Hybrid Metaheuristics.

[67]  Iván A. Contreras,et al.  Scatter search for the single source capacitated facility location problem , 2007, Ann. Oper. Res..

[68]  Alexandre Plastino,et al.  Applications of the DM-GRASP heuristic: a survey , 2008, Int. Trans. Oper. Res..

[69]  Mauricio G. C. Resende,et al.  GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem , 2010, Eur. J. Oper. Res..

[70]  Micael Gallego,et al.  GRASP and path relinking for the max-min diversity problem , 2010, Comput. Oper. Res..