{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T23:05:57Z","timestamp":1775603157716,"version":"3.50.1"},"publisher-location":"Cham","reference-count":126,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319071237","type":"print"},{"value":"9783319071244","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-07124-4_23","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T15:09:59Z","timestamp":1534172999000},"page":"465-488","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["GRASP"],"prefix":"10.1007","author":[{"given":"Paola","family":"Festa","sequence":"first","affiliation":[]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Abdinnour-Helm S, Hadley S (2000) Tabu search based heuristics for multi-floor facility layout. Int J Prod Res 38:365\u2013383","DOI":"10.1080\/002075400189464"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Abello J, Pardalos P, Resende M (1999) On maximum clique problems in very large graphs. In: Abello J, Vitter J (eds) External memory algorithms and visualization. DIMACS series on discrete mathematics and theoretical computer science, vol 50. American Mathematical Society, Providence, pp 199\u2013130","DOI":"10.1090\/dimacs\/050\/06"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Ahuja R, Orlin J, Tiwari A (2000) A greedy genetic algorithm for the quadratic assignment problem. Comput Oper Res 27:917\u2013934","DOI":"10.1016\/S0305-0548(99)00067-2"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Aiex R, Binato S, Resende M (2003) Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput 29:393\u2013430","DOI":"10.1016\/S0167-8191(03)00014-0"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Aiex R, Resende M, Pardalos P, Toraldo G (2005) GRASP with path relinking for three-index assignment. INFORMS J Comput 17(2):224\u2013247","DOI":"10.1287\/ijoc.1030.0059"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Alvarez-Valdes R, Parre\u00f1o F, Tamarit J (2005) A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems. J Oper Res Soc 56(4):414\u2013425","DOI":"10.1057\/palgrave.jors.2601829"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Alvarez-Valdes R, Parre\u00f1o F, Tamarit J (2008) Reactive GRASP for the strip-packing problem. Comput Oper Res 35(4):1065\u20131083","DOI":"10.1016\/j.cor.2006.07.004"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Amaldi E, Capone A, Malucelli F (2003) Planning UMTS base station location: optimization models with power control and algorithms. IEEE Trans Wirel Commun 2(5):939\u2013952","DOI":"10.1109\/TWC.2003.817438"},{"key":"23_CR9","unstructured":"Andrade D, Resende M (2006) A GRASP for PBX telephone migration scheduling. In: Eighth INFORMS telecommunication conference, Dallas"},{"key":"23_CR10","unstructured":"Andrade D, Resende M (2007) GRASP with path-relinking for network migration scheduling. In: Proceedings of the international network optimization conference (INOC 2007), Spa"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Andres C, Miralles C, Pastor R (2008) Balancing and scheduling tasks in assembly lines with sequence-dependent setup times. Eur J Oper Res 187(3):1212\u20131223","DOI":"10.1016\/j.ejor.2006.07.044"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Areibi S (1999) GRASP: an effective constructive technique for VLSI circuit partitioning. In: Proceedings of the IEEE Canadian conference on electrical & computer engineering (CCECE\u201999), Edmonton","DOI":"10.1109\/CCECE.1999.807242"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Areibi S, Vannelli A (1997) A GRASP clustering technique for circuit partitioning. In: Gu J, Pardalos P (eds) Satisfiability problems. DIMACS series on discrete mathematics and theoretical computer science, vol 35. American Mathematical Society, Providence, pp 711\u2013724","DOI":"10.1090\/dimacs\/035\/23"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Arg\u00fcello M, Feo T, Goldschmidt O (1996) Randomized methods for the number partitioning problem. Comput Oper Res 23(2):103\u2013111","DOI":"10.1016\/0305-0548(95)E0020-L"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Arg\u00fcello M, Bard J, Yu G (1997) A GRASP for aircraft routing in response to groundings and delays. J Comb Optim 1:211\u2013228","DOI":"10.1023\/A:1009772208981"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Armony M, Klincewicz J, Luss H, Rosenwein M (2000) Design of stacked self-healing rings using a genetic algorithm. J Heuristics 6:85\u2013105","DOI":"10.1007\/978-1-4757-5392-9_5"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Arroyo J, Vieira P, Vianna D (2008) A GRASP algorithm for the multi-criteria minimum spanning tree problem. Ann Oper Res 159:125\u2013133","DOI":"10.1007\/s10479-007-0263-4"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Atkinson J (1998) A greedy randomised search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy. J Oper Res Soc 49:700\u2013708","DOI":"10.1057\/palgrave.jors.2600521"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"B\u00e4ck T, Fogel D, Michalewicz Z (1997) Handbook of evolutionary computation. Oxford University Press, New York","DOI":"10.1201\/9781420050387"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Bard J (1997) An analysis of a rail car unloading area for a consumer products manufacturer. J Oper Res Soc 48:873\u2013883","DOI":"10.1057\/palgrave.jors.2600445"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Bard J, Feo T (1989) Operations sequencing in discrete parts manufacturing. Manag Sci 35:249\u2013255","DOI":"10.1287\/mnsc.35.2.249"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Bard J, Feo T (1991) An algorithm for the manufacturing equipment selection problem. IIE Trans 23:83\u201392","DOI":"10.1080\/07408179108963843"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Bard J, Huang L, Jaillet P, Dror M (1998) A decomposition approach to the inventory routing problem with satellite facilities. Transp Sci 32:189\u2013203","DOI":"10.1287\/trsc.32.2.189"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Binato S, Oliveira G (2002) A reactive GRASP for transmission network expansion planning. In: Ribeiro C, Hansen P (eds) Essays and surveys on metaheuristics. Kluwer Academic Publishers, Boston, pp 81\u2013100","DOI":"10.1007\/978-1-4615-1507-4_4"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Binato S, Oliveira G, Ara\u00fajo J (2001) A greedy randomized adaptive search procedure for transmission expansion planning. IEEE Trans Power Syst 16:247\u2013253","DOI":"10.1109\/59.918294"},{"key":"23_CR26","unstructured":"Binato S, Hery W, Loewenstern D, Resende M (2002) A greedy randomized adaptive search procedure for job shop scheduling. In: Ribeiro C, Hansen P (eds) Essays and surveys on metaheuristics. Kluwer Academic Publishers, Boston, pp 58\u201379"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Boudia M, Louly M, Prins C (2007) A reactive GRASP and path relinking for a combined production-distribution problem. Comput Oper Res 34:3402\u20133419","DOI":"10.1016\/j.cor.2006.02.005"},{"key":"23_CR28","unstructured":"Bresina J (1996) Heuristic-biased stochastic sampling. In: Proceedings of the thirteenth national conference on artificial intelligence (AAAI-96), Portland, pp 271\u2013278"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Canuto S, Resende M, Ribeiro C (2001) Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 38:50\u201358","DOI":"10.1002\/net.1023"},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"Carreto C, Baker B (2002) A GRASP interactive approach to the vehicle routing problem with backhauls. In: Ribeiro C, Hansen P (eds) Essays and surveys on metaheuristics. Kluwer Academic Publishers, Boston, pp 185\u2013200","DOI":"10.1007\/978-1-4615-1507-4_9"},{"key":"23_CR31","doi-asserted-by":"crossref","unstructured":"Charon I, Hudry O (1993) The noising method: a new method for combinatorial optimization. Oper Res Lett 14:133\u2013137","DOI":"10.1016\/0167-6377(93)90023-A"},{"key":"23_CR32","doi-asserted-by":"crossref","unstructured":"Charon I, Hudry O (2002) The noising methods: a survey. In: Ribeiro C, Hansen P (eds) Essays and surveys on metaheuristics. Kluwer Academic Publishers, Boston, pp 245\u2013261","DOI":"10.1007\/978-1-4615-1507-4_12"},{"key":"23_CR33","unstructured":"Commander C, Festa P, Oliveira C, Pardalos P, Resende M, Tsitselis M (2006) A greedy randomized algorithm for the cooperative communication problem on ad hoc networks. In: Eighth INFORMS telecommunications conference, Dallas"},{"key":"23_CR34","doi-asserted-by":"crossref","unstructured":"Contreras I, D\u00edaz J (2008) Scatter search for the single source capacitated facility location problem. Ann Oper Res 157:73\u201389","DOI":"10.1007\/s10479-007-0193-1"},{"key":"23_CR35","doi-asserted-by":"crossref","unstructured":"Cravo G, Ribeiro G, Lorena LN (2008) A greedy randomized adaptive search procedure for the point-feature cartographic label placement. Comput Geosci 34(4):373\u2013386","DOI":"10.1016\/j.cageo.2007.01.007"},{"key":"23_CR36","doi-asserted-by":"crossref","unstructured":"Delmaire H, D\u00edaz J, Fern\u00e1ndez E, Ortega M (1999) Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem. INFOR 37:194\u2013225","DOI":"10.1080\/03155986.1999.11732381"},{"key":"23_CR37","doi-asserted-by":"crossref","unstructured":"Deshpande A, 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\u201399","DOI":"10.1016\/S0895-7177(97)00255-0"},{"key":"23_CR38","doi-asserted-by":"crossref","unstructured":"Dorigo M, St\u00fctzle T (2004) Ant colony optimization. MIT Press, Cambridge","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"23_CR39","doi-asserted-by":"crossref","unstructured":"Faria H, Binato S, Resende M, Falc\u00e3o D (2005) Power transmission network design by a greedy randomized adaptive path relinking approach. IEEE Trans Power Syst 20(1):43\u201349","DOI":"10.1109\/TPWRS.2004.835627"},{"key":"23_CR40","doi-asserted-by":"crossref","unstructured":"Feo T, Bard J (1989) Flight scheduling and maintenance base planning. Manag Sci 35:1415\u20131432","DOI":"10.1287\/mnsc.35.12.1415"},{"key":"23_CR41","doi-asserted-by":"crossref","unstructured":"Feo T, Gonz\u00e1lez-Velarde J (1995) The intermodal trailer assignment problem: models, algorithms, and heuristics. Transp Sci 29:330\u2013341","DOI":"10.1287\/trsc.29.4.330"},{"key":"23_CR42","doi-asserted-by":"crossref","unstructured":"Feo T, Resende M (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8:67\u201371","DOI":"10.1016\/0167-6377(89)90002-3"},{"key":"23_CR43","doi-asserted-by":"crossref","unstructured":"Feo T, Resende M (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109\u2013133","DOI":"10.1007\/BF01096763"},{"key":"23_CR44","doi-asserted-by":"crossref","unstructured":"Feo T, Venkatraman K, Bard J (1991) A GRASP for a difficult single machine scheduling problem. Comput Oper Res 18:635\u2013643","DOI":"10.1016\/0305-0548(91)90001-8"},{"key":"23_CR45","doi-asserted-by":"crossref","unstructured":"Feo T, Resende M, Smith S (1994) A greedy randomized adaptive search procedure for maximum independent set. Oper Res 42:860\u2013878","DOI":"10.1287\/opre.42.5.860"},{"key":"23_CR46","doi-asserted-by":"crossref","unstructured":"Feo T, 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\u2013895","DOI":"10.1016\/0305-0548(95)00084-4"},{"key":"23_CR47","doi-asserted-by":"crossref","unstructured":"Ferone D, Festa P, Resende M (2013) Hybrid metaheuristics for the far from most string problem. In: Proceedings of 8th international workshop on hybrid metaheuristics. Lecture notes in computer science, vol 7919. Springer, Berlin\/New York, pp 174\u2013188","DOI":"10.1007\/978-3-642-38516-2_14"},{"key":"23_CR48","doi-asserted-by":"crossref","unstructured":"Ferone D, Festa P, Resende M (2016) Hybridizations of GRASDP with path-relinking for the far from most string problem. Int Trans Oper Res 23(3):481\u2013506","DOI":"10.1111\/itor.12167"},{"key":"23_CR49","doi-asserted-by":"crossref","unstructured":"Festa P (2007) On some optimization problems in molecular biology. Math Biosci 207(2):219\u2013234","DOI":"10.1016\/j.mbs.2006.11.012"},{"key":"23_CR50","doi-asserted-by":"crossref","unstructured":"Festa P, Resende M (2002) GRASP: an annotated bibliography. In: Ribeiro C, Hansen P (eds) Essays and surveys on metaheuristics. Kluwer Academic Publishers, Boston, pp 325\u2013367","DOI":"10.1007\/978-1-4615-1507-4_15"},{"key":"23_CR51","doi-asserted-by":"crossref","unstructured":"Festa P, Resende M (2013) Hybridizations of GRASP with path-relinking. In: Talbi EG (ed) Hybrid metaheuristics \u2013 studies in computational intelligence, vol 434. Springer, Berlin\/New York, pp 135\u2013155","DOI":"10.1007\/978-3-642-30671-6_5"},{"key":"23_CR52","doi-asserted-by":"crossref","unstructured":"Festa P, Resende MGC (2009) An annotated bibliography of grasp \u2013 part I: algorithms. Int Trans Oper Res 16(1):1\u201324","DOI":"10.1111\/j.1475-3995.2009.00663.x"},{"key":"23_CR53","doi-asserted-by":"crossref","unstructured":"Festa P, Resende MGC (2009) An annotated bibliography of grasp \u2013 part II: applications. Int Trans Oper Res 16(2):131\u2013172","DOI":"10.1111\/j.1475-3995.2009.00664.x"},{"key":"23_CR54","doi-asserted-by":"crossref","unstructured":"Festa P, Pardalos P, Resende M (2001) Algorithm 815: FORTRAN subroutines for computing approximate solution to feedback set problems using GRASP. ACM Trans Math Softw 27:456\u2013464","DOI":"10.1145\/504210.504214"},{"key":"23_CR55","doi-asserted-by":"crossref","unstructured":"Festa P, Pardalos P, Resende M, Ribeiro C (2002) Randomized heuristics for the MAX-CUT problem. Optim Methods Softw 7:1033\u20131058","DOI":"10.1080\/1055678021000090033"},{"key":"23_CR56","unstructured":"Festa P, Pardalos P, Pitsoulis L, Resende M (2006) GRASP with path-relinking for the weighted MAXSAT problem. ACM J Exp Algorithmics 11:1\u201316"},{"key":"23_CR57","doi-asserted-by":"crossref","unstructured":"Festa P, Gon\u00e7alves J, Resende M, Silva R (2010) Automatic tuning of GRASP with path-relinking heuristics with a biased random-key genetic algorithm. In: Festa P (ed) Proceedings of 9th international symposium on experimental algorithms. Lecture notes in computer science, vol 6049. Springer, Berlin\/New York, pp 338\u2013349","DOI":"10.1007\/978-3-642-13193-6_29"},{"key":"23_CR58","doi-asserted-by":"crossref","unstructured":"Fleurent C, Glover F (1999) Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS J Comput 11:198\u2013204","DOI":"10.1287\/ijoc.11.2.198"},{"key":"23_CR59","unstructured":"Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Company, New York"},{"key":"23_CR60","doi-asserted-by":"crossref","unstructured":"Ghosh J (1996) Computational aspects of the maximum diversity problem. Oper Res Lett 19:175\u2013181","DOI":"10.1016\/0167-6377(96)00025-9"},{"key":"23_CR61","doi-asserted-by":"crossref","unstructured":"Glover F (1989) Tabu search \u2013 part I. ORSA J Comput 1:190\u2013206","DOI":"10.1287\/ijoc.1.3.190"},{"key":"23_CR62","doi-asserted-by":"crossref","unstructured":"Glover F (1990) Tabu search \u2013 part II. ORSA J on Comput 2:4\u201332","DOI":"10.1287\/ijoc.2.1.4"},{"key":"23_CR63","unstructured":"Glover F (1996) Tabu search and adaptive memory programing \u2013 advances, applications and challenges. In: Barr R, Helgason R, Kennington J (eds) Interfaces in computer science and operations research. Kluwer Academic Publishers, Boston, pp 1\u201375"},{"key":"23_CR64","doi-asserted-by":"crossref","unstructured":"Glover F (2000) Multi-start and strategic oscillation methods \u2013 principles to exploit adaptive memory. In: Laguna M, Gonz\u00e1les-Velarde J (eds) Computing tools for modeling, optimization and simulation: interfaces in computer science and operations research. Kluwer Academic Publishers, Boston, pp 1\u201324","DOI":"10.1007\/978-1-4615-4567-5_1"},{"key":"23_CR65","doi-asserted-by":"crossref","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers, Boston","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"23_CR66","unstructured":"Glover F, Laguna M, Mart\u00ed R (2000) Fundamentals of scatter search and path relinking. Control Cybern 39:653\u2013684"},{"key":"23_CR67","doi-asserted-by":"crossref","unstructured":"Go\u00ebffon A, Richer JM, Hao JK (2008) Progressive tree neighborhood applied to the maximum parsimony problem. IEEE\/ACM Trans Comput Biol Bioinform 5(1):136\u2013145","DOI":"10.1109\/TCBB.2007.1065"},{"key":"23_CR68","unstructured":"Goemans M, Williamson D (1996) The primal dual method for approximation algorithms and its application to network design problems. In: Hochbaum D (ed) Approximation algorithms for NP-hard problems. PWS Publishing Co., Boston, pp 144\u2013191"},{"key":"23_CR69","unstructured":"Goldberg D (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading"},{"key":"23_CR70","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves J, Resende M (2011) Biased random-key genetic algorithms for combinatorial optimization. J Heuristics 17(5):487\u2013525","DOI":"10.1007\/s10732-010-9143-1"},{"key":"23_CR71","doi-asserted-by":"crossref","unstructured":"Hammer P, Rader D Jr (2001) Maximally disjoint solutions of the set covering problem. J Heuristics 7:131\u2013144","DOI":"10.1023\/A:1009687403254"},{"key":"23_CR72","unstructured":"Hansen P, Mladenovi\u0107 N (1998) An introduction to variable neighborhood search. In: Voss S, Martello S, Osman IH, Roucairol C (eds) Meta-heuristics, advances and trends in local search paradigms for optimization. Kluwer Academic Publishers, Boston, pp 433\u2013458"},{"key":"23_CR73","doi-asserted-by":"crossref","unstructured":"Hansen P, Mladenovi\u0107 N (2002) Developments of variable neighborhood search. In: Ribeiro C, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer Academic Publishers, Boston, pp 415\u2013439","DOI":"10.1007\/978-1-4615-1507-4_19"},{"key":"23_CR74","doi-asserted-by":"crossref","unstructured":"Hart J, Shogan A (1987) Semi-greedy heuristics: an empirical study. Oper Res Lett 6:107\u2013114","DOI":"10.1016\/0167-6377(87)90021-6"},{"key":"23_CR75","doi-asserted-by":"crossref","unstructured":"Hirsch M, Meneses C, Pardalos P, Ragle M, Resende M (2007) A continuous GRASP to determine the relationship between drugs and adverse reactions. In: Seref O, Kundakcioglu O, Pardalos P (eds) Data mining, systems analysis, and optimization in biomedicine. AIP conference proceedings, vol 953. Springer, Melville, pp 106\u2013121","DOI":"10.1063\/1.2817334"},{"key":"23_CR76","doi-asserted-by":"crossref","unstructured":"Hutter F, Hoos H, Leyton-Brown K, St\u00fctzle T (2009) ParamILS: an automatic algorithm configuration framework. J Artif Intell Res 36:267\u2013306","DOI":"10.1613\/jair.2861"},{"key":"23_CR77","doi-asserted-by":"crossref","unstructured":"Kernighan B, Lin S (1970) An efficient heuristic procedure for partitioning problems. Bell Syst Tech J 49(2):291\u2013307","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"23_CR78","doi-asserted-by":"crossref","unstructured":"Kirkpatrick S (1984) Optimization by simulated annealing: quantitative studies. J Stat Phys 34:975\u2013986","DOI":"10.1007\/BF01009452"},{"key":"23_CR79","doi-asserted-by":"crossref","unstructured":"Klincewicz J (1992) Avoiding local optima in the p-hub location problem using tabu search and GRASP. Ann Oper Res 40:283\u2013302","DOI":"10.1007\/BF02060483"},{"key":"23_CR80","doi-asserted-by":"crossref","unstructured":"Klincewicz J, Rajan A (1994) Using GRASP to solve the component grouping problem. Nav Res Logist 41:893\u2013912","DOI":"10.1002\/1520-6750(199412)41:7<893::AID-NAV3220410704>3.0.CO;2-R"},{"key":"23_CR81","doi-asserted-by":"crossref","unstructured":"Kontoravdis G, Bard J (1995) A GRASP for the vehicle routing problem with time windows. ORSA J Comput 7:10\u201323","DOI":"10.1287\/ijoc.7.1.10"},{"key":"23_CR82","doi-asserted-by":"crossref","unstructured":"Laguna M, Gonz\u00e1lez-Velarde J (1991) A search heuristic for just-in-time scheduling in parallel machines. J Intell Manuf 2:253\u2013260","DOI":"10.1007\/BF01471113"},{"key":"23_CR83","doi-asserted-by":"crossref","unstructured":"Laguna M, Mart\u00ed R (1999) GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J Comput 11:44\u201352","DOI":"10.1287\/ijoc.11.1.44"},{"key":"23_CR84","doi-asserted-by":"crossref","unstructured":"Laguna M, Mart\u00ed R (2001) A GRASP for coloring sparse graphs. Comput Optim Appl 19:165\u2013178","DOI":"10.1023\/A:1011237503342"},{"key":"23_CR85","doi-asserted-by":"crossref","unstructured":"Laguna M, Feo T, Elrod H (1994) A greedy randomized adaptive search procedure for the two-partition problem. Oper Res 42:677\u2013687","DOI":"10.1287\/opre.42.4.677"},{"key":"23_CR86","doi-asserted-by":"crossref","unstructured":"Li Y, Pardalos P, Resende M (1994) A greedy randomized adaptive search procedure for the quadratic assignment problem. In: Pardalos P, Wolkowicz H (eds) Quadratic assignment and related problems. DIMACS series on discrete mathematics and theoretical computer science, vol 16. American Mathematical Society, Providence, pp 237\u2013261","DOI":"10.1090\/dimacs\/016\/12"},{"key":"23_CR87","doi-asserted-by":"crossref","unstructured":"Liu X, Pardalos P, Rajasekaran S, Resende M (2000) A GRASP for frequency assignment in mobile radio networks. In: Rajasekaran S, Pardalos P, Hsu F (eds) Mobile networks and computing. DIMACS series on discrete mathematics and theoretical computer science, vol 52. American Mathematical Society, Providence, pp 195\u2013201","DOI":"10.1090\/dimacs\/052\/12"},{"key":"23_CR88","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o HR, Paix\u00e3o J, Portugal R (2001) Multiobjective metaheuristics for the bus-driver scheduling problem. Transp Sci 35:331\u2013343","DOI":"10.1287\/trsc.35.3.331.10147"},{"key":"23_CR89","doi-asserted-by":"crossref","unstructured":"Mart\u00ed R, Laguna M (2003) Heuristics and meta-heuristics for 2-layer straight line crossing minimization. Discret Appl Math 127(3):665\u2013678","DOI":"10.1016\/S0166-218X(02)00397-9"},{"key":"23_CR90","doi-asserted-by":"crossref","unstructured":"Martins S, Ribeiro C, Souza M (1998) A parallel GRASP for the Steiner problem in graphs. In: Ferreira A, Rolim J (eds) Proceedings of IRREGULAR\u201998 \u2013 5th international symposium on solving irregularly structured problems in parallel. Lecture notes in computer science, vol 1457. Springer, Berlin\/Heidelberg, pp 285\u2013297","DOI":"10.1007\/BFb0018547"},{"key":"23_CR91","unstructured":"Martins S, Pardalos P, Resende M, Ribeiro C (1999) Greedy randomized adaptive search procedures for the Steiner problem in graphs. In: Pardalos P, Rajasekaran S, Rolim J (eds) Randomization methods in algorithmic design. DIMACS series on discrete mathematics and theoretical computer science, vol 43. American Mathematical Society, Providence, pp 133\u2013145"},{"key":"23_CR92","doi-asserted-by":"crossref","unstructured":"Martins S, Resende M, Ribeiro C, Pardalos P (2000) A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy. J Glob Optim 17:267\u2013283","DOI":"10.1023\/A:1026546708757"},{"key":"23_CR93","doi-asserted-by":"crossref","unstructured":"Mavridou T, Pardalos P, Pitsoulis L, Resende M (1998) A GRASP for the biquadratic assignment problem. Eur J Oper Res 105:613\u2013621","DOI":"10.1016\/S0377-2217(97)00083-0"},{"key":"23_CR94","doi-asserted-by":"crossref","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24: 1097\u20131100","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"23_CR95","doi-asserted-by":"crossref","unstructured":"Mockus J, Eddy E, Mockus A, Mockus L, Reklaitis G (1997) Bayesian discrete and global optimization. Kluwer Academic Publishers, Dordrecht\/Boston","DOI":"10.1007\/978-1-4757-2627-5_11"},{"key":"23_CR96","doi-asserted-by":"crossref","unstructured":"Monkman S, Morrice D, Bard J (2008) A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs. Eur J Oper Res 187(3): 1100\u20131114","DOI":"10.1016\/j.ejor.2006.06.063"},{"key":"23_CR97","doi-asserted-by":"crossref","unstructured":"Mor\u00e1n-Mirabal L, Gonz\u00e1lez-Velarde J, Resende M (2013) Automatic tuning of GRASP with evolutionary path-relinking. In: Proceedings of 8th international workshop on hybrid metaheuristics, Ischia. Lecture notes in computer science, vol 7919, pp 62\u201377","DOI":"10.1007\/978-3-642-38516-2_6"},{"key":"23_CR98","unstructured":"nez MLI, Dubois-Lacoste J, St\u00fctzle T, Birattari M (2011) The IRACE package, iterated race for automatic algorithm configuration. Technical report TR\/IRIDIA\/2011-004, IRIDIA, Universit\u00e9 Libre de Bruxelles"},{"key":"23_CR99","doi-asserted-by":"crossref","unstructured":"Osman I, Al-Ayoubi B, Barake M (2003) A greedy random adaptive search procedure for the weighted maximal planar graph problem. Comput Ind Eng 45(4):635\u2013651","DOI":"10.1016\/j.cie.2003.09.005"},{"key":"23_CR100","doi-asserted-by":"crossref","unstructured":"Pardalos P, Pitsoulis L, Resende M (1996) A parallel GRASP for MAX-SAT problems. Lect Notes Comput Sci 1184:575\u2013585","DOI":"10.1007\/3-540-62095-8_62"},{"key":"23_CR101","doi-asserted-by":"crossref","unstructured":"Pardalos P, Pitsoulis L, Resende M (1997) Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP. ACM Trans Math Softw 23:196\u2013208","DOI":"10.1145\/264029.264038"},{"key":"23_CR102","doi-asserted-by":"crossref","unstructured":"Pardalos P, Ramakrishnan K, Resende M, Li Y (1997) Implementation of a variance reduction based lower bound in a branch and bound algorithm for the quadratic assignment problem. SIAM J Optim 7:280\u2013294","DOI":"10.1137\/S1052623494273393"},{"key":"23_CR103","doi-asserted-by":"crossref","unstructured":"Pin\u00e3na E, Plana I, Campos V, R Mart\u00ec (2004) GRASP and path relinking for the matrix bandwidth minimization. Eur J Oper Res 153(1):200\u2013210","DOI":"10.1016\/S0377-2217(02)00715-4"},{"key":"23_CR104","unstructured":"Prais M, Ribeiro C (1999) Parameter variation in GRASP implementations. In: Extended abstracts of the third metaheuristics international conference, Porto, pp 375\u2013380"},{"key":"23_CR105","unstructured":"Prais M, Ribeiro C (2000) Parameter variation in GRASP procedures. Investigaci\u00f3n Operativa 9:1\u201320"},{"key":"23_CR106","doi-asserted-by":"crossref","unstructured":"Prais M, Ribeiro C (2000) Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J Comput 12:164\u2013176","DOI":"10.1287\/ijoc.12.3.164.12639"},{"key":"23_CR107","doi-asserted-by":"crossref","unstructured":"Pu G, Chong Z, Qiu Z, Lin Z, He J (2006) A hybrid heuristic algorithm for HW-SW partitioning within timed automata. In: Proceedings of knowledge-based intelligent information and engineering systems. Lecture notes in artificial intelligence, vol 4251. Springer, Berlin\/Heidelberg, pp 459\u2013466","DOI":"10.1007\/11892960_56"},{"key":"23_CR108","doi-asserted-by":"crossref","unstructured":"Resende M, Feo T (1996) A GRASP for satisfiability. In: Johnson D, Trick M (eds) Cliques, coloring, and satisfiability: the second DIMACS implementation challenge. DIMACS series on discrete mathematics and theoretical computer science, vol 26. American Mathematical Society, Providence, pp 499\u2013520","DOI":"10.1090\/dimacs\/026\/24"},{"key":"23_CR109","doi-asserted-by":"crossref","unstructured":"Resende M, Ribeiro C (1997) A GRASP for graph planarization. Networks 29:173\u2013189","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<173::AID-NET5>3.0.CO;2-E"},{"key":"23_CR110","doi-asserted-by":"crossref","unstructured":"Resende M, Ribeiro C (2003) Greedy randomized adaptive search procedures. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer Academic Publishers, Boston, pp 219\u2013249","DOI":"10.1007\/0-306-48056-5_8"},{"key":"23_CR111","unstructured":"Resende M, Ribeiro C (2005) GRASP with path-relinking: recent advances and applications. In: Ibaraki T, Nonobe K, Yagiura M (eds) Metaheuristics: progress as real problem solvers. Springer, New York, pp 29\u201363"},{"key":"23_CR112","doi-asserted-by":"crossref","unstructured":"Resende M, Pardalos P, Li Y (1996) Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Trans Math Softw 22:104\u2013118","DOI":"10.1145\/225545.225553"},{"key":"23_CR113","doi-asserted-by":"crossref","unstructured":"Resende M, Pitsoulis L, Pardalos P (1997) Approximate solution of weighted MAX-SAT problems using GRASP. In: Gu J, Pardalos P (eds) Satisfiability problems. DIMACS series on discrete mathematics and theoretical computer science, vol 35. American Mathematical Society, Providence, pp 393\u2013405","DOI":"10.1090\/dimacs\/035\/11"},{"key":"23_CR114","doi-asserted-by":"crossref","unstructured":"Resende M, Pitsoulis L, Pardalos P (2000) Fortran subroutines for computing approximate solutions of MAX-SAT problems using GRASP. Discret Appl Math 100:95\u2013113","DOI":"10.1016\/S0166-218X(99)00171-7"},{"key":"23_CR115","doi-asserted-by":"crossref","unstructured":"Ribeiro C, Resende M (1999) Fortran subroutines for approximate solution of graph planarization problems using GRASP. ACM Trans Math Softw 25:341\u2013352","DOI":"10.1145\/326147.326153"},{"key":"23_CR116","doi-asserted-by":"crossref","unstructured":"Ribeiro C, Souza M (2002) Variable neighborhood search for the degree constrained minimum spanning tree problem. Discret Appl Math 118:43\u201354","DOI":"10.1016\/S0166-218X(01)00255-4"},{"key":"23_CR117","doi-asserted-by":"crossref","unstructured":"Ribeiro C, Urrutia S (2007) Heuristics for the mirrored traveling tournament problem. Eur J Oper Res 179:775\u2013787","DOI":"10.1016\/j.ejor.2005.03.061"},{"key":"23_CR118","doi-asserted-by":"crossref","unstructured":"Ribeiro C, Uchoa E, Werneck R (2002) A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS J Comput 14:228\u2013246","DOI":"10.1287\/ijoc.14.3.228.116"},{"key":"23_CR119","doi-asserted-by":"crossref","unstructured":"R\u00edos-Mercado R, Bard J (1998) Heuristics for the flow line problem with setup costs. Eur J Oper Res 110(1):76\u201398","DOI":"10.1016\/S0377-2217(97)00213-0"},{"key":"23_CR120","doi-asserted-by":"crossref","unstructured":"R\u00edos-Mercado R, Bard J (1999) An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup costs. J Heuristics 5:57\u201374","DOI":"10.1023\/A:1009691028143"},{"key":"23_CR121","unstructured":"Rivera L (1998) Evaluation of parallel implementations of heuristics for the course scheduling problem. Master\u2019s thesis, Instituto Tecnologico y de Estudios Superiores de Monterrey, Monterrey"},{"key":"23_CR122","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1023\/A:1011285402433","volume":"19","author":"A Robertson","year":"2001","unstructured":"Robertson A (2001) A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem. Comput Optim Appl 19: 145\u2013164","journal-title":"Comput Optim Appl"},{"key":"23_CR123","volume-title":"Approximation and complexity in numerical optimization","author":"D Sosnowska","year":"2000","unstructured":"Sosnowska D (2000) Optimization of a simplified fleet assignment problem with metaheuristics: simulated annealing and GRASP. In: Pardalos P (ed) Approximation and complexity in numerical optimization. Kluwer Academic Publishers, Boston"},{"key":"23_CR124","first-page":"707","volume":"2","author":"A Srinivasan","year":"2000","unstructured":"Srinivasan A, Ramakrishnan K, Kumaram K, Aravamudam M, Naqvi S (2000) Optimal design of signaling networks for Internet telephony. In: IEEE INFOCOM 2000, Tel-Aviv, vol 2, pp 707\u2013716","journal-title":"Tel-Aviv, vol"},{"key":"23_CR125","first-page":"573","volume":"24","author":"H Takahashi","year":"1980","unstructured":"Takahashi H, Matsuyama A (1980) An approximate solution for the Steiner problem in graphs. Math Jpn 24:573\u2013577","journal-title":"Math Jpn"},{"key":"23_CR126","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/A:1018904806854","volume":"76","author":"T Urban","year":"1998","unstructured":"Urban T (1998) Solution procedures for the dynamic facility layout problem. Ann Oper Res 76:323\u2013342","journal-title":"Ann Oper Res"}],"container-title":["Handbook of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07124-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T03:20:57Z","timestamp":1571714457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":126,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_23","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}