{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T21:10:14Z","timestamp":1759871414592,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","funder":[{"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":[[2025,7,14]]},"DOI":"10.1145\/3712256.3726377","type":"proceedings-article","created":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T12:28:18Z","timestamp":1751977698000},"page":"67-75","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Evolving Diverse Differentiating Stochastic Constraints Using Multi-objective Indicators"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5307-2567","authenticated-orcid":false,"given":"Saba","family":"Sadeghi Ahouei","sequence":"first","affiliation":[{"name":"Optimisation and Logistics, School of Computer and Mathematical Sciences, Univerisity of Adelaide, Adelaide, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"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, Univerisity of Adelaide, Adelaide, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"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, Univerisity of Adelaide, Adelaide, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Saba Sadeghi Ahouei Denis Antipov Aneta Neumann and Frank Neumann. 2025. Feature-based Evolutionary Diversity Optimization of Discriminating Instances for Chance-constrained Optimization Problems. arXiv:2501.14284 [cs.NE] https:\/\/arxiv.org\/abs\/2501.14284","DOI":"10.1007\/978-3-031-86849-8_12"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Saba Sadeghi Ahouei Jacob de Nobel Aneta Neumann Thomas B\u00e4ck and Frank Neumann. 2024. Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem. In GECCO. ACM.","DOI":"10.1145\/3638529.3654181"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Jakob Bossek Pascal Kerschke Aneta Neumann Markus Wagner Frank Neumann and Heike Trautmann. 2019. Evolving diverse TSP instances by means of novel and creative mutation operators. In FOGA. ACM 58\u201371.","DOI":"10.1145\/3299904.3340307"},{"key":"e_1_3_2_1_4_1","first-page":"205","article-title":"IOHexperimenter","volume":"32","author":"de Nobel Jacob","year":"2024","unstructured":"Jacob de Nobel, Furong Ye, Diederick Vermetten, Hao Wang, Carola Doerr, and Thomas B\u00e4ck. 2024. IOHexperimenter: Benchmarking Platform for Iterative Optimization Heuristics. Evol. Comput. 32, 3 (2024), 205\u2013210.","journal-title":"Benchmarking Platform for Iterative Optimization Heuristics. Evol. Comput."},{"key":"e_1_3_2_1_5_1","volume-title":"Sutton","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 AAAI. AAAI Press, 1460\u20131467."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.106027"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Thilina Pathirage Don Aneta Neumann and Frank Neumann. 2024. The Chance Constrained Travelling Thief Problem: Problem Formulations and Algorithms. In GECCO. ACM.","DOI":"10.1145\/3638529.3654014"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00274"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00242"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-013-9341-2"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Aneta Neumann Wanru Gao Markus Wagner and Frank Neumann. 2019. Evolutionary diversity optimization using multi-objective indicators. In GECCO. ACM 837\u2013845.","DOI":"10.1145\/3321707.3321796"},{"key":"e_1_3_2_1_13_1","volume-title":"Optimizing Monotone Chance-Constrained Submodular Functions Using Evolutionary Multiobjective Algorithms. Evolutionary Computation","author":"Neumann Aneta","year":"2024","unstructured":"Aneta Neumann and Frank Neumann. 2024. Optimizing Monotone Chance-Constrained Submodular Functions Using Evolutionary Multiobjective Algorithms. Evolutionary Computation (2024), 1\u201331."},{"volume-title":"Feature-based algorithm selection for constrained continuous optimisation","author":"Neumann Frank","key":"e_1_3_2_1_14_1","unstructured":"Frank Neumann and Shayan Poursoltan. 2016. Feature-based algorithm selection for constrained continuous optimisation. In CEC. IEEE, 1461\u20131468."},{"key":"e_1_3_2_1_15_1","volume-title":"Sutton","author":"Neumann Frank","year":"2019","unstructured":"Frank Neumann and Andrew M. Sutton. 2019. Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem. In FOGA. ACM, 147\u2013153."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Frank Neumann and Carsten Witt. 2022. Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables. In IJCAI. ijcai.org 4800\u20134806.","DOI":"10.24963\/ijcai.2022\/665"},{"volume-title":"PPSN (3) (Lecture Notes in Computer Science","author":"Neumann Frank","key":"e_1_3_2_1_17_1","unstructured":"Frank Neumann and Carsten Witt. 2024. Sliding Window 3-Objective Pareto Optimization for Problems with Chance Constraints. In PPSN (3) (Lecture Notes in Computer Science, Vol. 15150). Springer, 36\u201352."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Ishara Hewa Pathiranage Frank Neumann Denis Antipov and Aneta Neumann. 2024. Effective 2- and 3-Objective MOEA\/D Approaches for the Chance Constrained Knapsack Problem. In GECCO. ACM.","DOI":"10.1145\/3638529.3654066"},{"key":"e_1_3_2_1_19_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. In GECCO. ACM.","DOI":"10.1145\/3638529.3654067"},{"volume-title":"PPSN (2) (Lecture Notes in Computer Science","author":"Shi Feng","key":"e_1_3_2_1_20_1","unstructured":"Feng Shi, Xiankun Yan, and Frank Neumann. 2022. Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling Problem. In PPSN (2) (Lecture Notes in Computer Science, Vol. 13399). Springer, 526\u2013541."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1996.542653"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Yue Xie Oscar Harper Hirad Assimi Aneta Neumann and Frank Neumann. 2019. Evolutionary algorithms for the chance-constrained knapsack problem. In GECCO. ACM 338\u2013346.","DOI":"10.1145\/3321707.3321869"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Yue Xie Aneta Neumann and Frank Neumann. 2020. Specific single- and multi-objective evolutionary algorithms for the chance-constrained knapsack problem. In GECCO. ACM 271\u2013279.","DOI":"10.1145\/3377930.3390162"},{"key":"e_1_3_2_1_24_1","volume-title":"Feng Shi, Xiaoyu Qin, and Frank Neumann.","author":"Yan Xiankun","year":"2023","unstructured":"Xiankun Yan, Anh Viet Do, Feng Shi, Xiaoyu Qin, and Frank Neumann. 2023. Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties. In ECAI (Frontiers in Artificial Intelligence and Applications, Vol. 372). IOS Press, 2826\u20132833."},{"key":"e_1_3_2_1_25_1","unstructured":"Xiankun Yan Aneta Neumann and Frank Neumann. 2024. Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems. In GECCO. ACM."}],"event":{"name":"GECCO '25: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"NH Malaga Hotel Malaga Spain","acronym":"GECCO '25"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712256.3726377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T20:42:41Z","timestamp":1759869761000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712256.3726377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,13]]},"references-count":25,"alternative-id":["10.1145\/3712256.3726377","10.1145\/3712256"],"URL":"https:\/\/doi.org\/10.1145\/3712256.3726377","relation":{},"subject":[],"published":{"date-parts":[[2025,7,13]]},"assertion":[{"value":"2025-07-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}