Skip to main content
SpringerLink
Log in

Greedy Randomized Adaptive Search Procedures: Advances and Extensions

  • Chapter
  • First Online:
Handbook of Metaheuristics

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 272))

Abstract

A greedy randomized adaptive search procedure (GRASP) is a multi-start metaheuristic for combinatorial optimization problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution whose neighborhood is investigated until a local minimum is found during the local search phase. The best overall solution is kept as the result. In this chapter, we first describe the basic components of GRASP. Successful implementation techniques are discussed and illustrated by numerical results obtained for different applications. Enhanced or alternative solution construction mechanisms and techniques to speed up the search are also described: Alternative randomized greedy construction schemes, Reactive GRASP, cost perturbations, bias functions, memory and learning, Lagrangean constructive heuristics and Lagrangean GRASP, local search on partially constructed solutions, hashing, and filtering. We also discuss implementation strategies of memory-based intensification and post-optimization techniques using path-relinking. Restart strategies to speedup the search, hybridizations with other metaheuristics, and applications are also reviewed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. S. Abdinnour-Helm, S.W. Hadley, Tabu search based heuristics for multi-floor facility layout. Int. J. Prod. Res. 38, 365–383 (2000)

    Google Scholar 

  2. J. Abello, P.M. Pardalos, M.G.C. Resende, On maximum clique problems in very large graphs, in External Memory Algorithms and Visualization, ed. by J. Abello, J. Vitter. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 50 (American Mathematical Society, Providence, 1999), pp. 199–130

    Google Scholar 

  3. J. Abello, M.G.C. Resende, S. Sudarsky, Massive quasi-clique detection, in LATIN 2002: Theoretical Informatics, ed. by S. Rajsbaum. Lecture Notes in Computer Science, vol. 2286 (Springer, Berlin, 2002), pp. 598–612

    Google Scholar 

  4. R.K. Ahuja, J.B. Orlin, A. Tiwari, A greedy genetic algorithm for the quadratic assignment problem. Comput. Oper. Res. 27, 917–934 (2000)

    Google Scholar 

  5. R.K. Ahuja, J.B. Orlin, D. Sharma, Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Math. Program. 91, 71–97 (2001)

    Google Scholar 

  6. R.M. Aiex, M.G.C. Resende, Parallel strategies for GRASP with path-relinking, in Metaheuristics: Progress as Real Problem Solvers, ed. by T. Ibaraki, K. Nonobe, M. Yagiura (Springer, New York, 2005), pp. 301–331

    Google Scholar 

  7. R.M. Aiex, M.G.C. Resende, C.C. Ribeiro, Probability distribution of solution time in GRASP: an experimental investigation. J. Heuristics 8, 343–373 (2002)

    Google Scholar 

  8. R.M. Aiex, S. Binato, M.G.C. Resende, Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput. 29, 393–430 (2003)

    Google Scholar 

  9. R.M. Aiex, P.M. Pardalos, M.G.C. Resende, G. Toraldo, GRASP with path-relinking for three-index assignment. INFORMS J. Comput. 17, 224–247 (2005)

    Google Scholar 

  10. R.M. Aiex, M.G.C. Resende, C.C. Ribeiro, TTTPLOTS: a perl program to create time-to-target plots. Optim Lett. 1, 355–366 (2007)

    Google Scholar 

  11. E. Alekseeva, M. Mezmaz, D. Tuyttens, N. Melab, Parallel multi-core hyper-heuristic GRASP to solve permutation flow-shop problem. Concurrency Comput. Pract. Exp. 29, e3835 (2017)

    Google Scholar 

  12. D. Aloise, C.C. Ribeiro, Adaptive memory in multistart heuristics for multicommodity network design. J. Heuristics 17, 153–179 (2011)

    Google Scholar 

  13. R. Álvarez-Valdés, F. Parreno, J.M. Tamarit, A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems. J. Oper. Res. Soc. 56, 414–425 (2005)

    Google Scholar 

  14. R. Álvarez-Valdés, E. Crespo, J.M. Tamarit, F. Villa, GRASP and path relinking for project scheduling under partially renewable resources. Eur. J. Oper. Res. 189, 1153–1170 (2008)

    Google Scholar 

  15. R. Alvarez-Valdesa, F. Parreno, J.M. Tamarit, Reactive GRASP for the strip-packing problem. Comput. Oper. Res. 35, 1065–1083 (2008)

    Google Scholar 

  16. R. Alvarez-Valdes, F. Parreño, J.M. Tamarit, A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems. Comput. Oper. Res. 40, 3081–3090 (2013)

    Google Scholar 

  17. E. Amaldi, A. Capone, F. Malucelli, Planning UMTS base station location: optimization models with power control and algorithms. IEEE Trans. Wirel. Commun. 2, 939–952 (2003)

    Google Scholar 

  18. E. Amaldi, A. Capone, F. Malucelli, F. Signori, Optimization models and algorithms for downlink UMTS radio planning, in Proceedings of Wireless Communications and Networking, vol. 2 (2003), pp. 827–831

    Google Scholar 

  19. K.P. Anagnostopoulos, P.D. Chatzoglou, S. Katsavounis, A reactive greedy randomized adaptive search procedure for a mixed integer portfolio optimization problem. Manag. Financ. 36, 1057–1065 (2010)

    Google Scholar 

  20. D.V. Andrade, M.G.C. Resende, A GRASP for PBX telephone migration scheduling, in Proceedings of the Eighth INFORMS Telecommunications Conference (2006)

    Google Scholar 

  21. D.V. Andrade, M.G.C. Resende, GRASP with evolutionary path-relinking. Technical Report TD-6XPTS7, AT&T Labs Research, Florham Park, 2007

    Google Scholar 

  22. D.V. Andrade, M.G.C. Resende, GRASP with path-relinking for network migration scheduling, in Proceedings of the International Network Optimization Conference (2007)

    Google Scholar 

  23. A.A. Andreatta, C.C. Ribeiro, Heuristics for the phylogeny problem. J. Heuristics 8, 429–447 (2002)

    Google Scholar 

  24. C. Andrés, C. Miralles, R. Pastor, Balancing and scheduling tasks in assembly lines with sequence-dependent setup times. Eur. J. Oper. Res. 187, 1212–1223 (2008)

    Google Scholar 

  25. C.H. Antunes, E. Oliveira, P. Lima, A multi-objective GRASP procedure for reactive power compensation planning. Optim. Eng. 15, 199–215 (2014)

    Google Scholar 

  26. A.P.F. Araújo, C. Boeres, V.E.F. Rebello, C.C. Ribeiro, S. Urrutia, Exploring grid implementations of parallel cooperative metaheuristics: a case study for the mirrored traveling tournament problem, in Metaheuristics: Progress in Complex Systems Optimization, ed. by K.F. Doerner, M. Gendreau, P. Greistorfer, W. Gutjahr, R.F. Hartl, M. Reimann (Springer, New York, 2007), pp. 297–322

    Google Scholar 

  27. S.M. Areibi, GRASP: an effective constructive technique for VLSI circuit partitioning, in Proceedings of the IEEE Canadian Conference on Electrical and Computer Engineering, Edmonton, pp. 462–467 (1999)

    Google Scholar 

  28. S. Areibi, A. Vannelli, A GRASP clustering technique for circuit partitioning, in Satisfiability Problems, ed. by J. Gu, P.M. Pardalos. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 35 (American Mathematical Society, Providence, 1997), pp. 711–724

    Google Scholar 

  29. M.F. Argüello, T.A. Feo, O. Goldschmidt, Randomized methods for the number partitioning problem. Comput. Oper. Res. 23, 103–111 (1996)

    Google Scholar 

  30. M.F. Argüello, J.F. Bard, G. Yu, A GRASP for aircraft routing in response to groundings and delays. J. Comb. Optim. 1, 211–228 (1997)

    Google Scholar 

  31. M. Armony, J.C. Klincewicz, H. Luss, M.B. Rosenwein, Design of stacked self-healing rings using a genetic algorithm. J. Heuristics 6, 85–105 (2000)

    Google Scholar 

  32. J.E.C. Arroyo, P.S. Vieira, D.S. Vianna, A GRASP algorithm for the multi-criteria minimum spanning tree problem. Ann. Oper. Res. 159, 125–133 (2008)

    Google Scholar 

  33. J.B. Atkinson, A greedy randomised search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy. J. Oper. Res. Soc. 49, 700–708 (1998)

    Google Scholar 

  34. J.F. Bard, An analysis of a rail car unloading area for a consumer products manufacturer. J. Oper. Res. Soc. 48, 873–883 (1997)

    Google Scholar 

  35. J.F. Bard, T.A. Feo, Operations sequencing in discrete parts manufacturing. Manage. Sci. 35, 249–255 (1989)

    Google Scholar 

  36. J.F. Bard, T.A. Feo, An algorithm for the manufacturing equipment selection problem. IIE Trans. 23, 83–92 (1991)

    Google Scholar 

  37. J.F. Bard, T.A. Feo, S. Holland, A GRASP for scheduling printed wiring board assembly. IIE Trans. 28, 155–165 (1996)

    Google Scholar 

  38. J.F. Bard, L. Huang, P. Jaillet, M. Dror, A decomposition approach to the inventory routing problem with satellite facilities. Transp. Sci. 32, 189–203 (1998)

    Google Scholar 

  39. J.F. Bard, Y. Shao, A.I. Jarrah, A sequential GRASP for the therapist routing and scheduling problem. J. Scheduling 17, 109–133 (2014)

    Google Scholar 

  40. E.B. Baum, Iterated descent: a better algorithm for local search in combinatorial optimization problems. Technical Report, California Institute of Technology, 1986

    Google Scholar 

  41. E.B. Baum, Towards practical ‘neural’ computation for combinatorial optimization problems, in AIP Conference Proceedings 151 on Neural Networks for Computing (American Institute of Physics Inc., Woodbury, 1987), pp. 53–58

    Google Scholar 

  42. J. Baxter, Local optima avoidance in depot location. J. Oper. Res. Soc. 32, 815–819 (1981)

    Google Scholar 

  43. J.E. Beasley, An algorithm for set-covering problems. Eur. J. Oper. Res. 31, 85–93 (1987)

    Google Scholar 

  44. J.E. Beasley, A Lagrangian heuristic for set-covering problems. Nav. Res. Logist. 37, 151–164 (1990)

    Google Scholar 

  45. J.E. Beasley, Lagrangean relaxation, in Modern Heuristic Techniques for Combinatorial Problems, ed. by C.R. Reeves (Blackwell Scientific Publications, Oxford, 1993), pp. 243–303

    Google Scholar 

  46. S. Binato, G.C. Oliveira, A reactive GRASP for transmission network expansion planning, in Essays and Surveys in Metaheuristics, ed. by C.C. Ribeiro, P. Hansen (Kluwer Academic Publishers, Boston, 2002), pp. 81–100

    Google Scholar 

  47. S. Binato, H. Faria Jr., M.G.C. Resende, Greedy randomized adaptive path relinking, in Proceedings of the IV Metaheuristics International Conference, ed. by J.P. Sousa, pp. 393–397 (2001)

    Google Scholar 

  48. S. Binato, G.C. Oliveira, J.L. Araújo, A greedy randomized adaptive search procedure for transmission expansion planning. IEEE Trans. Power Syst. 16, 247–253 (2001)

    Google Scholar 

  49. S. Binato, W.J. Hery, D. Loewenstern, M.G.C. Resende, A GRASP for job shop scheduling, in Essays and Surveys in Metaheuristics, ed. by C.C. Ribeiro, P. Hansen (Kluwer Academic Publishers, Boston, 2002), pp. 59–79

    Google Scholar 

  50. M. Boudia, M.A.O. Louly, C. Prins, A reactive GRASP and path relinking for a combined production-distribution problem. Comput. Oper. Res. 34, 3402–3419 (2007)

    Google Scholar 

  51. J.L. Bresina, Heuristic-biased stochastic sampling, in Proceedings of the Thirteenth National Conference on Artificial Intelligence, Portland, pp. 271–278 (1996)

    Google Scholar 

  52. A.M. Campbell, B.W. Thomas, Probabilistic traveling salesman problem with deadlines. Transp. Sci. 42, 1–21 (2008)

    Google Scholar 

  53. R.G. Cano, G. Kunigami, C.C. de Souza, P.J. de Rezende, A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps. Comput. Oper. Res. 40, 1435–1447 (2013)

    Google Scholar 

  54. S.A. Canuto, M.G.C. Resende, C.C. Ribeiro, Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 38, 50–58 (2001)

    Google Scholar 

  55. C. Carreto, B. Baker, A GRASP interactive approach to the vehicle routing problem with backhauls, in Essays and Surveys in Metaheuristics, ed. by C.C. Ribeiro, P. Hansen (Kluwer Academic Publishers, Boston, 2002), pp. 185–199

    Google Scholar 

  56. W.A. Chaovalitwongse, C.A.S Oliveira, B. Chiarini, P.M. Pardalos, M.G.C. Resende, Revised GRASP with path-relinking for the linear ordering problem. J. Comb. Optim. 22, 572–593 (2011)

    Google Scholar 

  57. I. Charon, O. Hudry, The noising method: a new method for combinatorial optimization. Oper. Res. Lett. 14, 133–137 (1993)

    Google Scholar 

  58. I. Charon, O. Hudry, The noising methods: a survey, in Essays and Surveys in Metaheuristics, ed. by C.C. Ribeiro, P. Hansen (Kluwer Academic Publishers, Boston, 2002), pp. 245–261

    Google Scholar 

  59. M. Chica, O. Cordón, S. Damas, J. Bautista, A multiobjective GRASP for the 1/3 variant of the time and space assembly line balancing problem, in Trends in Applied Intelligent Systems, ed. by N. García-Pedrajas, F. Herrera, C. Fyfe, J. Benítez, M. Ali. Lecture Notes in Computer Science, vol. 6098 (Springer, Berlin, 2010), pp. 656–665

    Google Scholar 

  60. R. Colomé, D. Serra, Consumer choice in competitive location models: formulations and heuristics. Pap. Reg. Sci. 80, 439–464 (2001)

    Google Scholar 

  61. C.W. Commander, S.I. Butenko, P.M. Pardalos, C.A.S. Oliveira, Reactive GRASP with path relinking for the broadcast scheduling problem, in Proceedings of the 40th Annual International Telemetry Conference, pp. 792–800 (2004)

    Google Scholar 

  62. C. Commander, C.A.S. Oliveira, P.M. Pardalos, M.G.C. Resende, A GRASP heuristic for the cooperative communication problem in ad hoc networks, in Proceedings of the VI Metaheuristics International Conference, pp. 225–330 (2005)

    Google Scholar 

  63. A. Corberán, R. Martí, J.M. Sanchís, A GRASP heuristic for the mixed Chinese postman problem. Eur. J. Oper. Res. 142, 70–80 (2002)

    Google Scholar 

  64. R. Cordone, G. Lulli, A GRASP metaheuristic for microarray data analysis. Comput. Oper. Res. 40, 3108–3120 (2013)

    Google Scholar 

  65. J.F. Correcher, M.T. Alonso, F. Parre no, R. Alvarez-Valdes, Solving a large multicontainer loading problem in the car manufacturing industry. Comput. Oper. Res. 82, 139–152 (2017)

    Google Scholar 

  66. G.L. Cravo, G.M. Ribeiro, L.A. Nogueira Lorena, A greedy randomized adaptive search procedure for the point-feature cartographic label placement. Comput. Geosci. 34, 373–386 (2008)

    Google Scholar 

  67. M.M. D’Apuzzo, A. Migdalas, P.M. Pardalos, G. Toraldo, Parallel computing in global optimization, in Handbook of Parallel Computing and Statistics, ed. by E. Kontoghiorghes (Chapman & Hall/CRC, Boca Raton, 2006)

    Google Scholar 

  68. S. Das, S.M. Idicula, Application of reactive GRASP to the biclustering of gene expression data, in Proceedings of the International Symposium on Biocomputing (ACM, Calicut, 2010), p. 14

    Google Scholar 

  69. P. De, J.B. Ghosj, C.E. Wells, Solving a generalized model for con due date assignment and sequencing. Int. J. Prod. Econ. 34, 179–185 (1994)

    Google Scholar 

  70. R. De Leone, P. Festa, E. Marchitto, Solving a bus driver scheduling problem with randomized multistart heuristics. Int. Trans. Oper. Res. 18, 707–727 (2011)

    Google Scholar 

  71. H. Delmaire, J.A. Díaz, E. Fernández, M. Ortega, Reactive GRASP and Tabu Search based heuristics for the single source capacitated plant location problem. INFOR 37, 194–225 (1999)

    Google Scholar 

  72. X. Delorme, X. Gandibleux, F. Degoutin, Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem. Eur. J. Oper. Res. 204, 206–217 (2010)

    Google Scholar 

  73. Y. Deng, J.F. Bard, A reactive GRASP with path relinking for capacitated clustering. J. Heuristics 17, 119–152 (2011)

    Google Scholar 

  74. Y. Deng, J.F. Bard, G.R. Chacon, J. Stuber, Scheduling back-end operations in semiconductor manufacturing. IEEE Trans. Semicond. Manuf. 23, 210–220 (2010)

    Google Scholar 

  75. A.S. Deshpande, E. Triantaphyllou, A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions. Math. Comput. Model. 27, 75–99 (1998)

    Google Scholar 

  76. S. Dharan, A.S. Nair, Biclustering of gene expression data using reactive greedy randomized adaptive search procedure. BMC Bioinf. 10(Suppl 1), S27 (2009)

    Google Scholar 

  77. J.A. Díaz, D.E. Luna, J.-F. Camacho-Vallejo, M.-S. Casas-Ramírez, GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering. Expert Syst. Appl. 82, 67–76 (2017)

    Google Scholar 

  78. A. Drexl, F. Salewski, Distribution requirements and compactness constraints in school timetabling. Eur. J. Oper. Res. 102, 193–214 (1997)

    Google Scholar 

  79. A. Duarte, R. Martí, Tabu search and GRASP for the maximum diversity problem. Eur. J. Oper. Res. 178, 71–84 (2007)

    Google Scholar 

  80. A. Duarte, C.C. Ribeiro, S. Urrutia, A hybrid ILS heuristic to the referee assignment problem with an embedded MIP strategy. Lect. Notes Comput. Sci. 4771, 82–95 (2007)

    Google Scholar 

  81. A.R. Duarte, C.C. Ribeiro, S. Urrutia, E.H. Haeusler, Referee assignment in sports leagues. Lect. Notes Comput. Sci. 3867, 158–173 (2007)

    Google Scholar 

  82. A. Duarte, R. Martí, M.G.C. Resende, R.M.A. Silva, GRASP with path relinking heuristics for the antibandwidth problem. Networks 58, 171–189 (2011)

    Google Scholar 

  83. A. Duarte, R. Martí, A. Álvarez, F. Ángel-Bello, Metaheuristics for the linear ordering problem with cumulative costs. Eur. J. Oper. Res. 216, 270–277 (2012)

    Google Scholar 

  84. A. Duarte, J. Sánchez-Oro, M.G.C. Resende, F. Glover, R. Martí, GRASP with exterior path relinking for differential dispersion minimization. Inform. Sci. 296, 46–60 (2015)

    Google Scholar 

  85. M. Essafi, X. Delorme, A. Dolgui, Balancing lines with CNC machines: a multi-start and based heuristic. CIRP J. Manuf. Sci. Technol. 2, 176–182 (2010)

    Google Scholar 

  86. H. Faria Jr., S. Binato, M.G.C. Resende, D.J. Falcão, Transmission network design by a greedy randomized adaptive path relinking approach. IEEE Trans. Power Syst. 20, 43–49 (2005)

    Google Scholar 

  87. T.A. Feo, J.F. Bard, Flight scheduling and maintenance base planning. Manag. Sci. 35, 1415–1432 (1989)

    Google Scholar 

  88. T.A. Feo, J.F. Bard, The cutting path and tool selection problem in computer-aided process planning. J. Manufact. Syst. 8, 17–26 (1989)

    Google Scholar 

  89. T.A. Feo, J.L. González-Velarde, The intermodal trailer assignment problem: Models, algorithms, and heuristics. Transp. Sci. 29, 330–341 (1995)

    Google Scholar 

  90. T.A. Feo, M.G.C. Resende, A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67–71 (1989)

    Google Scholar 

  91. T.A. Feo, M.G.C. Resende, Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109–133 (1995)

    Google Scholar 

  92. T.A. Feo, K. Venkatraman, J.F. Bard, A GRASP for a difficult single machine scheduling problem. Comput. Oper. Res. 18, 635–643 (1991)

    Google Scholar 

  93. T.A. Feo, M.G.C. Resende, S.H. Smith, A greedy randomized adaptive search procedure for maximum independent set. Oper. Res. 42, 860–878 (1994)

    Google Scholar 

  94. T.A. Feo, J.F. Bard, S. Holland, Facility-wide planning and scheduling of printed wiring board assembly. Oper. Res. 43, 219–230 (1995)

    Google Scholar 

  95. T.A. Feo, K. Sarathy, J. McGahan, A GRASP for single machine scheduling with sequence dependent setup costs and linear delay penalties. Comput. Oper. Res. 23, 881–895 (1996)

    Google Scholar 

  96. E. Fernández, R. Martí, GRASP for seam drawing in mosaicking of aerial photographic maps. J. Heuristics 5, 181–197 (1999)

    Google Scholar 

  97. P. Festa, On some optimization problems in molecular biology. Math. Biosci. 207, 219–234 (2007)

    Google Scholar 

  98. P. Festa, M.G.C. Resende, GRASP: An annotated bibliography, in Essays and Surveys in Metaheuristics, ed. by C.C. Ribeiro, P. Hansen (Kluwer Academic Publishers, Boston, 2002), pp. 325–367

    Google Scholar 

  99. P. Festa, M.G.C. Resende, An annotated bibliography of GRASP, part I: algorithms. Int. Trans. Oper. Res. 16, 1–24 (2009)

    Google Scholar 

  100. P. Festa, M.G.C. Resende, An annotated bibliography of GRASP, part II: applications. Int. Trans. Oper. Res. 16, 131–172 (2009)

    Google Scholar 

  101. P. Festa, P.M. Pardalos, M.G.C. Resende, Algorithm 815: FORTRAN subroutines for computing approximate solution to feedback set problems using GRASP. ACM Trans. Math. Softw. 27, 456–464 (2001)

    Google Scholar 

  102. P. Festa, M.G.C. Resende, P. Pardalos, C.C. Ribeiro, GRASP and VNS for Max-Cut, in Extended Abstracts of the Fourth Metaheuristics International Conference, Porto, pp. 371–376 (2001)

    Google Scholar 

  103. P. Festa, P.M. Pardalos, M.G.C. Resende, C.C. Ribeiro, Randomized heuristics for the MAX-CUT problem. Optim. Methods Softw. 7, 1033–1058 (2002)

    Google Scholar 

  104. P. Festa, P.M. Pardalos, L.S. Pitsoulis, M.G.C. Resende, GRASP with path-relinking for the weighted MAXSAT problem. ACM J. Exp. Algorithmics 11, 1–16 (2006)

    Google Scholar 

  105. M.L. Fisher, The Lagrangian relaxation method for solving integer programming problems. Manag. Sci. 50, 1861–1871 (2004)

    Google Scholar 

  106. C. Fleurent, F. Glover, Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS J. Comput. 11, 198–204 (1999)

    Google Scholar 

  107. E. Fonseca, R. Fuchsuber, L.F.M. Santos, A. Plastino, S.L. Martins, Exploring the hybrid metaheuristic DM-GRASP for efficient server replication for reliable multicast, in International Conference on Metaheuristics and Nature Inspired Computing, Hammamet (2008)

    Google Scholar 

  108. R.D. Frinhani, R.M. Silva, G.R. Mateus, P. Festa, M.G.C. Resende, GRASP with path-relinking for data clustering: a case study for biological data, in Experimental Algorithms, ed. by P.M. Pardalos, S. Rebennack. Lecture Notes in Computer Science, vol. 6630 (Springer, Berlin, 2011), pp. 410–420

    Google Scholar 

  109. J.B. Ghosh, Computational aspects of the maximum diversity problem. Oper. Res. Lett. 19, 175–181 (1996)

    Google Scholar 

  110. F. Glover, New ejection chain and alternating path methods for traveling salesman problems, in Computer Science and Operations Research: New Developments in Their Interfaces, ed. by O. Balci, R. Sharda, S. Zenios (Elsevier, Amsterdam, 1992), pp. 449–509

    Google Scholar 

  111. F. Glover, Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discret. Appl. Math. 65, 223–254 (1996)

    Google Scholar 

  112. F. Glover, Tabu search and adaptive memory programing – advances, applications and challenges, in Interfaces in Computer Science and Operations Research, ed. by R.S. Barr, R.V. Helgason, J.L. Kennington (Kluwer Academic Publishers, Boston, 1996), pp. 1–75

    Google Scholar 

  113. F. Glover, Multi-start and strategic oscillation methods – principles to exploit adaptive memory, in Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, ed. by M. Laguna, J.L. Gonzáles-Velarde (Kluwer Academic Publishers, Boston, 2000), pp. 1–24

    Google Scholar 

  114. F. Glover, Exterior path relinking for zero-one optimization. Int. J. Appl. Metaheuristic Comput. 5, 1–8 (2014)

    Google Scholar 

  115. F. Glover, M. Laguna, Tabu Search (Kluwer Academic Publishers, Boston, 1997)

    Google Scholar 

  116. F. Glover, M. Laguna, R. Martí, Fundamentals of scatter search and path relinking. Control Cybern. 39, 653–684 (2000)

    Google Scholar 

  117. M.X. Goemans, D.P. Williamson, The primal dual method for approximation algorithms and its application to network design problems, in Approximation Algorithms for NP-Hard Problems, ed. by D. Hochbaum (PWS Publishing Co., Boston, 1996), pp. 144–191

    Google Scholar 

  118. F.C. Gomes, C.S. Oliveira, P.M. Pardalos, M.G.C. Resende, Reactive GRASP with path relinking for channel assignment in mobile phone networks, in Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (ACM Press, New York, 2001), pp. 60–67

    Google Scholar 

  119. P.L. Hammer, D.J. Rader Jr., Maximally disjoint solutions of the set covering problem. J. Heuristics 7, 131–144 (2001)

    Google Scholar 

  120. B.T. Han, V.T. Raja, A GRASP heuristic for solving an extended capacitated concentrator location problem. Int. J. Inf. Technol. Decis. Mak. 2, 597–617 (2003)

    Google Scholar 

  121. P. Hansen, N. Mladenović, Developments of variable neighborhood search, in Essays and Surveys in Metaheuristics, ed. by C.C. Ribeiro, P. Hansen (Kluwer Academic Publishers, Boston, 2002), pp. 415–439

    Google Scholar 

  122. J.P. Hart, A.W. Shogan, Semi-greedy heuristics: an empirical study. Oper. Res. Lett. 6, 107–114 (1987)

    Google Scholar 

  123. M. Held, R.M. Karp, The traveling-salesman problem and minimum spanning trees. Oper. Res. 18, 1138–1162 (1970)

    Google Scholar 

  124. M. Held, R.M. Karp, The traveling-salesman problem and minimum spanning trees: part II. Math. Program. 1, 6–25 (1971)

    Google Scholar 

  125. M. Held, P. Wolfe, H.P. Crowder, Validation of subgradient optimization. Math. Program. 6, 62–88 (1974)

    Google Scholar 

  126. C. Helmberg, F. Rendl, A spectral bundle method for semidefinite programming. SIAM J. Optim. 10, 673–696 (2000)

    Google Scholar 

  127. A.J. Higgins, S. Hajkowicz, E. Bui, A multi-objective model for environmental investment decision making. Comput. Oper. Res. 35, 253–266 (2008)

    Google Scholar 

  128. M.J. Hirsch, GRASP-based heuristics for continuous global optimization problems. Ph.D. thesis, Department of Industrial and Systems Engineering, University of Florida, Gainesville, 2006

    Google Scholar 

  129. M.J. Hirsch, C.N. Meneses, P.M. Pardalos, M.G.C. Resende, Global optimization by continuous GRASP. Optim. Lett. 1, 201–212 (2007)

    Google Scholar 

  130. M.J. Hirsch, P.M. Pardalos, M.G.C. Resende, Solving systems of nonlinear equations with continuous GRASP. Nonlinear Anal. Real World Appl. 10, 2000–2006 (2009)

    Google Scholar 

  131. M.J. Hirsch, P.M. Pardalos, M.G.C. Resende, Speeding up continuous GRASP. Eur. J. Oper. Res. 205, 507–521 (2010)

    Google Scholar 

  132. M.J. Hirsch, P.M. Pardalos, M.G.C. Resende, Correspondence of projected 3D points and lines using a continuous GRASP. Int. Trans. Oper. Res. 18, 493–511 (2011)

    Google Scholar 

  133. K. Holmqvist, A. Migdalas, P.M. Pardalos, Greedy randomized adaptive search for a location problem with economies of scale, in Developments in Global Optimization, ed. by I.M. Bomze et al. (Kluwer Academic Publishers, Dordrecht, 1997), pp. 301–313

    Google Scholar 

  134. K. Holmqvist, A. Migdalas, P.M. Pardalos, A GRASP algorithm for the single source uncapacitated minimum concave-cost network flow problem, in Network Design: Connectivity and Facilities Location, ed. by P.M. Pardalos, D.-Z. Du. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 40 (American Mathematical Society, Providence, 1998), pp. 131–142

    Google Scholar 

  135. H.H. Hoos, T. Stützle, Evaluation of Las Vegas algorithms - Pitfalls and remedies, in Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, ed. by G. Cooper, S. Moral (Morgan Kaufmann, Madison, 1998), pp. 238–245

    Google Scholar 

  136. R. Interian, C.C. Ribeiro, A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem. Int. Trans. Oper. Res. 24, 1307–1323 (2017)

    Google Scholar 

  137. D.S. Johnson, Local optimization and the traveling salesman problem, in Proceedings of the 17th Colloquium on Automata. LNCS, vol. 443 (Springer, Berlin, 1990), pp. 446–461

    Google Scholar 

  138. E.H. Kampke, J.E.C. Arroyo, A.G. Santos, Reactive GRASP with path relinking for solving parallel machines scheduling problem with resource-assignable sequence dependent setup times, in Proceedings of the World Congress on Nature and Biologically Inspired Computing, Coimbatore (IEEE, New York, 2009), pp. 924–929

    Google Scholar 

  139. H. Kautz, E. Horvitz, Y. Ruan, C. Gomes, B. Selman, Dynamic restart policies, in Proceedings of the Eighteenth National Conference on Artificial Intelligence (American Association for Artificial Intelligence, Edmonton, 2002), pp. 674–681

    Google Scholar 

  140. G. Kendall, S. Knust, C.C. Ribeiro, S. Urrutia, Scheduling in sports: an annotated bibliography. Comput. Oper. Res. 37, 1–19 (2010)

    Google Scholar 

  141. J.G. Klincewicz, Avoiding local optima in the p-hub location problem using tabu search and GRASP. Ann. Oper. Res. 40, 283–302 (1992)

    Google Scholar 

  142. J.G. Klincewicz, A. Rajan, Using GRASP to solve the component grouping problem. Nav. Res. Log. 41, 893–912 (1994)

    Google Scholar 

  143. G. Kontoravdis, J.F. Bard, A GRASP for the vehicle routing problem with time windows. ORSA J. Comput. 7, 10–23 (1995)

    Google Scholar 

  144. M. Kulich, J.J. Miranda-Bront, L. Preucil, A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment. Comput. Oper. Res. 84, 178–187 (2017)

    Google Scholar 

  145. N. Labadi, C. Prins, M. Reghioui, GRASP with path relinking for the capacitated arc routing problem with time windows, in Advances in Computational Intelligence in Transport, Logistics, and Supply Chain Management, ed. by A. Fink, F. Rothlauf (Springer, Berlin, 2008), pp. 111–135

    Google Scholar 

  146. M. Laguna, J.L. González-Velarde, A search heuristic for just-in-time scheduling in parallel machines. J. Intell. Manuf. 2, 253–260 (1991)

    Google Scholar 

  147. M. Laguna, R. Martí, GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J. Comput. 11, 44–52 (1999)

    Google Scholar 

  148. M. Laguna, R. Martí, A GRASP for coloring sparse graphs. Comput. Optim. Appl. 19, 165–178 (2001)

    Google Scholar 

  149. M. Laguna, T.A. Feo, H.C. Elrod, A greedy randomized adaptive search procedure for the two-partition problem. Oper. Res. 42, 677–687 (1994)

    Google Scholar 

  150. Y. Li, P.M. Pardalos, M.G.C. Resende, A greedy randomized adaptive search procedure for the quadratic assignment problem, in Quadratic Assignment and Related Problems, ed. by P.M. Pardalos, H. Wolkowicz. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 16 (American Mathematical Society, Providence, 1994), pp. 237–261

    Google Scholar 

  151. A. Lim, F. Wang, A smoothed dynamic tabu search embedded GRASP for m-VRPTW, in Proceedings of ICTAI 2004, pp. 704–708 (2004)

    Google Scholar 

  152. A. Lim, B. Rodrigues, C. Wang, Two-machine flow shop problems with a single server. J. Sched. 9, 515–543 (2006)

    Google Scholar 

  153. X. Liu, P.M. Pardalos, S. Rajasekaran, M.G.C. Resende, A GRASP for frequency assignment in mobile radio networks, in Mobile Networks and Computing, ed. by B.R. Badrinath, F. Hsu, P.M. Pardalos, S. Rajasejaran. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 52 (American Mathematical Society, Providence, 2000), pp. 195–201

    Google Scholar 

  154. H.R. Lourenço, D. Serra, Adaptive approach heuristics for the generalized assignment problem. Mathw. Soft Comput. 9, 209–234 (2002)

    Google Scholar 

  155. H.R. Lourenço, O.C. Martin, T. Stützle, Iterated local search, in Handbook of Metaheuristics, ed. by F. Glover, G. Kochenberger (Kluwer Academic Publishers, Boston, 2003), pp. 321–353

    Google Scholar 

  156. M. Luby, A. Sinclair, D. Zuckerman, Optimal speedup of Las Vegas algorithms. Inf. Process. Lett. 47, 173–180 (1993)

    Google Scholar 

  157. M. Luis, S. Salhi, G. Nagy, A guided reactive GRASP for the capacitated multi-source Weber problem. Comput. Oper. Res. 38, 1014–1024 (2011)

    Google Scholar 

  158. C.L.B. Maia, R.A.F. Carmo, F.G. Freitas, G.A.L. Campos, J.T. Souza, Automated test case prioritization with reactive GRASP. Adv. Softw. Eng. 2010, Article ID 428521 (2010)

    Google Scholar 

  159. R. Martí, Arc crossing minimization in graphs with GRASP. IEE Trans. 33, 913–919 (2001)

    Google Scholar 

  160. R. Martí, Arc crossing minimization in graphs with GRASP. IEEE Trans. 33, 913–919 (2002)

    Google Scholar 

  161. R. Martí, V. Estruch, Incremental bipartite drawing problem. Comput. Oper. Res. 28, 1287–1298 (2001)

    Google Scholar 

  162. R. Martí, M. Laguna, Heuristics and meta-heuristics for 2-layer straight line crossing minimization. Discret. Appl. Math. 127, 665–678 (2003)

    Google Scholar 

  163. R. Martí, F. Sandoya, GRASP and path relinking for the equitable dispersion problem. Comput. Oper. Res. 40, 3091–3099 (2013)

    Google Scholar 

  164. O. Martin, S.W. Otto, Combining simulated annealing with local search heuristics. Ann. Oper. Res. 63, 57–75 (1996)

    Google Scholar 

  165. O. Martin, S.W. Otto, E.W. Felten, Large-step Markov chains for the traveling salesman problem. Complex Syst. 5, 299–326 (1991)

    Google Scholar 

  166. S.L. Martins, C.C. Ribeiro, M.C. Souza, A parallel GRASP for the Steiner problem in graphs, in Proceedings of IRREGULAR’98 – 5th International Symposium on Solving Irregularly Structured Problems in Parallel, ed. by A. Ferreira, J. Rolim. Lecture Notes in Computer Science, vol. 1457 (Springer, Berlin, 1998), pp. 285–297

    Google Scholar 

  167. S.L. Martins, P.M. Pardalos, M.G.C. Resende, C.C. Ribeiro, Greedy randomized adaptive search procedures for the steiner problem in graphs, in Randomization Methods in Algorithmic Design, P.M. Pardalos, S. Rajasejaran, J. Rolim. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 43 (American Mathematical Society, Providence, 1999), pp. 133–145

    Google Scholar 

  168. S.L. Martins, M.G.C. Resende, C.C. Ribeiro, P.M. Pardalos, A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy. J. Glob. Optim. 17, 267–283 (2000)

    Google Scholar 

  169. G.R. Mateus, M.G.C. Resende, R.M.A. Silva, GRASP with path-relinking for the generalized quadratic assignment problem. J. Heuristics 17, 527–565 (2011)

    Google Scholar 

  170. T. Mavridou, P.M. Pardalos, L.S. Pitsoulis, M.G.C. Resende, A GRASP for the biquadratic assignment problem. Eur. J. Oper. Res. 105, 613–621 (1998)

    Google Scholar 

  171. M. Mestria, L.S. Ochi, S.L. Martins, GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem. Comput. Oper. Res. 40, 3218–3229 (2013)

    Google Scholar 

  172. N. Mladenović, P. Hansen, Variable neighborhood search. Comput. Oper. Res. 24, 1097–1100 (1997)

    Google Scholar 

  173. S.K. Monkman, D.J. Morrice, J.F. Bard, A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs. Eur. J. Oper. Res. 187, 1100–1114 (2008)

    Google Scholar 

  174. R.E.N. Moraes, C.C. Ribeiro, Power optimization in ad hoc wireless network topology control with biconnectivity requirements. Comput. Oper. Res. 40, 3188–3196 (2013)

    Google Scholar 

  175. L.F. Morán-Mirabal, J.L. González-Velarde, M.G.C. Resende, R.M.A. Silva, Randomized heuristics for handover minimization in mobility networks. J. Heuristics 19, 845–880 (2013)

    Google Scholar 

  176. L.F. Morán-Mirabal, J.L. González-Velarde, M.G.C. Resende, Randomized heuristics for the family traveling salesperson problem. Int. Trans. Oper. Res. 21, 41–57 (2014)

    Google Scholar 

  177. R.A. Murphey, P.M. Pardalos, L.S. Pitsoulis, A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem, in Network Design: Connectivity and Facilities Location, ed. by P.M. Pardalos, D.-Z. Du. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 40 (American Mathematical Society, Providence, 1998), pp. 277–301

    Google Scholar 

  178. R.A. Murphey, P.M. Pardalos, L.S. Pitsoulis, A parallel GRASP for the data association multidimensional assignment problem, in Parallel Processing of Discrete Problems, ed. by P.M. Pardalos. The IMA Volumes in Mathematics and Its Applications, vol. 106 (Springer, New York, 1998), pp. 159–180

    Google Scholar 

  179. M.C.V. Nascimento, L. Pitsoulis, Community detection by modularity maximization using GRASP with path relinking. Comput. Oper. Res. 40, 3121–3131 (2013)

    Google Scholar 

  180. M.C.V. Nascimento, M.G.C. Resende, F.M.B. Toledo, GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem. Eur. J. Oper. Res. 200, 747–754 (2010)

    Google Scholar 

  181. V.-P. Nguyen, C. Prins, C. Prodhon, Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking. Eur. J. Oper. Res. 216, 113–126 (2012)

    Google Scholar 

  182. E. Nowicki, C. Smutnicki, An advanced tabu search algorithm for the job shop problem. J. Sched. 8, 145–159 (2005)

    Google Scholar 

  183. C.A. Oliveira, P.M. Pardalos, M.G.C. Resende, GRASP with path-relinking for the quadratic assignment problem, in Proceedings of III Workshop on Efficient and Experimental Algorithms, vol. 3059, ed. by C.C. Ribeiro, S.L. Martins (Springer, New York, 2004), pp. 356–368

    Google Scholar 

  184. I.H. Osman, B. Al-Ayoubi, M. Barake, A greedy random adaptive search procedure for the weighted maximal planar graph problem. Comput. Ind. Eng. 45, 635–651 (2003)

    Google Scholar 

  185. J.A. Pacheco, S. Casado, Solving two location models with few facilities by using a hybrid heuristic: a real health resources case. Comput. Oper. Res. 32, 3075–3091 (2005)

    Google Scholar 

  186. A.V.F. Pacheco, G.M. Ribeiro, G.R. Mauri, A GRASP with path-relinking for the workover rig scheduling problem. Int. J. Nat. Comput. Res. 1, 1–14 (2010)

    Google Scholar 

  187. G. Palubeckis, Multistart tabu search strategies for the unconstrained binary quadratic optimization problem. Ann. Oper. Res. 131, 259–282 (2004)

    Google Scholar 

  188. P.M. Pardalos, L.S. Pitsoulis, M.G.C. Resende, A parallel GRASP implementation for the quadratic assignment problem, in Parallel Algorithms for Irregularly Structured Problems – Irregular’94, ed. by A. Ferreira, J. Rolim (Kluwer Academic Publishers, Dordrecht, 1995), pp. 115–133

    Google Scholar 

  189. P.M. Pardalos, L.S. Pitsoulis, M.G.C. Resende, A parallel GRASP for MAX-SAT problems. Lect. Notes Comput. Sci. 1184, 575–585 (1996)

    Google Scholar 

  190. P.M. Pardalos, L.S. Pitsoulis, M.G.C. Resende, Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP. ACM Trans. Math. Softw. 23, 196–208 (1997)

    Google Scholar 

  191. P.M. Pardalos, T. Qian, M.G.C. Resende, A greedy randomized adaptive search procedure for the feedback vertex set problem. J. Comb. Optim. 2, 399–412 (1999)

    Google Scholar 

  192. F. Parreño, R. Alvarez-Valdes, J.M. Tamarit, J.F. Oliveira, A maximal-space algorithm for the container loading problem. INFORMS J. Comput. 20, 412–422 (2008)

    Google Scholar 

  193. R.A. Patterson, H. Pirkul, E. Rolland, A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem. J. Heuristics 5, 159–180 (1999)

    Google Scholar 

  194. O. Pedrola, M. Ruiz, L. Velasco, D. Careglio, O. González de Dios, J. Comellas, A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem. Comput. Oper. Res. 40, 3174–3187 (2013)

    Google Scholar 

  195. L.S. Pessoa, M.G.C. Resende, C.C. Ribeiro, Experiments with the LAGRASP heuristic for set k-covering. Optim. Lett. 5, 407–419 (2011)

    Google Scholar 

  196. L.S. Pessoa, M.G.C. Resende, C.C. Ribeiro, A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering. Comput. Oper. Res. 40, 3132–3146 (2013)

    Google Scholar 

  197. E. Pinana, I. Plana, V. Campos, R. Martí, GRASP and path relinking for the matrix bandwidth minimization. Eur. J. Oper. Res. 153, 200–210 (2004)

    Google Scholar 

  198. L.S. Pitsoulis, P.M. Pardalos, D.W. Hearn, Approximate solutions to the turbine balancing problem. Eur. J. Oper. Res. 130, 147–155 (2001)

    Google Scholar 

  199. F. Poppe, M. Pickavet, P. Arijs, P. Demeester, Design techniques for SDH mesh-restorable networks, in Proceedings of the European Conference on Networks and Optical Communications, Volume 2: Core and ATM Networks, pp. 94–101, (1997)

    Google Scholar 

  200. M. Prais, C.C. Ribeiro, Parameter variation in GRASP implementations, in Extended Abstracts of the Third Metaheuristics International Conference, Angra dos Reis, pp. 375–380 (1999)

    Google Scholar 

  201. M. Prais, C.C. Ribeiro, Parameter variation in GRASP procedures. Investigación Operativa 9, 1–20 (2000)

    Google Scholar 

  202. M. Prais, C.C. Ribeiro, Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J. Comput. 12, 164–176 (2000)

    Google Scholar 

  203. M. Rahmani, M. Rashidinejad, E.M. Carreno, R.A. Romero, Evolutionary multi-move path-relinking for transmission network expansion planning, in 2010 IEEE Power and Energy Society General Meeting, Minneapolis (IEEE, New York, 2010), pp. 1–6

    Google Scholar 

  204. M.C. Rangel, N.M.M. Abreu, P.O. Boaventura Netto, GRASP in the QAP: an acceptance bound for initial solutions. Pesquisa Operacional 20, 45–58 (2000)

    Google Scholar 

  205. M.G. Ravetti, F.G. Nakamura, C.N. Meneses, M.G.C. Resende, G.R. Mateus, P.M. Pardalos, Hybrid heuristics for the permutation flow shop problem. Technical Report, AT&T Labs Research Technical Report, Florham Park, 2006

    Google Scholar 

  206. M. Reghioui, C. Prins, N. Labadi, GRASP with path relinking for the capacitated arc routing problem with time windows, in Applications of Evolutionary Computing, ed. by M. Giacobini et al. Lecture Notes in Computer Science, vol. 4448 (Springer, Berlin, 2007), pp. 722–731

    Google Scholar 

  207. M.G.C. Resende, Computing approximate solutions of the maximum covering problem using GRASP. J. Heuristics 4, 161–171 (1998)

    Google Scholar 

  208. M.G.C. Resende, T.A. Feo, A GRASP for satisfiability, in Cliques, Coloring, and Satisfiability: The Second DIMACS Implementation Challenge, ed. by D.S. Johnson, M.A. Trick. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 26 (American Mathematical Society, Providence, 1996), pp. 499–520

    Google Scholar 

  209. L.I.P. Resende, M.G.C. Resende, A GRASP for frame relay permanent virtual circuit routing, in Extended Abstracts of the III Metaheuristics International Conference, ed. by C.C. Ribeiro, P. Hansen, Angra dos Reis, pp. 397–401 (1999)

    Google Scholar 

  210. M.G.C. Resende, C.C. Ribeiro, A GRASP for graph planarization. Networks 29, 173–189 (1997)

    Google Scholar 

  211. M.G.C. Resende, C.C. Ribeiro, Graph planarization, in Encyclopedia of Optimization, vol. 2, ed. by C. Floudas, P.M. Pardalos (Kluwer Academic Publishers, Boston, 2001), pp. 368–373

    Google Scholar 

  212. M.G.C. Resende, C.C. Ribeiro, A GRASP with path-relinking for private virtual circuit routing. Networks 41, 104–114 (2003)

    Google Scholar 

  213. M.G.C. Resende, C.C. Ribeiro, GRASP with path-relinking: recent advances and applications, in Metaheuristics: Progress as Real Problem Solvers, ed. by T. Ibaraki, K. Nonobe, M. Yagiura (Springer, Boston, 2005), pp. 29–63

    Google Scholar 

  214. M.G.C. Resende, C.C. Ribeiro, Restart strategies for GRASP with path-relinking heuristics. Optim. Lett. 5, 467–478 (2011)

    Google Scholar 

  215. M.G.C. Resende, C.C. Ribeiro, Optimization by GRASP: Greedy Randomized Adaptive Search Procedures (Springer, New York, 2016)

    Google Scholar 

  216. M.G.C. Resende, R.F. Werneck, A hybrid heuristic for the p-median problem. J. Heuristics 10, 59–88 (2004)

    Google Scholar 

  217. M.G.C. Resende, R.F. Werneck, A hybrid multistart heuristic for the uncapacitated facility location problem. Eur. J. Oper. Res. 174, 54–68 (2006)

    Google Scholar 

  218. M.G.C. Resende, P.M. Pardalos, Y. Li, Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Trans. Math. Softw. 22, 104–118 (1996)

    Google Scholar 

  219. M.G.C. Resende, L.S. Pitsoulis, P.M. Pardalos, Approximate solution of weighted MAX-SAT problems using GRASP, in Satisfiability Problems, ed. by J. Gu, P.M. Pardalos. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 35 (American Mathematical Society, Providence, 1997), pp. 393–405

    Google Scholar 

  220. M.G.C. Resende, T.A. Feo, S.H. Smith, Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP. ACM Trans. Math. Softw. 24, 386–394 (1998)

    Google Scholar 

  221. M.G.C. Resende, L.S. Pitsoulis, P.M. Pardalos, Fortran subroutines for computing approximate solutions of MAX-SAT problems using GRASP. Discret. Appl. Math. 100, 95–113 (2000)

    Google Scholar 

  222. M.G.C. Resende, R. Martí, M. Gallego, A. Duarte, GRASP and path relinking for the max-min diversity problem. Comput. Oper. Res. 37, 498–508 (2010)

    Google Scholar 

  223. A.P. Reynolds, B. de la Iglesia, A multi-objective GRASP for partial classification. Soft Comput. 13, 227–243 (2009)

    Google Scholar 

  224. C.C. Ribeiro, GRASP: Une métaheuristique gloutone et probabiliste, in Optimisation Approchée en Recherche Opérationnelle, ed. by J. Teghem, M. Pirlot (Hermès, Paris, 2002), pp. 153–176

    Google Scholar 

  225. C.C. Ribeiro, Sports scheduling: problems and applications. Int. Trans. Oper. Res. 19, 201–226 (2012)

    Google Scholar 

  226. C.C. Ribeiro, M.G.C. Resende, Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP. ACM Trans. Math. Softw. 25, 342–352 (1999)

    Google Scholar 

  227. C.C. Ribeiro, I. Rosseti, Efficient parallel cooperative implementations of GRASP heuristics. Parallel Comput. 33, 21–35 (2007)

    Google Scholar 

  228. C.C. Ribeiro, I. Rosseti, tttplots-compare: A perl program to compare time-to-target plots or general runtime distributions of randomized algorithms. Optim. Lett. 9, 601–614 (2015)

    Google Scholar 

  229. C.C. Ribeiro, M.C. Souza, Variable neighborhood search for the degree constrained minimum spanning tree problem. Discret. Appl. Math. 118, 43–54 (2002)

    Google Scholar 

  230. C.C. Ribeiro, S. Urrutia, Heuristics for the mirrored traveling tournament problem. Eur. J. Oper. Res. 179, 775–787 (2007)

    Google Scholar 

  231. C.C. Ribeiro, D.S. Vianna, A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure. Int. Trans. Oper. Res. 12, 325–338 (2005)

    Google Scholar 

  232. C.C. Ribeiro, C.D. Ribeiro, R.S. Lanzelotte, Query optimization in distributed relational databases. J. Heuristics 3, 5–23 (1997)

    Google Scholar 

  233. C.C. Ribeiro, E. Uchoa, R.F. Werneck, A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS J. Comput. 14, 228–246 (2002)

    Google Scholar 

  234. C.C. Ribeiro, S.L. Martins, I. Rosseti, Metaheuristics for optimization problems in computer communications. Comput. Comuun. 30, 656–669 (2007)

    Google Scholar 

  235. C.C. Ribeiro, I. Rosseti, R. Vallejos, On the use of run time distributions to evaluate and compare stochastic local search algorithms, in Engineering Stochastic Local Search Algorithms, ed. by T. Sttzle, M. Biratari, and H.H. Hoos. Lecture Notes in Computer Science, vol. 5752 (Springer, Berlin, 2009), pp. 16–30

    Google Scholar 

  236. C.C. Ribeiro, I. Rosseti, R. Vallejos, Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms. J. Glob. Optim. 54, 405–429 (2012)

    Google Scholar 

  237. R.Z. Ríos-Mercado, J.F. Bard, Heuristics for the flow line problem with setup costs. Eur. J. Oper. Res. 110, 76–98 (1998)

    Google Scholar 

  238. R.Z. Ríos-Mercado, J.F. Bard, An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup costs. J. Heuristics 5, 57–74 (1999)

    Google Scholar 

  239. R.Z. Ríos-Mercado, E. Fernández. A reactive GRASP for a commercial territory design problem with multiple balancing requirements. Comput. Oper. Res. 36, 755–776 (2009)

    Google Scholar 

  240. A. Riva, F. Amigoni, A GRASP metaheuristic for the coverage of grid environments with limited-footprint tools, in Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS ’17, Richland, SC, pp. 484–491. International Foundation for Autonomous Agents and Multiagent Systems (2017)

    Google Scholar 

  241. A.J. Robertson, A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem. Comput. Optim. Appl. 19, 145–164 (2001)

    Google Scholar 

  242. P.L. Rocha, M.G. Ravetti, G.R. Mateus, 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, in Proceedings of the 4th EU/ME Workshop: Design and Evaluation of Advanced Hybrid Meta-Heuristics, vol. 1 (2004), pp. 62–67

    Google Scholar 

  243. F.J. Rodriguez, C. Blum, C. García-Martínez, M. Lozano, GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times. Ann. Oper. Res. 201, 383–401 (2012)

    Google Scholar 

  244. F.J. Rodriguez, F. Glover, C. García-Martínez, R. Martí, M. Lozano, Grasp with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem. Comput. Oper. Res. 78, 243–254 (2017)

    Google Scholar 

  245. M.A. Salazar-Aguilar, R.Z. Ríos-Mercado, J.L. González-Velarde, GRASP strategies for a bi-objective commercial territory design problem. J. Heuristics 19, 179–200 (2013)

    Google Scholar 

  246. J. Santamaría, O. Cordón, S. Damas, R. Martí, R.J. Palma, GRASP & evolutionary path relinking for medical image registration based on point matching, in 2010 IEEE Congress on Evolutionary Computation (IEEE, New York, 2010), pp. 1–8

    Google Scholar 

  247. J. Santamaría, O. Cordón, S. Damas, R. Martí, R.J. Palma, GRASP and path relinking hybridizations for the point matching-based image registration problem. J. Heuristics 18, 169–192 (2012)

    Google Scholar 

  248. D. Santos, A. de Sousa, F. Alvelos, A hybrid column generation with GRASP and path relinking for the network load balancing problem. Comput. Oper. Res. 40, 3147–3158 (2013)

    Google Scholar 

  249. M. Scaparra, R. Church, A GRASP and path relinking heuristic for rural road network development. J. Heuristics 11, 89–108 (2005)

    Google Scholar 

  250. I.V. Sergienko, V.P. Shilo, V.A. Roshchin, Optimization parallelizing for discrete programming problems. Cybern. Syst. Anal. 40, 184–189 (2004)

    Google Scholar 

  251. O.V. Shylo, T. Middelkoop, P.M. Pardalos, Restart strategies in optimization: parallel and serial cases. Parallel Comput. 37, 60–68 (2011)

    Google Scholar 

  252. O.V. Shylo, O.A. Prokopyev, J. Rajgopal, On algorithm portfolios and restart strategies. Oper. Res. Lett. 39, 49–52 (2011)

    Google Scholar 

  253. F. Silva, D. Serra, Locating emergency services with different priorities: the priority queuing covering location problem. J. Oper. Res. Soc. 59, 1229–1238 (2007)

    Google Scholar 

  254. R.M.A. Silva, M.G.C. Resende, P.M. Pardalos, M.J. Hirsch, A Python/C library for bound-constrained global optimization with continuous GRASP. Optim. Lett. 7, 967–984 (2013)

    Google Scholar 

  255. R.M.A. Silva, M.G.C. Resende, P.M. Pardalos, G.R. Mateus, G. de Tomi, GRASP with path-relinking for facility layout, in Models, Algorithms, and Technologies for Network Analysis, ed. by B.I. Goldengorin, V.A. Kalyagin, P.M. Pardalos. Springer Proceedings in Mathematics and Statistics, vol. 59 (Springer, Berlin, 2013), pp. 175–190

    Google Scholar 

  256. D. Sosnowska, Optimization of a simplified fleet assignment problem with metaheuristics: simulated annealing and GRASP, in Approximation and Complexity in Numerical Optimization, ed. by P.M. Pardalos (Kluwer Academic Publishers, Dordrecht, 2000)

    Google Scholar 

  257. M.C. Souza, C. Duhamel, C.C. Ribeiro, A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy, in Metaheuristics: Computer Decision-Making, ed. by M.G.C. Resende, J. Souza (Kluwer Academic Publisher, Dordrecht, 2004), pp. 627–658

    Google Scholar 

  258. A. Srinivasan, K.G. Ramakrishnan, K. Kumaram, M. Aravamudam, S. Naqvi, Optimal design of signaling networks for Internet telephony, in IEEE INFOCOM 2000, vol. 2 (2000), pp. 707–716

    Google Scholar 

  259. H. Takahashi, A. Matsuyama, An approximate solution for the Steiner problem in graphs. Math. Jpn. 24, 573–577 (1980)

    Google Scholar 

  260. T.L. Urban, Solution procedures for the dynamic facility layout problem. Ann. Oper. Res. 76, 323–342 (1998)

    Google Scholar 

  261. T.L. Urban, W.-C. Chiang, R.A. Russel, The integrated machine allocation and layout problem. Int. J. Prod. Res. 38, 2913–2930 (2000)

    Google Scholar 

  262. F.L. Usberti, P.M. França, A.L.M. França, GRASP with evolutionary path-relinking for the capacitated arc routing problem. Comput. Oper. Res. 40, 3206–3217 (2013)

    Google Scholar 

  263. J.X. Vianna Neto, D.L.A. Bernert, L.S. Coelho, Continuous GRASP algorithm applied to economic dispatch problem of thermal units, in Proceedings of the 13th Brazilian Congress of Thermal Sciences and Engineering, Uberlandia (2010)

    Google Scholar 

  264. J.G. Villegas, C. Prins, C. Prodhon, A.L. Medaglia, N. Velasco, GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots. Eng. Appl. Artif. Intelli. 23, 780–794 (2010)

    Google Scholar 

  265. J.G. Villegas, C. Prins, C. Prodhon, A.L. Medaglia, N. Velasco, A GRASP with evolutionary path relinking for the truck and trailer routing problem. Comput. Oper. Res. 38, 1319–1334 (2011)

    Google Scholar 

  266. D.L. Woodruff, E. Zemel, Hashing vectors for tabu search. Ann. Oper. Res. 41, 123–137 (1993)

    Google Scholar 

  267. J.Y. Xu, S.Y. Chiu, Effective heuristic procedure for a field technician scheduling problem. J. Heuristics 7, 495–509 (2001)

    Google Scholar 

  268. J. Yen, M. Carlsson, M. Chang, J.M. Garcia, H. Nguyen, Constraint solving for inkjet print mask design. J. Imaging Sci. Technol. 44, 391–397 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Amazon.com, Seattle, WA, USA

    Mauricio G. C. Resende

  2. University of Washington, Seattle, WA, USA

    Mauricio G. C. Resende

  3. Universidade Federal Fluminense, Niterói, Rio de Janeiro, Brazil

    Celso C. Ribeiro

Authors
  1. Mauricio G. C. Resende
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Celso C. Ribeiro
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mauricio G. C. Resende .

Editor information

Editors and Affiliations

  1. Department of Mathematics and Industrial Engineering, Polytechnique Montréal, Montreal, QC, Canada

    Michel Gendreau

  2. Département d’informatique et de recherche opérationnelle, Université de Montréal, Montreal, QC, Canada

    Jean-Yves Potvin

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Resende, M.G.C., Ribeiro, C.C. (2019). Greedy Randomized Adaptive Search Procedures: Advances and Extensions. In: Gendreau, M., Potvin, JY. (eds) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol 272. Springer, Cham. https://doi.org/10.1007/978-3-319-91086-4_6

Download citation

Publish with us

Policies and ethics

Search

Navigation