{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:28:30Z","timestamp":1760646510856,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,20]],"date-time":"2016-07-20T00:00:00Z","timestamp":1468972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,20]]},"DOI":"10.1145\/2908961.2926996","type":"proceedings-article","created":{"date-parts":[[2016,7,29]],"date-time":"2016-07-29T19:04:16Z","timestamp":1469819056000},"page":"483-514","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Biased Ranom-Key Genetic Algorithms"],"prefix":"10.1145","author":[{"given":"Mauricio G.C.","family":"Resende","sequence":"first","affiliation":[{"name":"Amazon.com, Inc., Seattle, WA, USA"}]},{"given":"Celso C.","family":"Ribeiro","sequence":"additional","affiliation":[{"name":"U. Federal Fluminense, Niter\u00f3i, Brazil"}]}],"member":"320","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-010-9143-1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2738850.2738854"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-009-9282-1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.03.009"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2013.04.019"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.04.029"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014852026591"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1071747.1071748"},{"key":"e_1_3_2_1_9_1","first-page":"60","volume-title":"SIAM","author":"Breslau L.","year":"2011","unstructured":"L. Breslau , I. Diakonikolas , N. Duffield , Y. Gu , M. Hajiaghayi , D.S. Johnson , H. Karloff , M.G.C. Resende , and S. Sen , \" Disjoint-path facility location: Theory and practice,\" Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX11) , SIAM , San Francisco , pp. 60 -- 74 , January 22, 2011 . L. Breslau, I. Diakonikolas, N. Duffield, Y. Gu, M. Hajiaghayi, D.S. Johnson, H. Karloff, M.G.C. Resende, and S. Sen, \"Disjoint-path facility location: Theory and practice,\" Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX11), SIAM, San Francisco, pp. 60--74, January 22, 2011."},{"key":"e_1_3_2_1_10_1","volume-title":"Prague","author":"Brand\u00e3o J.S.","year":"2015","unstructured":"J.S. Brand\u00e3o , T.G. Noronha , M.G.C. Resende , and C.C. Ribeiro , \" Biased random key genetic algorithms for scheduling divisible loads: single- and multi-round cases,\" Proceedings of MISTA , Prague , 2015 . J.S. Brand\u00e3o, T.G. Noronha, M.G.C. Resende, and C.C. Ribeiro, \"Biased random key genetic algorithms for scheduling divisible loads: single- and multi-round cases,\" Proceedings of MISTA, Prague, 2015."}],"event":{"name":"GECCO '16: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Denver Colorado USA","acronym":"GECCO '16"},"container-title":["Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2908961.2926996","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2908961.2926996","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:01Z","timestamp":1750222501000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2908961.2926996"}},"subtitle":["An Advanced Tutorial"],"short-title":[],"issued":{"date-parts":[[2016,7,20]]},"references-count":10,"alternative-id":["10.1145\/2908961.2926996","10.1145\/2908961"],"URL":"https:\/\/doi.org\/10.1145\/2908961.2926996","relation":{},"subject":[],"published":{"date-parts":[[2016,7,20]]},"assertion":[{"value":"2016-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}