{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:55:57Z","timestamp":1783749357319,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T00:00:00Z","timestamp":1720915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"name":"Australian Research Council","award":["DP190103894"],"award-info":[{"award-number":["DP190103894"]}]},{"name":"Australian Research Council","award":["FT200100536"],"award-info":[{"award-number":["FT200100536"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,14]]},"DOI":"10.1145\/3638529.3654067","type":"proceedings-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T16:33:04Z","timestamp":1720456384000},"page":"520-528","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8043-994X","authenticated-orcid":false,"given":"Ishara","family":"Hewa Pathiranage","sequence":"first","affiliation":[{"name":"Optimisation and Logistics,School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2721-3618","authenticated-orcid":false,"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"Optimisation and Logistics,School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7906-096X","authenticated-orcid":false,"given":"Denis","family":"Antipov","sequence":"additional","affiliation":[{"name":"Optimisation and Logistics,School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0036-4782","authenticated-orcid":false,"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[{"name":"Optimisation and Logistics,School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2020.12.1492"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654181"},{"key":"e_1_3_2_1_3_1","volume-title":"European Conference on Artificial Intelligence, ECAI","volume":"325","author":"Assimi Hirad","year":"2020","unstructured":"Hirad Assimi, Oscar Harper, Yue Xie, Aneta Neumann, and Frank Neumann. 2020. Evolutionary bi-objective optimization for the dynamic chance-constrained knapsack problem based on tail bound objectives. In European Conference on Artificial Intelligence, ECAI 2020, Vol. 325. IOS Press, 307--314."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321792"},{"key":"e_1_3_2_1_5_1","volume-title":"Brno, Czech Republic, 2023, Proceedings. Lecture Notes in Computer Science","volume":"13987","author":"C\u00e1ceres Leslie P\u00e9rez","year":"2023","unstructured":"Leslie P\u00e9rez C\u00e1ceres and Thomas St\u00fctzle (Eds.). 2023. Evolutionary Computation in Combinatorial Optimization - 23rd European Conference, EvoCOP 2023, Held as Part of EvoStar 2023, Brno, Czech Republic, 2023, Proceedings. Lecture Notes in Computer Science, Vol. 13987. Springer."},{"key":"e_1_3_2_1_6_1","volume-title":"Variants of Evolutionary Algorithms for Real-World Applications","author":"Chiong Raymond","unstructured":"Raymond Chiong, Thomas Weise, and Zbigniew Michalewicz. 2012. Variants of Evolutionary Algorithms for Real-World Applications. Springer."},{"key":"e_1_3_2_1_7_1","volume-title":"Van Veldhuizen","author":"Coello Coello Carlos A.","year":"2007","unstructured":"Carlos A. Coello Coello, Gary B. Lamont, and David A. Van Veldhuizen. 2007. Evolutionary algorithms for solving multi-objective problems (second ed.). Springer."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.08.014"},{"key":"e_1_3_2_1_9_1","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Don Thilina Pathirage","year":"2024","unstructured":"Thilina Pathirage Don, Aneta Neumann, and Frank Neumann. 2024. The chance constrained travelling thief problem: Problem formulations and algorithms. In Genetic and Evolutionary Computation Conference, GECCO 2024. ACM. To appear."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.arcontrol.2019.05.005"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299908"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(81)90004-4"},{"key":"e_1_3_2_1_14_1","volume-title":"Evolutionary dynamic multi-objective optimisation: A survey. Comput. Surveys 55, 4","author":"Jiang Shouyong","year":"2022","unstructured":"Shouyong Jiang, Juan Zou, Shengxiang Yang, and Xin Yao. 2022. Evolutionary dynamic multi-objective optimisation: A survey. Comput. Surveys 55, 4 (2022)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.925798"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2015.09.124"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2244898"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/jsc.2403"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459385"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590405"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58112-1_28"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-14714-2_21"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/665"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590392"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2012.05.001"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC60901.2024.10612008"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654066"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Ishara Hewa Pathiranage Frank Neumann Denis Antipov and Aneta Neumann. 2024. Using 3-objective evolutionary algorithms for the dynamic chance constrained knapsack problem. arXiv:2404.06014 [cs.NE]","DOI":"10.1145\/3638529.3654067"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654081"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598249"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.06.045"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2016.09.002"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449726.3463135"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99253-2_13"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.05.008"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103597"},{"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.1145\/3377930.3390162"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459381"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654176"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"}],"event":{"name":"GECCO '24: Genetic and Evolutionary Computation Conference","location":"Melbourne VIC Australia","acronym":"GECCO '24","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638529.3654067","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638529.3654067","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:56:50Z","timestamp":1750291010000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638529.3654067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":41,"alternative-id":["10.1145\/3638529.3654067","10.1145\/3638529"],"URL":"https:\/\/doi.org\/10.1145\/3638529.3654067","relation":{},"subject":[],"published":{"date-parts":[[2024,7,14]]},"assertion":[{"value":"2024-07-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}