Hybrid GRASP Heuristics

Experience has shown that a crafted combination of concepts of different metaheuristics can result in robust combinatorial optimization schemes and produce higher solution quality than the individual metaheuristics themselves, especially when solving difficult real-world combinatorial optimization problems. This chapter gives an overview of different ways to hybridize GRASP (Greedy Randomized Adaptive Search Procedures) to create new and more effective metaheuristics. Several types of hybridizations are considered, involving different constructive procedures, enhanced local search algorithms, and memory structures.

[1]  C. Ribeiro,et al.  Essays and Surveys in Metaheuristics , 2002, Operations Research/Computer Science Interfaces Series.

[2]  José Luis González Velarde,et al.  Computing tools for modeling, optimization and simulation : interfaces in computer science and operations research , 2000 .

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

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

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

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

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

[8]  Celso C. Ribeiro,et al.  A GRASP with path‐relinking for private virtual circuit routing , 2003, Networks.

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

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

[11]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

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

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

[14]  Nenad Mladenović,et al.  An Introduction to Variable Neighborhood Search , 1997 .

[15]  G. Mateus,et al.  The metaheuristic GRASP as an upper bound for a branch and bound algorithm in a scheduling problem with non-related parallel machines and sequence-dependent setup times , 2004 .

[16]  Panos M. Pardalos,et al.  Handbook of applied optimization , 2002 .

[17]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

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

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

[20]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

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

[22]  D. Andrade,et al.  A GRASP FOR PBX TELEPHONE MIGRATION SCHEDULING , 2006 .

[23]  Jens Gottlieb,et al.  Evolutionary Computation in Combinatorial Optimization , 2006, Lecture Notes in Computer Science.

[24]  Alexandre Plastino,et al.  NGL01-4: A Hybrid GRASP with Data Mining for Efficient Server Replication for Reliable Multicast , 2006, IEEE Globecom 2006.

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

[26]  Celso C. Ribeiro,et al.  A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy , 2000, J. Glob. Optim..

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

[28]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

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

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

[31]  Toshihide Ibaraki,et al.  Metaheuristics : progress as real problem solvers , 2005 .

[32]  John R. Koza,et al.  Genetic Programming II , 1992 .

[33]  Danuta Sosnowska,et al.  Optimization of a simplified Fleet Assignment Problem with metaheuristics: Simulated Annealing and GRASP , 2000 .

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

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

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

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

[38]  Christian Blum,et al.  Hybrid Metaheuristics , 2010, Artificial Intelligence: Foundations, Theory, and Algorithms.

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

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

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

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

[43]  I ScottKirkpatrick.  Optimization by Simulated Annealing: Quantitative Studies , 1984 .

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

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

[46]  Helena R. Lourenço,et al.  A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling , 2007, EvoCOP.

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

[48]  Abraham Duarte,et al.  Tabu search and GRASP for the maximum diversity problem , 2007, Eur. J. Oper. Res..

[49]  Jeffery L. Kennington,et al.  Interfaces in Computer Science and Operations Research , 1997 .

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

[51]  Alexandre Plastino,et al.  A Hybrid GRASP with Data Mining for the Maximum Diversity Problem , 2005, Hybrid Metaheuristics.

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

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

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

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

[56]  John R. Koza.  Genetic Programming III - Darwinian Invention and Problem Solving , 1999, Evolutionary Computation.

[57]  Rafael Martí,et al.  Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..

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

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

[60]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[61]  P. Hansen,et al.  Developments of Variable Neighborhood Search , 2002 .

[62]  Jorge Pinho de Sousa,et al.  Metaheuristics: Computer Decision-Making , 2010 .

[63]  M. Gulnara Baldoquin,et al.  Heuristics and metaheuristics approaches used to solve the Rural Postman Problem : A Comparative Case Study , 2003 .

[64]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[66]  Hugues Delmaire,et al.  REACTIVE GRASP AND TABU SEARCH BASED HEURISTICS FOR THE SINGLE SOURCE CAPACITATED PLANT LOCATION PROBLEM , 1999 .

[67]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[68]  Panos M. Pardalos.  Approximation and Complexity in Numerical Optimization , 2000 .

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

[70]  Silvio Binato,et al.  A Reactive Grasp for Transmission Network Expansion Planning , 2002 .

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

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

[73]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

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

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

[76]  John R. Koza,et al.  Genetic Programming III: Darwinian Invention & Problem Solving , 1999 .

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