{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T14:35:50Z","timestamp":1780583750133,"version":"3.54.1"},"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\/4.0\/"}],"funder":[{"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.3654014","type":"proceedings-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T16:33:04Z","timestamp":1720456384000},"page":"214-222","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["The Chance Constrained Travelling Thief Problem: Problem Formulations and Algorithms"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7709-5330","authenticated-orcid":false,"given":"Thilina","family":"Pathirage Don","sequence":"first","affiliation":[{"name":"Optimisation and Logistics, School of Computer and Mathematical Sciences, The Univerisity of Adelaide, Adelaide, South Australia, 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 Univerisity of Adelaide, Adelaide, South Australia, 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 Univerisity of Adelaide, Adelaide, South Australia, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Chained Lin-Kernighan for large traveling salesman problems. INFORMS Journal on Computing","author":"Applegate David","year":"2003","unstructured":"David Applegate, Wiliam Cook, and Andre Rohe. 2003. Chained Lin-Kernighan for large traveling salesman problems. INFORMS Journal on Computing; Winter 15 (2003), 82--92. Issue 1."},{"key":"e_1_3_2_1_2_1","volume-title":"ECAI 2020 - Proceedings of the European Conference on Artificial Intelligence","author":"Assimi Hirad","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 ECAI 2020 - Proceedings of the European Conference on Artificial Intelligence. IOS Press, 307--314."},{"key":"e_1_3_2_1_3_1","first-page":"1816","article-title":"Waiting and Relocation Strategies in Online Stochastic Vehicle Routing. Waiting and Relocation Strategies in Online Stochastic Vehicle Routing","volume":"7","author":"Bent Russell","year":"2007","unstructured":"Russell Bent and Pascal Van Hentenryck. 2007. Waiting and Relocation Strategies in Online Stochastic Vehicle Routing. Waiting and Relocation Strategies in Online Stochastic Vehicle Routing. IJCAI 7 (2007), 1816--1821.","journal-title":"IJCAI"},{"key":"e_1_3_2_1_4_1","volume-title":"IJCAI 2003 - Proceedings of the 18th International Joint Conference on Artificial Intelligence. 1362--1363","author":"Bent Russell","year":"2003","unstructured":"Russell Bent and Pascal Van Hentenryck. 2003. Dynamic vehicle routing with stochastic requests. In IJCAI 2003 - Proceedings of the 18th International Joint Conference on Artificial Intelligence. 1362--1363."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2013.6557681"},{"key":"e_1_3_2_1_6_1","volume-title":"GECCO 2014 - Proceedings of the 2014 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, 421--428","author":"Bonyadi Mohammad Reza","year":"2014","unstructured":"Mohammad Reza Bonyadi, Zbigniew Michalewicz, Michal Roman Przybylek, and Adam Wierzbicki. 2014. Socially inspired algorithms for the traveling thief problem. In GECCO 2014 - Proceedings of the 2014 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, 421--428."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2014361"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence 34","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. Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020), 1460--1467. Issue 02."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754716"},{"key":"e_1_3_2_1_10_1","unstructured":"Robert Kohout Kutluhan Erol and C Robert. 1999. In-time agent-based vehicle routing with a stochastic improvement heuristic. In AAAI\/IAAI. 864--869."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106284"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13563-2_53"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.6.930"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-023-09518-7"},{"key":"e_1_3_2_1_15_1","volume-title":"SoCS 2019 - Proceedings of the International Symposium on Combinatorial Search","volume":"10","author":"Namazi Majid","year":"2019","unstructured":"Majid Namazi, M. A. Hakim Newton, Abdul Sattar, and Conrad Sanderson. 2019. A Profit Guided Coordination Heuristic for Travelling Thief Problems. In SoCS 2019 - Proceedings of the International Symposium on Combinatorial Search, Vol. 10. 140--144. Issue 1."},{"key":"e_1_3_2_1_16_1","volume-title":"Surrogate Assisted Optimisation for Travelling Thief Problems. In SoCS 2020 - Proceedings of the 13th International Symposium on Combinatorial Search. The AAAI Press, 111--115","author":"Namazi Majid","year":"2020","unstructured":"Majid Namazi, Conrad Sanderson, M. A. Hakim Newton, and Abdul Sattar. 2020. Surrogate Assisted Optimisation for Travelling Thief Problems. In SoCS 2020 - Proceedings of the 13th International Symposium on Combinatorial Search. The AAAI Press, 111--115."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459385"},{"key":"e_1_3_2_1_18_1","volume-title":"PPSN 2020, Proceedings, Part I (LNCS","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 (LNCS, Vol. 12269). Springer, 404--417."},{"key":"e_1_3_2_1_19_1","volume-title":"PPSN 2022, Proceedings, Part I (LNCS","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 XV1I - 17th International Conference, PPSN 2022, Proceedings, Part I (LNCS, Vol. 13398). Springer, 294--307."},{"key":"e_1_3_2_1_20_1","volume-title":"FOGA 2019 - Proceedings of the 15th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms. Association for Computing Machinery, Inc, 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 FOGA 2019 - Proceedings of the 15th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms. Association for Computing Machinery, Inc, 147--153."},{"key":"e_1_3_2_1_21_1","volume-title":"PPSN 2022, Proceedings, Part I (LNCS","volume":"249","author":"Nikfarjam Adel","year":"2022","unstructured":"Adel Nikfarjam, Aneta Neumann, Jakob Bossek, and Frank Neumann. 2022. Co-evolutionary Diversity Optimisation for the Traveling Thief Problem. In Parallel Problem Solving from Nature - PPSN XVII - 17th International Conference, PPSN 2022, Proceedings, Part I (LNCS, Vol. 13398). Springer, 237--249."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528862"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528752"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654066"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654067"},{"key":"e_1_3_2_1_26_1","volume-title":"Multi-objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem. In Genetic and Evolutionary Computation Conference, GECCO","author":"Perera Kokila","year":"2024","unstructured":"Kokila Perera and Aneta Neumann. 2024. Multi-objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem. In Genetic and Evolutionary Computation Conference, GECCO 2024. ACM. To appear."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598249"},{"key":"e_1_3_2_1_28_1","volume-title":"The Dynamic Travelling Thief Problem: Benchmarks and Performance of Evolutionary Algorithms. In ICONIP 2020 - Neural Information Processing: 27th International Conference","volume":"1333","author":"Sachdeva Ragav","year":"2020","unstructured":"Ragav Sachdeva, Frank Neumann, and Markus Wagner. 2020. The Dynamic Travelling Thief Problem: Benchmarks and Performance of Evolutionary Algorithms. In ICONIP 2020 - Neural Information Processing: 27th International Conference, Vol. 1333. Springer, 220--228."},{"key":"e_1_3_2_1_29_1","volume-title":"Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling Problem. In International Conference on Parallel Problem Solving from Nature","volume":"13399","author":"Shi Feng","year":"2022","unstructured":"Feng Shi, Xiankun Yan, and Frank Neumann. 2022. Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling Problem. In International Conference on Parallel Problem Solving from Nature, Vol. 13399 LNCS. Springer, 526--541."},{"key":"e_1_3_2_1_30_1","volume-title":"Exact Approaches for the Travelling Thief Problem. In SEAL 2017 - Simulated Evolution and Learning: 11th International Conference","volume":"10593","author":"Wu Junhua","year":"2017","unstructured":"Junhua Wu, Markus Wagner, Sergey Polyakovskiy, and Frank Neumann. 2017. Exact Approaches for the Travelling Thief Problem. In SEAL 2017 - Simulated Evolution and Learning: 11th International Conference, Vol. 10593 LNCS. Springer, 110--121."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321766"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321869"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390162"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459381"},{"key":"e_1_3_2_1_35_1","volume-title":"GECCO 2021 - Proceedings of the 2021 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, Inc, 1187--1194","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 2021 - Proceedings of the 2021 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, Inc, 1187--1194."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908847"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.12.011"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3520304.3528798"},{"key":"e_1_3_2_1_39_1","volume-title":"Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties. In ECAI 2023 - 26th European Conference on Artificial Intelligence. IOS Press, Poland, 2826--2833","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 2023 - 26th European Conference on Artificial Intelligence. IOS Press, Poland, 2826--2833."},{"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.1145\/3319619.3326785"}],"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.3654014","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638529.3654014","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.3654014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":41,"alternative-id":["10.1145\/3638529.3654014","10.1145\/3638529"],"URL":"https:\/\/doi.org\/10.1145\/3638529.3654014","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"}}]}}