{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:54:38Z","timestamp":1757314478658},"publisher-location":"Cham","reference-count":64,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319071237"},{"type":"electronic","value":"9783319071244"}],"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_30","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T19:09:59Z","timestamp":1534187399000},"page":"703-715","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Random-Key Genetic Algorithms"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 Fernando","family":"Gon\u00e7alves","sequence":"first","affiliation":[]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Aiex RM, Resende MGC, Ribeiro CC (2007) TTTPLOTS: a perl program to create time-to-target plots. Optim Lett 1:355\u2013366","DOI":"10.1007\/s11590-006-0031-4"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Andrade DV, Buriol LS, Resende MGC, Thorup M (2006) Survivable composite-link IP network design with OSPF routing. In: Proceedings of the eighth INFORMS telecommunications conference, Dallas","DOI":"10.1002\/net.20141"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Andrade CE, Miyazawa FK, Resende MGC (2013) Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem. In: Proceedings of genetic and evolutionary computation conference (GECCO). ACM, Amsterdam","DOI":"10.1145\/2463372.2463434"},{"key":"30_CR4","unstructured":"Andrade CE, Miyazawa FK, Resende MGC, Toso RF (2013) Biased random-key genetic algorithms for the winner determination problem in combinatorial auctions. Technical report, AT&T Labs Research, Florham Park"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Andrade CE, Resende MGC, Karloff HJ, Miyazawa FK (2014) Evolutionary algorithms for overlapping correlation clustering. In: Proceedings of genetic and evolutionary computation conference (GECCO\u201914), Vancouver, pp 405\u2013412","DOI":"10.1145\/2576768.2598284"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6:154\u2013160","DOI":"10.1287\/ijoc.6.2.154"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Breslau L, Diakonikolas I, Duffield N, Gu Y, Hajiaghayi M, Johnson DS, Karloff H, Resende MGC, Sen S (2011) Disjoint-path facility location: theory and practice. In: Proceedings of the thirteenth workshop of algorithm engineering and experiments (ALENEX11), San Francisco, pp 68\u201374","DOI":"10.1137\/1.9781611972917.7"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Buriol LS, Resende MGC, Ribeiro CC, Thorup M (2005) A hybrid genetic algorithm for the weight setting problem in OSPF\/IS-IS routing. Networks 46:36\u201356","DOI":"10.1002\/net.20070"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Buriol LS, Resende MGC, Thorup M (2007) Survivable IP network design with OSPF routing. Networks 49:51\u201364","DOI":"10.1002\/net.20141"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Buriol LS, Hirsch MJ, Querido T, Pardalos PM, Resende MGC, Ritt M (2010) A biased random-key genetic algorithm for road congestion minimization. Optim Lett 4:619\u2013633","DOI":"10.1007\/s11590-010-0226-6"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Chan FTS, Tibrewal RK, Prakash A, Tiwari MK (2015) A biased random key genetic algorithm approach for inventory-based multi-item lot-sizing problem. Proc Inst Mech Eng Part B J Eng Manuf 229(1):157\u2013171","DOI":"10.1177\/0954405414523594"},{"key":"30_CR12","unstructured":"Coco AA, Noronha TF, Santos AC (2012) A biased random-key genetic algorithm for the robust shortest path problem. In: Proceedings of global optimization workshop (GO2012), Natal, pp 53\u201356"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Coco AA, Abreu JCA Jr, Noronha TF, Santos AC (2014) An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem. J Glob Optim 60(2):265\u2013287","DOI":"10.1007\/s10898-014-0187-x"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Duarte A, Mart\u00ed R, Resende MGC, Silva RMA (2014) Improved heuristics for the regenerator location problem. Int Trans Oper Res 21:541\u2013558","DOI":"10.1111\/itor.12085"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Ericsson M, Resende MGC, Pardalos PM (2002) A genetic algorithm for the weight setting problem in OSPF routing. J Comb Optim 6:299\u2013333","DOI":"10.1023\/A:1014852026591"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Festa P (2013) A biased random-key genetic algorithm for data clustering. Math Biosci 245:76\u201385","DOI":"10.1016\/j.mbs.2013.07.011"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Festa P, Gon\u00e7alves JF, Resende MGC, Silva RMA (2010) Automatic tuning of GRASP with path-relinking heuristics with a biased random-key genetic algorithm. In: Festa P (ed) Experimental algorithms. Lecture notes in computer science, vol 6049. Springer, Berlin\/Heidelberg, pp 338\u2013349","DOI":"10.1007\/978-3-642-13193-6_29"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Fontes DBMM, Gon\u00e7alves JF (2007) Heuristic solutions for general concave minimum cost network flow problems. Networks 50:67\u201376","DOI":"10.1002\/net.20167"},{"key":"30_CR19","unstructured":"Fontes DBMM, Gon\u00e7alves JF (2013) A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks. Optim Lett 7(6): 1303\u20131324"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves JF (2007) A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem. Eur J Oper Res 183:1212\u20131229","DOI":"10.1016\/j.ejor.2005.11.062"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves JF, Almeida J (2002) A hybrid genetic algorithm for assembly line balancing. J Heuristics 8:629\u2013642","DOI":"10.1023\/A:1020377910258"},{"key":"30_CR22","unstructured":"Gon\u00e7alves JF, Beir\u00e3o NC (1999) Um algoritmo gen\u00e9tico baseado em chaves aleat\u00f3rias para sequenciamento de opera\u00e7\u00f5es. Revista Associa\u00e7\u00e3o Portuguesa de Desenvolvimento e Investiga\u00e7\u00e3o Operacional 19:123\u2013137"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves JF, Resende MGC (2004) An evolutionary algorithm for manufacturing cell formation. Comput Ind Eng 47:247\u2013273","DOI":"10.1016\/j.cie.2004.07.003"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves JF, Resende MGC (2011) Biased random-key genetic algorithms for combinatorial optimization. J Heuristics 17:487\u2013525","DOI":"10.1007\/s10732-010-9143-1"},{"key":"30_CR25","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves JF, Resende MGC (2011) A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem. J Comb Optim 22:180\u2013201","DOI":"10.1007\/s10878-009-9282-1"},{"key":"30_CR26","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves JF, Resende MGC (2012) A parallel multi-population biased random-key genetic algorithm for a container loading problem. Comput Oper Res 29:179\u2013190","DOI":"10.1016\/j.cor.2011.03.009"},{"key":"30_CR27","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves JF, Resende MGC (2013) A biased random-key genetic algorithm for a 2D and 3D bin packing problem. Int J Prod Econ 145:500\u2013510","DOI":"10.1016\/j.ijpe.2013.04.019"},{"key":"30_CR28","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves JF, Resende MGC (2014) An extended Akers graphical minimization method with a biased random-key genetic algorithm for job-shop scheduling. Int Tran Oper Res 21:215\u2013246","DOI":"10.1111\/itor.12044"},{"key":"30_CR29","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves JF, Resende MGC (2015) A biased random-key genetic algorithm for the unequal area facility layout problem. Eur J Oper Res 246(1):86\u2013107","DOI":"10.1016\/j.ejor.2015.04.029"},{"key":"30_CR30","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves JF, Mendes JJM, Resende MGC (2005) A hybrid genetic algorithm for the job shop scheduling problem. Eur J Oper Res 167:77\u201395","DOI":"10.1016\/j.ejor.2004.03.012"},{"key":"30_CR31","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves JF, Mendes JJM, Resende MGC (2008) A genetic algorithm for the resource constrained multi-project scheduling problem. Eur J Oper Res 189:1171\u20131190","DOI":"10.1016\/j.ejor.2006.06.074"},{"key":"30_CR32","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves JF, Resende MGC, Mendes JJM (2011) A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem. J Heuristics 17:467\u2013486","DOI":"10.1007\/s10732-010-9142-2"},{"key":"30_CR33","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves JF, Resende MGC, Costa MD (2016) A biased random-key genetic algorithm for the minimization of open stacks problem. Int Trans Oper Res 23(1\u20132):25\u201346","DOI":"10.1111\/itor.12109"},{"key":"30_CR34","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves JF, Resende MGC, Toso RF (2014) An experimental comparison of biased and unbiased random-key genetic algorithms. Pesquisa Operacional 34:143\u2013164","DOI":"10.1590\/0101-7438.2014.034.02.0143"},{"key":"30_CR35","doi-asserted-by":"crossref","unstructured":"Goulart N, de Souza SR, Dias LGS, Noronha TF (2011) Biased random-key genetic algorithm for fiber installation in optical network optimization. In: IEEE congress on evolutionary computation (CEC 2011). IEEE, New Orleans, pp 2267\u20132271","DOI":"10.1109\/CEC.2011.5949896"},{"key":"30_CR36","doi-asserted-by":"crossref","unstructured":"Grasas A, Louren\u00e7o HR, Pessoa LS, Resende MGC, Caball\u00e9 I, Barba N (2014) On the improvement of blood sample collection at clinical laboratories. BMC Health Serv Res 14:Article 12","DOI":"10.1186\/1472-6963-14-12"},{"key":"30_CR37","doi-asserted-by":"crossref","unstructured":"Lalla-Ruiz E, Gonz\u00e1lez-Velarde JL, Meli\u00e1n-Batista B, Moreno-Vega JM (2014) Biased random key genetic algorithm for the tactical berth allocation problem. Appl Soft Comput 22:60\u201376","DOI":"10.1016\/j.asoc.2014.04.035"},{"key":"30_CR38","doi-asserted-by":"crossref","unstructured":"Marques I, Captivo ME, Vaz Pato M (2014) Scheduling elective surgeries in a portuguese hospital using a genetic heuristic. Oper Res Health Care 3:59\u201372","DOI":"10.1016\/j.orhc.2013.12.001"},{"key":"30_CR39","doi-asserted-by":"crossref","unstructured":"Mendes JJM, Gon\u00e7alves JF, Resende MGC (2009) A random key based genetic algorithm for the resource constrained project scheduling problem. Comput Oper Res 36:92\u2013109","DOI":"10.1016\/j.cor.2007.07.001"},{"key":"30_CR40","doi-asserted-by":"crossref","unstructured":"Mor\u00e1n-Mirabal LF, Gonz\u00e1lez-Velarde JL, Resende MGC (2013) Automatic tuning of GRASP with evolutionary path-relinking. In: Proceedings of hybrid metaheuristics 2013 (HM 2013). Lecture notes in computer science, vol 7919. Springer, Ischia, pp 62\u201377","DOI":"10.1007\/978-3-642-38516-2_6"},{"key":"30_CR41","doi-asserted-by":"crossref","unstructured":"Mor\u00e1n-Mirabal LF, Gonz\u00e1lez-Velarde JL, Resende MGC, Silva RMA (2013) Randomized heuristics for handover minimization in mobility networks. J Heuristics 19:845\u2013880","DOI":"10.1007\/s10732-013-9223-0"},{"key":"30_CR42","doi-asserted-by":"crossref","unstructured":"Mor\u00e1n-Mirabal LF, Gonz\u00e1lez-Velarde JL, Resende MGC (2014) Randomized heuristics for the family traveling salesperson problem. Int Trans Oper Res 21:41\u201357","DOI":"10.1111\/itor.12026"},{"key":"30_CR43","doi-asserted-by":"crossref","unstructured":"Moreira MCO, Ritt M, Costa AM, Chaves AA (2012) Simple heuristics for the assembly line worker assignment and balancing problem. J Heuristics 18:505\u2013524","DOI":"10.1007\/s10732-012-9195-5"},{"key":"30_CR44","doi-asserted-by":"crossref","unstructured":"Noronha TF, Resende MGC, Ribeiro CC (2011) A biased random-key genetic algorithm for routing and wavelength assignment. J Glob Optim 50:503\u2013518","DOI":"10.1007\/s10898-010-9608-7"},{"key":"30_CR45","unstructured":"OpenMP (2013) http:\/\/openmp.org\/wp\/. Last visted on 11 May 2013"},{"key":"30_CR46","doi-asserted-by":"crossref","unstructured":"Pedrola O, Careglio D, Klinkowski M, Velasco L, Bergman K, Sol\u00e9-Pareta J (2013) Metaheuristic hybridizations for the regenerator placement and dimensioning problem in sub-wavelength switching optical networks. Eur J Oper Res 224:614\u2013624","DOI":"10.1016\/j.ejor.2012.08.011"},{"key":"30_CR47","doi-asserted-by":"crossref","unstructured":"Pedrola O, Ruiz M, Velasco L, Careglio D, Gonz\u00e1lez de Dios O, Comellas J (2013) A GRASP with path-relinking heuristic for the survivable IP\/MPLS-over-WSON multi-layer network optimization problem. Comput Oper Res 40:3174\u20133187","DOI":"10.1016\/j.cor.2011.10.026"},{"key":"30_CR48","doi-asserted-by":"crossref","unstructured":"Reis R, Ritt M, Buriol LS,, Resende MGC (2011) A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion. Int Trans Oper Res 18:401\u2013423","DOI":"10.1111\/j.1475-3995.2010.00771.x"},{"key":"30_CR49","doi-asserted-by":"crossref","unstructured":"Resende MGC (2012) Biased random-key genetic algorithms with applications in telecommunications. TOP 20:120\u2013153","DOI":"10.1007\/s11750-011-0176-x"},{"key":"30_CR50","doi-asserted-by":"crossref","unstructured":"Resende MGC, Ribeiro CC (2011) Restart strategies for GRASP with path-relinking heuristics. Optim Lett 5:467\u2013478","DOI":"10.1007\/s11590-011-0322-2"},{"key":"30_CR51","doi-asserted-by":"crossref","unstructured":"Resende MGC, Toso RF, Gon\u00e7alves JF, Silva RMA (2012) A biased random-key genetic algorithm for the Steiner triple covering problem. Optim Lett 6:605\u2013619","DOI":"10.1007\/s11590-011-0285-3"},{"key":"30_CR52","doi-asserted-by":"crossref","unstructured":"Roque LAC, Fontes DBMM, Fontes FACC (2014) A hybrid biased random key genetic algorithm approach for the unit commitment problem. J Comb Optim 28:140\u2013166","DOI":"10.1007\/s10878-014-9710-8"},{"key":"30_CR53","doi-asserted-by":"crossref","unstructured":"Ruiz M, Pedrola O, Velasco L, Careglio D, Fern\u00e1ndez-Palacios J, Junyent G (2011) Survivable IP\/MPLS-over-WSON multilayer network optimization. J Optic Commun Netw 3:629\u2013640","DOI":"10.1364\/JOCN.3.000629"},{"key":"30_CR54","unstructured":"Ruiz E, Albareda-Sambola M, Fern\u00e1ndez E, Resende MGC (2013) A biased random-key genetic algorithm for the capacitated minimum spanning tree problem. Technical report, AT&T Labs Research Technical, Florham Park"},{"key":"30_CR55","unstructured":"Silva RMA, Resende MGC, Pardalos PM, Gon\u00e7alves JF (2012) Biased random-key genetic algorithm for bound-constrained global optimization. In: Proceedings of global optimization workshop (GO2012), Natal, pp 133\u2013136"},{"key":"30_CR56","doi-asserted-by":"crossref","unstructured":"Silva RMA, Resende MGC, Pardalos PM (2014) Finding multiple roots of box-constrained system of nonlinear equations with a biased random-key genetic algorithm. J Glob Optim 60(2):289\u2013306","DOI":"10.1007\/s10898-013-0105-7"},{"key":"30_CR57","doi-asserted-by":"crossref","unstructured":"Silva RMA, Resende MGC, Pardalos PM (2015) A Python\/C++ library for bound-constrained global optimization using biased random-key genetic algorithm. J Comb Optim 30(3):710\u2013728","DOI":"10.1007\/s10878-013-9659-z"},{"key":"30_CR58","doi-asserted-by":"crossref","unstructured":"Silva RMA, Resende MGC, Pardalos PM, Fac\u00f3 JLD (2013) Biased random-key genetic algorithm for non-linearly constrained global optimization. In: Proceedings of the 2013 IEEE congress on evolutionary computation (CEC), Cancun, pp 2201\u20132206","DOI":"10.1109\/CEC.2013.6557830"},{"key":"30_CR59","unstructured":"Spears WM, DeJong KA (1991) On the virtues of parameterized uniform crossover. In: Proceedings of the fourth international conference on genetic algorithms, San Mateo, pp 230\u2013236"},{"key":"30_CR60","unstructured":"Stefanello F, Buriol LS, Hirsch MJ, Pardalos PM, Querido T, Resende MGC, Ritt M (2013) On the minimization of traffic congestion in road networks with tolls. Technical report, AT&T Labs Research, Florham Park"},{"key":"30_CR61","doi-asserted-by":"crossref","unstructured":"Tangpattanakul P, Jozefowiez N, Lopez P (2012) Multi-objective optimization for selecting and scheduling observations by agile earth observing satellites. In: Parallel problem solving from nature \u2013 PPSN XII. Lecture notes in computer science, vol 7492. Springer, Berlin\/New York, pp 112\u2013121","DOI":"10.1007\/978-3-642-32964-7_12"},{"issue":"1","key":"30_CR62","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1080\/10556788.2014.890197","volume":"30","author":"RF Toso","year":"2015","unstructured":"Toso RF, Resende MGC (2015) A C++ application programming interface for biased random key genetic algorithms. Optim Methods Softw 30(1):81\u201393","journal-title":"Optim Methods Softw"},{"key":"30_CR63","doi-asserted-by":"publisher","first-page":"3696","DOI":"10.1016\/j.cor.2007.04.006","volume":"35","author":"JMS Valente","year":"2008","unstructured":"Valente JMS, Gon\u00e7alves JF (2008) A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties. Comput Oper Res 35:3696\u20133713","journal-title":"Comput Oper Res"},{"key":"30_CR64","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1142\/S0217595906000978","volume":"23","author":"JMS Valente","year":"2006","unstructured":"Valente JMS, Gon\u00e7alves JF, Alves RAFS (2006) A hybrid genetic algorithm for the early\/tardy scheduling problem. Asia-Pac J Oper Res 23:393\u2013405","journal-title":"Asia-Pac J 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_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T07:21:47Z","timestamp":1571728907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_30","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}