GRASP: Greedy Randomized Adaptive Search Procedures

Chapter

Abstract

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. An intensification strategy based on path-relinking is frequently used to improve solution quality and to reduce computation times by exploring elite solutions previously found along the search. This chapter describes the basic components of GRASP, successful implementation strategies, and effective hybridizations with path-relinking and other metaheuristics. We also list some tricks to be used in the quest for good implementations. The bibliography is enriched by an account of relevant applications and by links to surveys, software, and additional sources of material.

References

  1. Abdinnour-Helm S, Hadley SW (2000) Tabu search based heuristics for multi-floor facility layout. Int J Prod Res 38:365–383Google Scholar
  2. Abello J, Pardalos PM, Resende MGC (1999) On maximum clique problems in very large graphs. In: Abello J, Vitter J (eds) External memory algorithms and visualization, DIMACS 50. AMS, Providence, pp 199–130Google Scholar
  3. Abello J, Resende MGC, Sudarsky S (2002) Massive quasi-clique detection. In: Rajsbaum S (ed) LATIN 2002: theoretical informatics. LNCS 2286. Springer, Berlin, pp 598–612Google Scholar
  4. Ahuja RK, Orlin JB, Tiwari A (2000) A greedy genetic algorithm for the quadratic assignment problem. Comput Oper Res 27:917–934Google Scholar
  5. Ahuja RK, Orlin JB, Sharma D (2001) Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Math Program 91:71–97Google Scholar
  6. Aiex RM, Resende MGC, Ribeiro CC (2002) Probability distribution of solution time in GRASP: an experimental investigation. J Heuristics 8:343–373Google Scholar
  7. Aiex RM, Binato S, Resende MGC (2003) Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput 29:393–430Google Scholar
  8. Aiex RM, Pardalos PM, Resende MGC, Toraldo G (2005) GRASP with path-relinking for three-index assignment. INFORMS J Comput 17:224–247Google Scholar
  9. Aiex RM, Resende MGC, Ribeiro CC (2007) TTTPLOTS: a Perl program to create time-to-target plots. Optim Lett 1:355–366Google Scholar
  10. Aloise DJ, Aloise D, Rocha CTM, Ribeiro CC, Ribeiro Filho JC, Moura LSS (2006) Scheduling workover rigs for onshore oil production. Discret Appl Math 154:695–702Google Scholar
  11. Álvarez-Valdés R, Parreño F, Tamarit JM (2005) A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems. J Oper Res Soc 56:414–425Google Scholar
  12. Álvarez-Valdés R, Crespo E, Tamarit JM, Villa F (2008a) GRASP and path relinking for project scheduling under partially renewable resources. Eur J Oper Res 189:1153–1170Google Scholar
  13. Álvarez-Valdés R, Parreño F, Tamarit JM (2008b) Reactive GRASP for the strip-packing problem. Comput Oper Res 35:1065–1083Google Scholar
  14. Amaldi E, Capone A, Malucelli F (2003) Planning UMTS base station location: optimization models with power control and algorithms. IEEE Trans Wirel Commun 2:939–952Google Scholar
  15. Andrade DV, Resende MGC (2006) A GRASP for PBX telephone migration scheduling. In: Proc 8th INFORMS telecoms, Dallas, TXGoogle Scholar
  16. Andreatta AA, Ribeiro CC (2002) Heuristics for the phylogeny problem. J Heuristics 8:429–447Google Scholar
  17. Areibi S, Vannelli A (1997) A GRASP clustering technique for circuit partitioning. In: Gu J, Pardalos PM (eds) Satisfiability problems, DIMACS 35. AMS, Providence, pp 711–724Google Scholar
  18. Argüello MF, Bard JF, Yu G (1997) A GRASP for aircraft routing in response to groundings and delays. J Comb Optim 1:211–228Google Scholar
  19. Armony M, Klincewicz JC, Luss H, Rosenwein MB (2000) Design of stacked self-healing rings using a genetic algorithm. J Heuristics 6:85–105Google Scholar
  20. Arroyo JEC, Vieira PS, Vianna DS (2008) A GRASP algorithm for the multi-criteria minimum spanning tree problem. Ann Oper Res 159:125–133Google Scholar
  21. Bard JF, Feo TA (1989) Operations sequencing in discrete parts manufacturing. Manage Sci 35:249–255Google Scholar
  22. Bard JF, Feo TA (1991) An algorithm for the manufacturing equipment selection problem. IIE Trans 23:83–92Google Scholar
  23. Bard JF, Feo TA, Holland S (1996) A GRASP for scheduling printed wiring board assembly. IIE Trans 28:155–165Google Scholar
  24. Beltrán JD, Calderón JE, Cabrera RJ, Pérez JAM, Moreno-Vega JM (2004) GRASP/VNS hybrid for the strip packing problem. In: Proc hybrid metaheuristics, Valencia, Spain, pp 79–90Google Scholar
  25. Binato S, Oliveira GC (2002) A reactive GRASP for transmission network expansion planning. In: Ribeiro CC, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer, Dordrecht, pp 81–100Google Scholar
  26. Binato S, Oliveira GC, Araújo JL (2001) A greedy randomized adaptive search procedure for transmission expansion planning. IEEE Trans Power Syst 16:247–253Google Scholar
  27. Binato S, Hery WJ, Loewenstern D, Resende MGC (2002) A GRASP for job shop scheduling. In: Ribeiro CC, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer, Dordrecht, pp 59–79Google Scholar
  28. Birgin EG, Martínez JM (2002) Large-scale active-set box-constrained optimization method with spectral projected gradients. Comput Optim Appl 23:101–125Google Scholar
  29. Birgin EG, Gozzi EM, Resende MGC, Silva RMA (2010) Continuous GRASP with a local active-set method for bound-constrained global optimization. J Glob Optim 48:289–310Google Scholar
  30. Boudia M, Louly MAO, Prins C (2007) A reactive GRASP and path relinking for a combined production-distribution problem. Comput Oper Res 34:3402–3419Google Scholar
  31. Canuto SA, Resende MGC, Ribeiro CC (2001) Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 38:50–58Google Scholar
  32. Colomé R, Serra D (2001) Consumer choice in competitive location models: formulations and heuristics. Pap Reg Sci 80:439–464Google Scholar
  33. Commander CW, Butenko SI, Pardalos PM, Oliveira CAS (2004) Reactive GRASP with path relinking for the broadcast scheduling problem. In: Proceedings of the 40th Annual International telemetry conference, San Diego, CA, pp 792–800Google Scholar
  34. Corberán A, Martí R, Sanchís JM (2002) A GRASP heuristic for the mixed Chinese postman problem. Eur J Oper Res 142:70–80Google Scholar
  35. Cravo GL, Ribeiro GM, Nogueira Lorena LA (2008) A greedy randomized adaptive search procedure for the point-feature cartographic label placement. Comput Geosci 34:373–386Google Scholar
  36. Cung V-D, Martins SL, Ribeiro CC, Roucairol C (2002) Strategies for the parallel implementation of metaheuristics. In: Ribeiro CC, Ribeiro CC (eds) Essays and surveys in metaheuristics. Kluwer, Dordrecht, pp 263–308Google Scholar
  37. Delmaire H, Díaz JA, Fernández E, Ortega M (1999) Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem. INFOR 37:194–225Google Scholar
  38. Deshpande AS, Triantaphyllou E (1998) A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions. Math Comput Model 27:75–99Google Scholar
  39. Duarte AR, Ribeiro CC, Urrutia S (2007a) A hybrid ILS heuristic to the referee assignment problem with an embedded MIP strategy. In: Hybrid metaheuristics. LNCS 4771. Springer, Berlin, pp 82–95Google Scholar
  40. Duarte AR, Ribeiro CC, Urrutia S, Haeusler EH (2007b) Referee assignment in sports leagues. In: PATAT VI. LNCS 3867. Springer, Berlin, pp 158–173Google Scholar
  41. Faria H Jr, Binato S, Resende MGC, Falcão DJ (2005) Transmission network design by a greedy randomized adaptive path relinking approach. IEEE Trans Power Syst 20:43–49Google Scholar
  42. Feo TA, Bard JF (1989) Flight scheduling and maintenance base planning. Manage Sci 35:1415–1432Google Scholar
  43. Feo TA, González-Velarde JL (1995) The intermodal trailer assignment problem: models, algorithms, and heuristics. Transp Sci 29:330–341Google Scholar
  44. Feo TA, Resende MGC (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8:67–71Google Scholar
  45. Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109–133Google Scholar
  46. Feo TA, Venkatraman K, Bard JF (1991) A GRASP for a difficult single machine scheduling problem. Comput Oper Res 18:635–643Google Scholar
  47. Feo TA, Resende MGC, Smith SH (1994) A greedy randomized adaptive search procedure for maximum independent set. Oper Res 42:860–878Google Scholar
  48. Feo TA, Bard JF, Holland S (1995) Facility-wide planning and scheduling of printed wiring board assembly. Oper Res 43:219–230Google Scholar
  49. Feo TA, Sarathy K, McGahan J (1996) A GRASP for single machine scheduling with sequence dependent setup costs and linear delay penalties. Comput Oper Res 23:881–895Google Scholar
  50. Fernández E, Martí R (1999) GRASP for seam drawing in mosaicking of aerial photographic maps. J Heuristics 5:181–197Google Scholar
  51. Festa P, Resende MGC (2002) GRASP: an annotated bibliography. In: Ribeiro CC, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer, Dordrecht, pp 325–367Google Scholar
  52. Festa P, Resende MGC (2009a) An annotated bibliography of GRASP, part I: algorithms. Int Trans Oper Res 16:1–24Google Scholar
  53. Festa P, Resende MGC (2009b) An annotated bibliography of GRASP, part II: applications. Int Trans Oper Res 16:131–172Google Scholar
  54. Festa P, Pardalos PM, Resende MGC (2001) Algorithm 815: FORTRAN subroutines for computing approximate solution to feedback set problems using GRASP. ACM Trans Math Softw 27:456–464Google Scholar
  55. Festa P, Pardalos PM, Resende MGC, Ribeiro CC (2002) Randomized heuristics for the MAX-CUT problem. Optim Methods Softw 7:1033–1058Google Scholar
  56. Festa P, Pardalos PM, Pitsoulis LS, Resende MGC (2006) GRASP with path-relinking for the weighted MAXSAT problem. ACM J Exp Algorithm 11:1–16Google Scholar
  57. Fleurent C, Glover F (1999) Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS J Comput 11:198–204Google Scholar
  58. Glover F (1996) Tabu search and adaptive memory programing—advances, applications and challenges. In: Barr RS, Helgasonm RV, Kennington JL (eds) Interfaces in computer science and operations research. Kluwer, Dordrecht, pp 1–75Google Scholar
  59. Glover F, Laguna M (1997) Tabu search. Kluwer, DordrechtGoogle Scholar
  60. Glover F, Laguna M, Martí R (2000) Fundamentals of scatter search and path relinking. Control Cybern 39:653–684Google Scholar
  61. Hammer PL, Rader DJ Jr (2001) Maximally disjoint solutions of the set covering problem. J Heuristics 7:131–144Google Scholar
  62. Han BT, Raja VT (2003) A GRASP heuristic for solving an extended capacitated concentrator location problem. Int J Inf Technol Decis Making 2:597–617Google Scholar
  63. Hansen P, Mladenović N (2003) Variable neighborhood search. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer, Dordrecht, pp 145–184Google Scholar
  64. Hirsch MJ (2006) GRASP-based heuristics for continuous global optimization problems. PhD thesis, University of FloridaGoogle Scholar
  65. Hirsch MJ, Ortiz-Pena H (2009) UAV cooperative control for multiple target tracking. In: Du D-Z, Pardalos PM (eds) DIMACS/DyDAn workshop on approximation algorithms in wireless ad hoc and sensor networks, Piscataway, NJGoogle Scholar
  66. Hirsch MJ, Pardalos PM, Resende MGC (2006) Sensor registration in a sensor network by continuous GRASP. In: Proceeding of the MILCOM 2006, Washington, DCGoogle Scholar
  67. Hirsch MJ, Meneses CN, Pardalos PM, Ragle MA, Resende MGC (2007a) A Continuous GRASP to determine the relationship between drugs and adverse reactions. In: Seref O, Kundakcioglu OE, Pardalos PM (eds) Data Mining, systems analysis, and optimization in biomedicine. American Institute of Physics, New York, pp 106–121Google Scholar
  68. Hirsch MJ, Meneses CN, Pardalos PM, Resende MGC (2007b) Global optimization by continuous GRASP. Optim Lett 1:201–212Google Scholar
  69. Hirsch MJ, Ortiz-Pena H, Sapankevych N, Neese R (2007c) Efficient flight formation for tracking of a ground target. In: Proceeding of the National Fire Control Symposium, San Diego, CAGoogle Scholar
  70. Hirsch MJ, Pardalos PM, Resende MGC (2009) Solving systems of nonlinear equations using continuous GRASP. Nonlinear Anal Real World Appl 10:2000–2006Google Scholar
  71. Hirsch MJ, Pardalos PM, Resende MGC (2010) Speeding up continuous GRASP. Eur J Oper Res 205:507–521Google Scholar
  72. Holmqvist K, Migdalas A, Pardalos PM (1997) Greedy randomized adaptive search for a location problem with economies of scale. In: Bomze IM et al (eds) Developments in global optimization. Kluwer, Dordrecht, pp 301–313Google Scholar
  73. Holmqvist K, Migdalas A, Pardalos PM (1998) A GRASP algorithm for the single source uncapacitated minimum concave-cost network flow problem. In: Pardalos PM, Du D-Z (eds) Network design: connectivity and facilities location, DIMACS 40. AMS, Providence, pp 131–142Google Scholar
  74. Hoos HH, Stützle T (1998) Evaluating Las Vegas algorithms—pitfalls and remedies. In: Proceedings of the 14th Conference on uncertainty in artificial intelligence, Madison, WI, pp 238–245Google Scholar
  75. Klincewicz JG (1992) Avoiding local optima in the p-hub location problem using tabu search and GRASP. Ann Oper Res 40:283–302Google Scholar
  76. Klincewicz JG, Rajan A (1994) Using GRASP to solve the component grouping problem. Nav Res Logist 41:893–912Google Scholar
  77. Kontoravdis G, Bard JF (1995) A GRASP for the vehicle routing problem with time windows. ORSA J Comput 7:10–23Google Scholar
  78. Laguna M, González-Velarde JL (1991) A search heuristic for just-in-time scheduling in parallel machines. J Intell Manuf 2:253–260Google Scholar
  79. Laguna M, Martí R (1999) GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J Comput 11:44–52Google Scholar
  80. Laguna M, Martí R (2001) A GRASP for coloring sparse graphs. Comput Optim Appl 19:165–178Google Scholar
  81. Laguna M, Feo TA, Elrod HC (1994) A greedy randomized adaptive search procedure for the two-partition problem. Oper Res 42:677–687Google Scholar
  82. Li Y, Pardalos PM, Resende MGC (1994) A greedy randomized adaptive search procedure for the quadratic assignment problem. In: Pardalos PM, Wolkowicz H (eds) Quadratic assignment and related problems, DIMACS 16. AMS, Providence, pp 237–261Google Scholar
  83. Lourenço HR, Martin OC, Stützle T (2003) Iterated local search. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer, Dordrecht, pp 321–353Google Scholar
  84. Martí R (2001) Arc crossing minimization in graphs with GRASP. IIE Trans 33:913–919Google Scholar
  85. Martin O, Otto SW, Felten EW (1991) Large-step Markov chains for the traveling salesman problem. Complex Syst 5:299–326Google Scholar
  86. Martins SL, Ribeiro CC, Souza MC (1998) A parallel GRASP for the Steiner problem in graphs. In: Ferreira A, Rolim J (eds) Proceedings of IRREGULAR’98. LNCS 1457. Springer, Berlin, pp 285–297Google Scholar
  87. Martins SL, Pardalos PM, Resende MGC, Ribeiro CC (1999) Greedy randomized adaptive search procedures for the Steiner problem in graphs. In: Pardalos PM, Rajasejaran S, Rolim J (eds) Randomization methods in algorithmic design, DIMACS 43. AMS, Providence, pp 133–145Google Scholar
  88. Martins SL, Resende MGC, Ribeiro CC, Pardalos P (2000) A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy. J Glob Optim 17:267–283Google Scholar
  89. Martins SL, Ribeiro CC, Rosseti I (2004) Applications and parallel implementations of metaheuristics in network design and routing. In: Applied computing. LNCS 3285. Springer, Berlin, pp 205–213Google Scholar
  90. Martins SL, Ribeiro CC, Rosseti I (2006) Applications of parallel metaheuristics to optimization problems in telecommunications and bioinformatics. In: Talbi E-G (ed) Parallel combinatorial optimization. Wiley, New York, pp 301–325Google Scholar
  91. Mateus GR, Resende MGC, Silva RMA (2011) GRASP with path-relinking for the generalized quadratic assignment problem. J Heuristics 17:527–565Google Scholar
  92. Mavridou T, Pardalos PM, Pitsoulis LS, Resende MGC (1998) A GRASP for the biquadratic assignment problem. Eur J Oper Res 105:613–621Google Scholar
  93. Murphey RA, Pardalos PM, Pitsoulis LS (1998a) A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem. In: Pardalos PM and Du D-Z (eds) Network design: connectivity and facilities location, DIMACS 40. AMS, Providence, pp 277–301Google Scholar
  94. Murphey RA, Pardalos PM, Pitsoulis LS (1998b) A parallel GRASP for the data association multidimensional assignment problem. In: Pardalos PM (ed) Parallel processing of discrete problems. The IMA volumes in mathematics and its applications 106. Springer, Berlin, pp 159–180Google Scholar
  95. Nascimento MCV, Resende MGC, Toledo FMB (2010) GRASP with path-relinking for the multi-plant capacitated plot sizing problem. Eur J Oper Res 200:747–754Google Scholar
  96. Oliveira CA, Pardalos PM, Resende MGC (2004) GRASP with path-relinking for the quadratic assignment problem. In: Ribeiro CC, Martins SL (eds) Proceedings of III workshop on efficient and experimental algorithms. LNCS 3059. Springer, Berlin, pp 356–368Google Scholar
  97. Osman IH, Al-Ayoubi B, Barake M (2003) A greedy random adaptive search procedure for the weighted maximal planar graph problem. Comput Ind Eng 45:635–651Google Scholar
  98. Pardalos PM, Pitsoulis LS, Resende MGC (1995) A parallel GRASP implementation for the quadratic assignment problem. In: Ferreira A, Rolim J (eds) Parallel algorithms for irregularly structured problems—IRREGULAR’94. Kluwer, Dordrecht, pp 115–133Google Scholar
  99. Pardalos PM, Pitsoulis LS, Resende MGC (1996) A parallel GRASP for MAX-SAT problems. LNCS 1184. Springer, Berlin/New York, pp 575–585Google Scholar
  100. Pardalos PM, Pitsoulis LS, Resende MGC (1997) Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP. ACM Trans Math Softw 23:196–208Google Scholar
  101. Pardalos PM, Qian T, Resende MGC (1999) A greedy randomized adaptive search procedure for the feedback vertex set problem. J Comb Optim 2:399–412Google Scholar
  102. Piñana E, Plana I, Campos V, Martí R (2004) GRASP and path relinking for the matrix bandwidth minimization. Eur J Oper Res 153:200–210Google Scholar
  103. Pitsoulis LS, Pardalos PM, Hearn DW (2001) Approximate solutions to the turbine balancing problem. Eur J Oper Res 130:147–155Google Scholar
  104. Prais M, Ribeiro CC (2000a) Parameter variation in GRASP procedures. Investigación Operativa 9:1–20Google Scholar
  105. Prais M, Ribeiro CC (2000b) Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J Comput 12:164–176Google Scholar
  106. Reghioui M, Prins C, Labadi N (2007) GRASP with path relinking for the capacitated arc routing problem with time windows. In: Giacobini M et al (eds) Applications of evolutinary computing. LNCS 4448. Springer, Berlin, pp 722–731Google Scholar
  107. Resende MGC (1998) Computing approximate solutions of the maximum covering problem using GRASP. J Heuristics 4:161–171Google Scholar
  108. Resende MGC (2008) Metaheuristic hybridization with greedy randomized adaptive search procedures. In: Chen Z-L, Raghavan S (eds) TutORials in operations research. INFORMS, Hanover, pp 295–319Google Scholar
  109. Resende MGC, Feo TA (1996) A GRASP for satisfiability. In: Johnson DS, Trick MA (eds) Cliques, coloring, and satisfiability: the second DIMACS implementation challenge, DIMACS 26. AMS, Providence, pp 499–520Google Scholar
  110. Resende LIP, Resende MGC (1999) A GRASP for frame relay permanent virtual circuit routing. In: Ribeiro CC, Hansen P (eds) Extended abstracts of the III metaheuristics International Conference, Angra dos Reis, Brazil, pp 397–401Google Scholar
  111. Resende MGC, Ribeiro CC (1997) A GRASP for graph planarization. Networks 29:173–189Google Scholar
  112. Resende MGC, Ribeiro CC (2003a) A GRASP with path-relinking for private virtual circuit routing. Networks 41:104–114Google Scholar
  113. Resende MGC, Ribeiro CC (2003b) Greedy randomized adaptive search procedures. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer, Dordrecht, pp 219–249Google Scholar
  114. Resende MGC, Ribeiro CC (2005a) GRASP with path-relinking: recent advances and applications. In: Ibaraki T, Nonobe K, Yagiura M (eds) Metaheuristics: progress as real problem solvers. Springer, Berlin, pp 29–63Google Scholar
  115. Resende MGC, Ribeiro CC (2005b) Parallel greedy randomized adaptive search procedures. In: Alba E (ed) Parallel metaheuristics: a new class of algorithms. Wiley, New York, pp 315–346Google Scholar
  116. Resende MGC, Ribeiro CC (2010) Greedy randomized adaptive search procedures: advances and applications. In: Gendreau M, Potvin J-Y (eds) Handbook of metaheuristics, 2nd edn. Springer, Berlin, pp 293–319Google Scholar
  117. Resende MGC, Werneck RF (2004) A hybrid heuristic for the p-median problem. J Heuristics 10:59–88Google Scholar
  118. Resende MGC, Werneck RF (2006) A hybrid multistart heuristic for the uncapacitated facility location problem. Eur J Oper Res 174:54–68Google Scholar
  119. Resende MGC, Pardalos PM, Li Y (1996) Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Trans Math Softw 22:104–118Google Scholar
  120. Resende MGC, Pitsoulis LS, Pardalos PM (1997) Approximate solution of weighted MAX-SAT problems using GRASP. In: Gu J, Pardalos PM (eds) Satisfiability problems, DIMACS 35. AMS, Providence, pp 393–405Google Scholar
  121. Resende MGC, Feo TA, Smith SH (1998) Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP. ACM Trans Math Softw 24:386–394Google Scholar
  122. Resende MGC, Pitsoulis LS, Pardalos PM (2000) Fortran subroutines for computing approximate solutions of MAX-SAT problems using GRASP. Discret Appl Math 100:95–113Google Scholar
  123. Resende MGC, Martí R, Gallego, M, Duarte A (2010) GRASP and path relinking for the max–min diversity problem. Comput Oper Res 37:498–508Google Scholar
  124. Ribeiro CC, Resende MGC (1999) Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP. ACM Trans Math Softw 25:342–352Google Scholar
  125. Ribeiro CC, Resende MGC (2012) Path-relinking intensification methods for stochastic local search algorithms. J Heuristics 18:193–214Google Scholar
  126. Ribeiro CC, Rosseti I (2002) A parallel GRASP heuristic for the 2-path network design problem. LNCS 2400. Springer, Berlin, pp 922–926Google Scholar
  127. Ribeiro CC, Rosseti I (2007) Efficient parallel cooperative implementations of GRASP heuristics. Parallel Comput 33:21–35Google Scholar
  128. Ribeiro CC, Souza MC (2000) Tabu search for the Steiner problem in graphs. Networks 36:138–146Google Scholar
  129. Ribeiro CC, Urrutia S (2007) Heuristics for the mirrored traveling tournament problem. Eur J Oper Res 179:775–787Google Scholar
  130. Ribeiro CC, Vianna DS (2005) A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure. Int Trans Oper Res 12:325–338Google Scholar
  131. Ribeiro CC, Uchoa E, Werneck RF (2002) A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS J Comput 14:228–246Google Scholar
  132. Ribeiro MH, Plastino A, Martins SL (2006) Hybridization of GRASP metaheuristic with data mining techniques. J Math Model Algorithm 5:23–41Google Scholar
  133. Ribeiro CC, Martins SL, Rosseti I (2007) Metaheuristics for optimization problems in computer communications. Comput Commun 30:656–669Google Scholar
  134. Ribeiro CC, Rosseti I, Souza RC (2011) Effective probabilistic stopping rules for randomized metaheuristics: GRASP implementations. LNCS 6683. Springer, Berlin, pp 146–160Google Scholar
  135. Ríos-Mercado RZ, Bard JF (1998) Heuristics for the flow line problem with setup costs. Eur J Oper Res 110:76–98Google Scholar
  136. Ríos-Mercado RZ, Bard JF (1999) An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup costs. J Heuristics 5:57–74Google Scholar
  137. Robertson AJ (2001) A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem. Comput Optim Appl 19:145–164Google Scholar
  138. Santos LF, Martins SL, Plastino A (2008) Applications of the DM-GRASP heuristic: a survey. Int Trans Oper Res 15:387–416Google Scholar
  139. Scaparra M, Church R (2005) A GRASP and path relinking heuristic for rural road network development. J Heuristics 11:89–108Google Scholar
  140. Souza MC, Duhamel C, Ribeiro CC (2004) A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy. In: Resende MGC, de Sousa JP (eds) Metaheuristics: computer decision-making. Kluwer, Dordrecht, pp 627–658Google Scholar
  141. Srinivasan A, Ramakrishnan KG, Kumaram K, Aravamudam M, Naqvi S (2000) Optimal design of signaling networks for Internet telephony. In: IEEE INFOCOM 2000, Tel Aviv, Israel, vol 2, pp 707–716Google Scholar
  142. Urban TL (1998) Solution procedures for the dynamic facility layout problem. Ann Oper Res 76:323–342Google Scholar
  143. Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67–82Google Scholar
  144. Xu JY, Chiu SY (2001) Effective heuristic procedure for a field technician scheduling problem. J Heuristics 7:495–509Google Scholar
  145. Yen J, Carlsson M, Chang M, Garcia JM, Nguyen H (2000) Constraint solving for inkjet print mask design. J Imaging Sci Technol 44:391–397Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Algorithms and Optimization Research DepartmentAT&T Labs ResearchFlorham ParkUSA
  2. 2.Department of Computer ScienceUniversidade Federal FluminenseNiteróiBrazil

Personalised recommendations