{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T17:07:11Z","timestamp":1725988031370},"publisher-location":"Cham","reference-count":25,"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_25","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T19:09:59Z","timestamp":1534187399000},"page":"23-37","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Biased Random-Key Genetic Progamming"],"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":"25_CR1","doi-asserted-by":"crossref","unstructured":"Banzhaf W, Nordin P, Keller RE, Francone FD (1998) Genetic programming: an introduction. Morgan Kaufmann, San Francisco","DOI":"10.1007\/BFb0055923"},{"key":"25_CR2","unstructured":"Barricelli NA et al (1954) Esempi numerici di processi di evoluzione. Methodos 6(21\u201322): 45\u201368"},{"key":"25_CR3","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":"25_CR4","unstructured":"Brameier MF, Banzhaf W (2007) Linear genetic programming. Springer, New York"},{"key":"25_CR5","unstructured":"Cramer NL (1985) A representation for the adaptive generation of simple sequential programs. In: Proceedings of the first international conference on genetic algorithms, Pittsburg, pp 183\u2013187"},{"key":"25_CR6","unstructured":"Ferreira C (2001) Gene expression programming: a new adaptive algorithm for solving problems. Complex Syst 13:87\u2013129"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Ferreira C (2006) Designing neural networks using gene expression programming. In: Abraham A (ed) Applied soft computing technologies: the challenge of complexity. Springer, Berlin, pp 517\u2013535","DOI":"10.1007\/3-540-31662-0_40"},{"key":"25_CR8","unstructured":"Ferreira C (2006) Gene expression programming: mathematical modeling by an artificial intelligence. Studies in computational intelligence. Springer, New York"},{"key":"25_CR9","unstructured":"Fogel LJ (1964) On the organization of intellect. PhD thesis, UCLA"},{"key":"25_CR10","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. Optimization Letters, 7(6):1303\u20131324"},{"key":"25_CR11","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading"},{"key":"25_CR12","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":"25_CR13","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":"25_CR14","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":"25_CR15","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves JF, Resende MG (2014) An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling. Int Trans Oper Res 21(2):215\u2013246","DOI":"10.1111\/itor.12044"},{"key":"25_CR16","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":"25_CR17","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves J, Resende M, Toso R (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":"25_CR18","unstructured":"Gon\u00e7alves JF, Resende MGC, Costa MD (2014) A biased random-key genetic algorithm for the minimization of open stacks problem. Int Trans Oper Res. Published online 2 July 2014"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves JF, de Magalh\u00e3es Mendes JJ, Resende MG (2015) The basic multi-project scheduling problem. In: Schwindt C, Zimmermann J (eds) Handbook on project management and scheduling, vol 2. Springer, Berlin, pp 667\u2013683","DOI":"10.1007\/978-3-319-05915-0_1"},{"key":"25_CR20","unstructured":"Koza JR (1992) Genetic programming: on the programming of computers by means of natural selection, vol 1. MIT, Cambridge"},{"key":"25_CR21","unstructured":"Koza JR (1994) Genetic programming II: automatic discovery of reusable subprograms. MIT, Cambridge"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Koza JR, Bennett FH III, Andre D, Keane MA (1999) Genetic Programming III: Darwinian invention and problem solving. Morgan Kaufmann, San Francisco","DOI":"10.1109\/TEVC.1999.788530"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Koza JR, Keane MA, Streeter MJ, Mydlowec W, Yu J, Lanza G (2003) Genetic programming IV: routine human-competitive machine intelligence. Kluwer Academic, Norwell\/Dordrecht","DOI":"10.1117\/12.512613"},{"key":"25_CR24","unstructured":"Poli R (1997) Evolution of graph-like programs with parallel distributed genetic programming. In: Proceedings of the 7th international conference on genetic algorithms (ICGA), East Lansing, pp 346\u2013353"},{"key":"25_CR25","unstructured":"Spears WM, DeJong KA (1991) On the virtues of parameterized uniform crossover. In: Proceedings of the fourth international conference on genetic algorithms, San Diego, pp 230\u2013236"}],"container-title":["Handbook of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07124-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T07:17:46Z","timestamp":1571728666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_25","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}