{"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":1783749358971,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":39,"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\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,14]]},"DOI":"10.1145\/3638529.3654081","type":"proceedings-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T16:33:04Z","timestamp":1720456384000},"page":"223-231","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Multi-Objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0748-0815","authenticated-orcid":false,"given":"Kokila Kasuni","family":"Perera","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-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.1007\/s12532-008-0001-1"},{"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":"Evolutionary Bi-Objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives. In 24th European Conference on Artificial Intelligence","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 24th European Conference on Artificial Intelligence, Vol. 325. IOS Press, 307--314."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590384"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2014361"},{"key":"e_1_3_2_1_6_1","volume-title":"Optimization of Chance-Constrained Submodular Functions. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI","author":"Doerr Benjamin","year":"2020","unstructured":"Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, and Andrew M. Sutton. 2020. Optimization of Chance-Constrained Submodular Functions. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020. AAAI Press, 1460--1467."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3472304"},{"key":"e_1_3_2_1_8_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_9_1","volume-title":"An Evolutionary Algorithm for Uncertain Optimization Problems. In 2009 International Conference on Information Engineering and Computer Science. IEEE, 1--4.","author":"He Fangguo","year":"2009","unstructured":"Fangguo He and Guiming Shao. 2009. An Evolutionary Algorithm for Uncertain Optimization Problems. In 2009 International Conference on Information Engineering and Computer Science. IEEE, 1--4."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2244898"},{"key":"e_1_3_2_1_11_1","volume-title":"GECCO '99","author":"Loughlin Daniel H.","unstructured":"Daniel H. Loughlin and S. Ranji Ranjithan. 1999. Chance-Constrained Genetic Algorithms. In GECCO '99. Morgan Kaufmann Publishers Inc., 369--376."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.20965\/jaciii.2013.p0272"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1080\/25726668.2021.1916170"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459385"},{"key":"e_1_3_2_1_15_1","volume-title":"PPSN 2020, Proceedings, Part I (Lecture Notes in Computer Science","volume":"417","author":"Neumann Aneta","year":"2020","unstructured":"Aneta Neumann and Frank Neumann. 2020. Optimising Monotone Chance-Constrained Submodular Functions Using Evolutionary Multi-objective Algorithms. In Parallel Problem Solving from Nature - PPSN XVI - 16th International Conference, PPSN 2020, Proceedings, Part I (Lecture Notes in Computer Science, Vol. 12269). Springer, 404--417."},{"key":"e_1_3_2_1_16_1","volume-title":"PPSN 2022, Proceedings, Part I (Lecture Notes in Computer Science","volume":"307","author":"Neumann Aneta","year":"2022","unstructured":"Aneta Neumann, Yue Xie, and Frank Neumann. 2022. Evolutionary algorithms for limiting the effect of uncertainty for the knapsack problem with stochastic profits. In Parallel Problem Solving from Nature - PPSN XVII - 17th International Conference, PPSN 2022, Proceedings, Part I (Lecture Notes in Computer Science, Vol. 13398). Springer, 294--307."},{"key":"e_1_3_2_1_17_1","first-page":"323","article-title":"Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. Springer","volume":"7","author":"Neumann Frank","year":"2020","unstructured":"Frank Neumann, Mojgan Pourhassan, and Vahid Roostapour. 2020. Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. Springer, Chapter 7, 323--357.","journal-title":"Chapter"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the 15th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms, FOGA 2019. ACM, 147--153","author":"Neumann Frank","unstructured":"Frank Neumann and Andrew M. Sutton. 2019. Runtime Analysis of the (1+1) Evolutionary Algorithm for the Chance-Constrained Knapsack Problem. In Proceedings of the 15th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms, FOGA 2019. ACM, 147--153."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/665"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590392"},{"key":"e_1_3_2_1_21_1","volume-title":"Fast Pareto Optimization Using Sliding-Window Selection. In 26th European Conference on Artificial Intelligence","volume":"372","author":"Neumann Frank","year":"2023","unstructured":"Frank Neumann and Carsten Witt. 2023. Fast Pareto Optimization Using Sliding-Window Selection. In 26th European Conference on Artificial Intelligence, Vol. 372. IOS Press, 1771--1778."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2012.05.001"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654066"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654067"},{"key":"e_1_3_2_1_25_1","unstructured":"Kokila Perera Aneta Neumann and Frank Neumann. 2023. Evolutionary Multi-Objective Algorithms for the Knapsack Problems with Stochastic Profits. arXiv:2303.01695 [cs.NE]"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.03.002"},{"key":"e_1_3_2_1_27_1","volume-title":"Parallel Problem Solving from","author":"Roostapour Vahid","unstructured":"Vahid Roostapour, Aneta Neumann, and Frank Neumann. 2018. On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem. In Parallel Problem Solving from Nature - PPSN XV. Springer International Publishing, Cham, 158--169."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.05.008"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103597"},{"key":"e_1_3_2_1_30_1","volume-title":"Introduction to probability models","author":"Ross Sheldon M","unstructured":"Sheldon M Ross. 2014. Introduction to probability models. Academic Press."},{"key":"e_1_3_2_1_31_1","volume-title":"Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling Problem","author":"Shi Feng","unstructured":"Feng Shi, Xiankun Yan, and Frank Neumann. 2022. Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling Problem. In PPSN XVII. Springer, 526--541."},{"key":"e_1_3_2_1_32_1","volume-title":"PPSN (2) (Lecture Notes in Computer Science","author":"Singh Hemant Kumar","unstructured":"Hemant Kumar Singh and J\u00fcrgen Branke. 2022. Identifying Stochastically Non-dominated Solutions Using Evolutionary Computation. In PPSN (2) (Lecture Notes in Computer Science, Vol. 13399). Springer, 193--206."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-005-2239-9"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","author":"Andrew","unstructured":"Andrew J. Wang and Brian C. Williams. 2015. Chance-Constrained Scheduling via Conflict-Directed Risk Allocation. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Austin, Texas) (AAAI'15). AAAI Press, 3620--3627."},{"key":"e_1_3_2_1_35_1","volume-title":"Evolutionary Algorithms for the Chance-Constrained Knapsack Problem. In GECCO '19","author":"Xie Yue","year":"2019","unstructured":"Yue Xie, Oscar Harper, Hirad Assimi, Aneta Neumann, and Frank Neumann. 2019. Evolutionary Algorithms for the Chance-Constrained Knapsack Problem. In GECCO '19. ACM, 338--346."},{"key":"e_1_3_2_1_36_1","volume-title":"Specific Single- and Multi-Objective Evolutionary Algorithms for the Chance-Constrained Knapsack Problem. In GECCO '20","author":"Xie Yue","year":"2020","unstructured":"Yue Xie, Aneta Neumann, and Frank Neumann. 2020. Specific Single- and Multi-Objective Evolutionary Algorithms for the Chance-Constrained Knapsack Problem. In GECCO '20. ACM, 271--279."},{"key":"e_1_3_2_1_37_1","volume-title":"Heuristic Strategies for Solving Complex Interacting Stockpile Blending Problem with Chance Constraints. In GECCO '21","author":"Xie Yue","year":"2021","unstructured":"Yue Xie, Aneta Neumann, and Frank Neumann. 2021. Heuristic Strategies for Solving Complex Interacting Stockpile Blending Problem with Chance Constraints. In GECCO '21. ACM, 1079--1087."},{"key":"e_1_3_2_1_38_1","volume-title":"GECCO '21","author":"Xie Yue","unstructured":"Yue Xie, Aneta Neumann, Frank Neumann, and Andrew M. Sutton. 2021. Runtime Analysis of RLS and the (1+1) EA for the Chance-Constrained Knapsack Problem with Correlated Uniform Weights. In GECCO '21. ACM, 1187--1194."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654176"}],"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.3654081","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638529.3654081","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.3654081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":39,"alternative-id":["10.1145\/3638529.3654081","10.1145\/3638529"],"URL":"https:\/\/doi.org\/10.1145\/3638529.3654081","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"}}]}}