{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T21:16:30Z","timestamp":1784582190151,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":45,"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":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP190103894"],"award-info":[{"award-number":["DP190103894"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["FT200100536"],"award-info":[{"award-number":["FT200100536"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,14]]},"DOI":"10.1145\/3638529.3654066","type":"proceedings-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T16:33:04Z","timestamp":1720456384000},"page":"187-195","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Effective 2- and 3-Objective MOEA\/D Approaches for the 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.1145\/3638529.3654181"},{"key":"e_1_3_2_1_2_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_3_1","volume-title":"Robust optimization","author":"Ben-Tal Aharon","unstructured":"Aharon Ben-Tal, Laurent Ghaoui, and Arkadi Nemirovski. 2009. Robust optimization. Princeton University Press."},{"key":"e_1_3_2_1_4_1","volume-title":"Chance-constrained programming. Management science 6, 1","author":"Charnes Abraham","year":"1959","unstructured":"Abraham Charnes and William W Cooper. 1959. Chance-constrained programming. Management science 6, 1 (1959), 73--79."},{"key":"e_1_3_2_1_5_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_6_1","volume-title":"IEEE Congress on Evolutionary Computation, CEC","volume":"2","author":"Carlos","year":"2002","unstructured":"Carlos A. Coello Coello and M.S. Lechuga. 2002. MOPSO: A proposal for multiple objective particle swarm optimization. In IEEE Congress on Evolutionary Computation, CEC 2002, Vol. 2. 1051--1056."},{"key":"e_1_3_2_1_7_1","volume-title":"Oates","author":"Corne David W.","year":"2000","unstructured":"David W. Corne, Joshua D. Knowles, and Martin J. Oates. 2000. The Pareto envelope-based selection algorithm for multiobjective optimization. In Parallel Problem Solving from Nature PPSN VI, 2000. Springer, 839--848."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_3_2_1_9_1","volume-title":"Advances in Neural Information Processing Systems","volume":"36","author":"Do Arm Viet","year":"2023","unstructured":"Arm Viet Do, Aneta Neumann, Frank Neumann, and Andrew Sutton. 2023. Rigorous runtime analysis of MOEA\/D for solving multi-objective minimum weight base problems. In Advances in Neural Information Processing Systems, Vol. 36. Curran Associates, Inc., 36434--36448."},{"key":"e_1_3_2_1_10_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_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jprocont.2016.03.005"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299908"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.09.050"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(81)90004-4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.925798"},{"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","volume-title":"Soft Computing 20 (07","author":"Ma Xiaoliang","year":"2015","unstructured":"Xiaoliang Ma, Fang Liu, Yutao Qi, Lingling Li, Licheng Jiao, Xiaozheng Deng, Xiaodong Wang, Bei Dong, Zhanting Hou, Yongxiao Zhang, and Jianshe Wu. 2015. MOEA\/D with biased weight adjustment inspired by user preference and its application on multi-objective reservoir flood control problem. Soft Computing 20 (07 2015)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1080\/25726668.2021.1916170"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459385"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590405"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58112-1_28"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-14714-2_21"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-006-9004-x"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/665"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590392"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC60901.2024.10612008"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654067"},{"key":"e_1_3_2_1_29_1","volume-title":"Comparison between MOEA\/D and NSGA-II on the multi-objective travelling salesman problem","author":"Peng Wei","unstructured":"Wei Peng, Qingfu Zhang, and Hui Li. 2009. Comparison between MOEA\/D and NSGA-II on the multi-objective travelling salesman problem. Springer, 309--324."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654081"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598249"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.06.045"},{"key":"e_1_3_2_1_33_1","volume-title":"Advances in Neural Information Processing Systems","volume":"28","author":"Qian Chao","year":"2015","unstructured":"Chao Qian, Yang Yu, and Zhi-Hua Zhou. 2015. Subset selection by Pareto optimization. In Advances in Neural Information Processing Systems, Vol. 28. Curran Associates, Inc."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2016.09.002"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449726.3463135"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC53210.2023.10254112"},{"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.3459382"},{"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.1016\/j.cor.2012.01.001"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.06.022"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"e_1_3_2_1_44_1","first-page":"1","article-title":"An improved MOEA\/D for multi-objective job shop scheduling problem","volume":"30","author":"Zhao Fuqing","year":"2016","unstructured":"Fuqing Zhao, Zhen Chen, Junbiao Wang, and Chun Zhang. 2016. An improved MOEA\/D for multi-objective job shop scheduling problem. International Journal of Computer Integrated Manufacturing 30 (2016), 1--25.","journal-title":"International Journal of Computer Integrated Manufacturing"},{"key":"e_1_3_2_1_45_1","volume-title":"SPEA2: Improving the strength Pareto evolutionary algorithm. TIK report 103","author":"Zitzler Eckart","year":"2001","unstructured":"Eckart Zitzler, Marco Laumanns, and Lothar Thiele. 2001. SPEA2: Improving the strength Pareto evolutionary algorithm. TIK report 103 (2001)."}],"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.3654066","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638529.3654066","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.3654066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":45,"alternative-id":["10.1145\/3638529.3654066","10.1145\/3638529"],"URL":"https:\/\/doi.org\/10.1145\/3638529.3654066","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"}}]}}