{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T21:21:03Z","timestamp":1770326463577,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,10,5]],"date-time":"2013-10-05T00:00:00Z","timestamp":1380931200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10878-013-9659-z","type":"journal-article","created":{"date-parts":[[2013,10,4]],"date-time":"2013-10-04T06:45:06Z","timestamp":1380869106000},"page":"710-728","source":"Crossref","is-referenced-by-count":7,"title":["A Python\/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm"],"prefix":"10.1007","volume":"30","author":[{"given":"R. M. A.","family":"Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. G. C.","family":"Resende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,5]]},"reference":[{"key":"9659_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1997-9","volume-title":"A connectionist machine for genetic hillclimbing","author":"DH Ackley","year":"1987","unstructured":"Ackley DH (1987) A connectionist machine for genetic hillclimbing. Kluwer Academic Publishers, Boston"},{"key":"9659_CR2","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary algorithms in theory and practice","author":"T B\u00e4ck","year":"1996","unstructured":"B\u00e4ck T (1996) Evolutionary algorithms in theory and practice. Oxford University Press, New York"},{"key":"9659_CR3","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean JC (1994) Genetic algorithms and random Keys for sequencing and optimization. ORSA J Comput 6:154\u2013160","journal-title":"ORSA J Comput"},{"key":"9659_CR4","volume-title":"Autotools: a practitioner\u2019s guide to GNU autoconf, automake, and libtool","author":"J Calcote","year":"2010","unstructured":"Calcote J (2010) Autotools: a practitioner\u2019s guide to GNU autoconf, automake, and libtool. No Starch Press, San Francisco"},{"key":"9659_CR5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1023\/A:1014852026591","volume":"6","author":"M Ericsson","year":"2002","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","journal-title":"J Comb Optim"},{"key":"9659_CR6","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1023\/A:1020377910258","volume":"8","author":"JF Gon\u00e7alves","year":"2002","unstructured":"Gon\u00e7alves JF, Almeida J (2002) A hybrid genetic algorithm for assembly line balancing. J Heuristics 8:629\u2013642","journal-title":"J Heuristics"},{"key":"9659_CR7","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.cie.2004.07.003","volume":"47","author":"JF Gon\u00e7alves","year":"2004","unstructured":"Gon\u00e7alves JF, Resende MGC (2004) An evolutionary algorithm for manufacturing cell formation. Comput Ind Eng 47:247\u2013273","journal-title":"Comput Ind Eng"},{"key":"9659_CR8","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves JF, Resende MGC (2011a) Biased random-key genetic algorithms for combinatorial optimization. J Heuristics 17:487\u2013525","journal-title":"J Heuristics"},{"issue":"5","key":"9659_CR9","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves JF, Resende MGC (2011b) Biased random-key genetic algorithms for combinatorial optimization. J Heuristics 17(5):487\u2013525","journal-title":"J Heuristics"},{"issue":"2","key":"9659_CR10","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.cor.2011.03.009","volume":"39","author":"JF Gon\u00e7alves","year":"2012","unstructured":"Gon\u00e7alves JF, Resende MGC (2012) A parallel multi-population biased random-key genetic algorithm for a container loading problem. Comput Oper Res 39(2):179\u2013190","journal-title":"Comput Oper Res"},{"key":"9659_CR11","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1016\/j.ijpe.2013.04.019","volume":"145","author":"JF Gon\u00e7alves","year":"2013","unstructured":"Gon\u00e7alves JF, Resende MGC (2013) A biased random key genetic algorithm for 2D and 3D bin packing problems. Int J Prod Econ 145:500\u2013510","journal-title":"Int J Prod Econ"},{"key":"9659_CR12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s11590-006-0021-6","volume":"1","author":"MJ Hirsch","year":"2007","unstructured":"Hirsch MJ, Meneses CN, Pardalos PM, Resende MGC (2007) Global optimization by continuous grasp. Optim Lett 1:201\u2013212","journal-title":"Optim Lett"},{"key":"9659_CR13","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/j.ejor.2010.02.009","volume":"205","author":"MJ Hirsch","year":"2010","unstructured":"Hirsch MJ, Pardalos PM, Resende MGC (2010) Speeding up continuous GRASP. J Oper Res 205:507\u2013521","journal-title":"J Oper Res"},{"issue":"1","key":"9659_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto M, Nishimura T (1998) Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans Model Comput Simul 8(1):3\u201330","journal-title":"ACM Trans Model Comput Simul"},{"key":"9659_CR15","volume-title":"Getting started with pyparsing","author":"P McGuire","year":"2007","unstructured":"McGuire P (2007) Getting started with pyparsing. O\u2019Reilly Media, Sebastopol"},{"issue":"1","key":"9659_CR16","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/s11750-011-0176-x","volume":"20","author":"MGC Resende","year":"2012","unstructured":"Resende MGC (2012) Biased random-key genetic algorithms with applications in telecommunications. TOP 20(1):130\u2013153","journal-title":"TOP"},{"issue":"4","key":"9659_CR17","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s11590-011-0285-3","volume":"6","author":"MGC Resende","year":"2012","unstructured":"Resende MGC, Toso Rodrigo F, Silva Ricardo MA (2012) A biased random-key genetic algorithm for the steiner triple covering problem. Optim Lett 6(4):605\u2013619","journal-title":"Optim Lett"},{"key":"9659_CR18","unstructured":"Silva RMA, Resende MGC, Pardalos PM, Gon\u00e7alves JF (2012) Biased random-key genetic algorithm for bound-constrained global optimization. In: Aloise D, Hansen P, Rocha C (eds) Proceedings of the global optimization workshop, pp 133\u2013136"},{"key":"9659_CR19","unstructured":"Spears WM, DeJong KA (1991) On the virtues of parameterized uniform crossover. In: Proceedings of the fourth international conference on genetic algorithms, pp 230\u2013236"},{"key":"9659_CR20","unstructured":"SymPy (2011) URL. http:\/\/sympy.org\/ . Accessed 11 Jul 2011"},{"key":"9659_CR21","unstructured":"Toso RF, Resende MGC (2012) A C++ application programming interface for biased random-key genetic algorithms. Technical report, Algorithms and Optimization Research Department, AT &T Labs Research"},{"key":"9659_CR22","volume-title":"Extending and embedding Python, Release 2.7","year":"2010","unstructured":"van Rossum G, Drake FL Jr (eds) (2010a) Extending and embedding Python, Release 2.7. Python Software Foundation, Wolfeboro Falls"},{"key":"9659_CR23","volume-title":"Python\/C API reference manual, release 2.7","year":"2010","unstructured":"van Rossum G, Drake FL Jr (eds) (2010b) Python\/C API reference manual, release 2.7. Python Software Foundation, Wolfeboro Falls"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9659-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9659-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9659-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T21:46:02Z","timestamp":1646689562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9659-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,5]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9659"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9659-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,5]]}}}