GRASP with Path-Relinking: Recent Advances and Applications

Path-relinking is a major enhancement to the basic greedy randomized adaptive search procedure (GRASP), leading to significant improvements in solution time and quality. Path-relinking adds a memory mechanism to GRASP by providing an intensification strategy that explores trajectories connecting GRASP solutions and the best elite solutions previously produced during the search. This paper reviews recent advances and applications of GRASP with path-relinking. A brief review of GRASP is given. This is followed by a description of path-relinking and how it is incorporated into GRASP. Several recent applications of GRASP with path-relinking are reviewed. The paper concludes with a discussion of extensions to this strategy, concerning in particular parallel implementations and applications of path-relinking with other metaheuristics.

[1]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

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

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

[4]  Celso C. Ribeiro,et al.  Scheduling workover rigs for onshore oil production , 2006, Discret. Appl. Math..

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

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

[7]  A. Frieze.  Complexity of a 3-dimensional assignment problem , 1983 .

[8]  Gerhard J. Woeginger,et al.  Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients , 1996, Discret. Appl. Math..

[9]  Celso C. Ribeiro,et al.  Probability Distribution of Solution Time in GRASP: An Experimental Investigation , 2002, J. Heuristics.

[10]  R. A. Whitaker,et al.  A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems , 1983 .

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

[12]  Y. Crama,et al.  Approximation algorithms for three-dimensional assignment problems with triangle inequalities , 1992 .

[13]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[14]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

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

[16]  Celso C. Ribeiro,et al.  A genetic algorithm for the phylogeny problem using an optimized crossover strategy based on path-relinking , 2003, WOB.

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

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

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

[20]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Path Relinking , 2001 .

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

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

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

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

[25]  Egon Balas,et al.  An Algorithm for the Three-Index Assignment Problem , 1991, Oper. Res..

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

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

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

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

[30]  Celso C. Ribeiro,et al.  Strategies for the Parallel Implementation of Metaheuristics , 2002 .

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

[32]  Panos M. Pardalos,et al.  The Fifth Metaheuristics International Conference ? ?-1 GRASP with path-relinking for the QAP , 2022 .

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

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

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

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

[37]  Geir Dahl,et al.  The 2-path network problem , 2004, Networks.

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

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

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

[41]  Celso C. Ribeiro,et al.  Applications and Parallel Implementations of Metaheuristics in Network Design and Routing , 2004, AACC.

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

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

[44]  Mauricio G. C. Resende,et al.  On the implementation of a swap-based local search procedure for the p -median problem ∗ , 2002 .

[45]  Celso C. Ribeiro,et al.  A Parallel GRASP Heuristic for the 2-Path Network Design Problem (Research Note) , 2002, Euro-Par.

[46]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[47]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .