{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:55:58Z","timestamp":1783749358174,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T00:00:00Z","timestamp":1593043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Australian Research Council award","award":["DP160102401"],"award-info":[{"award-number":["DP160102401"]}]},{"name":"South Australian Government award","award":["Research Consortium Unlocking Complex Resources through Lean Processing"],"award-info":[{"award-number":["Research Consortium Unlocking Complex Resources through Lean Processing"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,25]]},"DOI":"10.1145\/3377930.3390162","type":"proceedings-article","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T19:29:12Z","timestamp":1593458952000},"page":"271-279","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Specific single- and multi-objective evolutionary algorithms for the chance-constrained knapsack problem"],"prefix":"10.1145","author":[{"given":"Yue","family":"Xie","sequence":"first","affiliation":[{"name":"University of Adelaide, Adelaide, SA, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[{"name":"University of Adelaide, Adelaide, SA, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"University of Adelaide, Adelaide, SA, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives. In ECAI 2020 - 24th European Conference on Artificial Intelligence, 2020","author":"Assimi Hirad","year":"2020"},{"key":"e_1_3_2_1_2_1","volume-title":"An overview of genetic algorithms: Part 1, fundamentals","author":"Beasley David","year":"1993"},{"key":"e_1_3_2_1_3_1","volume-title":"An overview of genetic algorithms: Part 2, research topics","author":"Beasley David","year":"1993"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Anand Bhalgat Ashish Goel and Sanjeev Khanna. 2011. Improved approximation results for stochastic knapsack problems. 1647--1665.  Anand Bhalgat Ashish Goel and Sanjeev Khanna. 2011. Improved approximation results for stochastic knapsack problems. 1647--1665.","DOI":"10.1137\/1.9781611973082.127"},{"key":"e_1_3_2_1_5_1","volume-title":"Berger","author":"Casella George","year":"2002"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.01.002"},{"key":"e_1_3_2_1_7_1","volume-title":"Variants of evolutionary algorithms for real-world applications","author":"Chiong Raymond"},{"key":"e_1_3_2_1_8_1","volume-title":"Foreman","author":"Corder Gregory W.","year":"2014"},{"key":"e_1_3_2_1_9_1","volume-title":"Linear Algebra, and Analysis","author":"DasGupta Anirban"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1080.0330"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_3_2_1_12_1","volume-title":"Theory of Evolutionary Computation","author":"Doerr Benjamin"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020","author":"Doerr Benjamin","year":"1911"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/245463.245599"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.782011"},{"key":"e_1_3_2_1_17_1","volume-title":"Parallel Problem Solving from","author":"Friedrich Tobias"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36494-3_37"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2010.01.003"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0931-0"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.09.050"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.04.007"},{"key":"e_1_3_2_1_23_1","unstructured":"Andrzej Jaszkiewicz. 2001. Multiple objective metaheuristic algorithms for combinatorial optimization. Wydawnictwo Politechniki Pozna\u0144skiej.  Andrzej Jaszkiewicz. 2001. Multiple objective metaheuristic algorithms for combinatorial optimization. Wydawnictwo Politechniki Pozna\u0144skiej."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2008.03.006"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-009-0577-5"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2244898"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0443-5"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","volume-title":"An introduction to genetic algorithms","author":"Mitchell Melanie","DOI":"10.7551\/mitpress\/3927.001.0001"},{"key":"e_1_3_2_1_29_1","volume-title":"Randomized Algorithms","author":"Motwani Rajeev"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340315"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2180533"},{"key":"e_1_3_2_1_32_1","volume-title":"Mutation in Genetic Programming: A Preliminary Study. In European Conference on Genetic Programming. Springer, 39--48","author":"Page Jonathan","year":"1999"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2016.09.002"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071270"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/645512.657265"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2006.09.003"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321869"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771163"},{"key":"e_1_3_2_1_39_1","volume-title":"Fast evolution strategies","author":"Yao Xin"}],"event":{"name":"GECCO '20: Genetic and Evolutionary Computation Conference","location":"Canc\u00fan Mexico","acronym":"GECCO '20","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the 2020 Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377930.3390162","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3377930.3390162","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:07Z","timestamp":1750200067000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377930.3390162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,25]]},"references-count":39,"alternative-id":["10.1145\/3377930.3390162","10.1145\/3377930"],"URL":"https:\/\/doi.org\/10.1145\/3377930.3390162","relation":{},"subject":[],"published":{"date-parts":[[2020,6,25]]},"assertion":[{"value":"2020-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}