{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T18:04:37Z","timestamp":1762106677308,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031700545"},{"type":"electronic","value":"9783031700552"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-70055-2_8","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:54Z","timestamp":1725663774000},"page":"116-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Multi-objective Evolutionary Approaches for\u00a0the\u00a0Knapsack Problem with\u00a0Stochastic Profits"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0748-0815","authenticated-orcid":false,"given":"Kokila Kasuni","family":"Perera","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2721-3618","authenticated-orcid":false,"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0036-4782","authenticated-orcid":false,"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"key":"8_CR1","first-page":"3304","volume":"53","author":"Y Abe","year":"2020","unstructured":"Abe, Y., Ogura, M., Tsuji, H., Miura, A., Adachi, S.: Resource and network management for satellite communications systems: a chance-constrained approach. IFAC 53, 3304\u20133309 (2020)","journal-title":"IFAC"},{"key":"8_CR2","unstructured":"Ahouei, S.S., de\u00a0Nobel, J., Neumann, A., B\u00e4ck, T., Neumann, F.: Evolving reliable differentiating constraints for the chance-constrained maximum coverage problem. In: Genetic and Evolutionary Computation Conference, GECCO 2024. ACM (2024)"},{"key":"8_CR3","unstructured":"Assimi, H., Harper, O., Xie, Y., Neumann, A., Neumann, F.: Evolutionary bi-objective optimization for the dynamic chance-constrained knapsack problem based on tail bound objectives. In: 24th European Conference on Artificial Intelligence, vol.\u00a0325, pp. 307\u2013314. IOS Press (2020)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Baumeister, D., Boes, L., Lau\u00dfmann, C.: Time-constrained participatory budgeting under uncertain project costs. In: Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI), pp. 74\u201380 (2022)","DOI":"10.24963\/ijcai.2022\/11"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Chauhan, A., Baranwal, M., Basumatary, A.: PowRL: a reinforcement learning framework for robust management of power networks. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a037, pp. 14757\u201314764 (2023)","DOI":"10.1609\/aaai.v37i12.26724"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Coello, C., Van Veldhuizen, D., Lamont, G.: Evolutionary Algorithms for Solving Multi-Objective Problems. Genetic Algorithms and Evolutionary Computation. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-0-387-36797-2","DOI":"10.1007\/978-0-387-36797-2"},{"key":"8_CR7","unstructured":"Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Hoboken (2001)"},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"8_CR9","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1109\/TEVC.2009.2014361","volume":"13","author":"K Deb","year":"2009","unstructured":"Deb, K., Gupta, S., Daum, D., Branke, J., Mall, A.K., Padmanabhan, D.: Reliability-based optimization using evolutionary algorithms. IEEE Trans. Evol. Comput. 13(5), 1054\u20131074 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., Neumann, A., Neumann, F., Sutton, A.M.: Optimization of chance-constrained submodular functions. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, pp. 1460\u20131467. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i02.5504"},{"key":"8_CR11","unstructured":"Don, T.P., Neumann, A., Neumann, F.: The chance constrained travelling thief problem: problem formulations and algorithms. In: Genetic and Evolutionary Computation Conference, GECCO 2024. ACM (2024)"},{"key":"8_CR12","unstructured":"Doskoc, V., Friedrich, T., G\u00f6bel, A., Neumann, A., Neumann, F., Quinzan, F.: Non-monotone submodular maximization with multiple knapsacks in static and dynamic settings. In: 24th European Conference on Artificial Intelligence, vol.\u00a0325, pp. 435\u2013442 (2020)"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.arcontrol.2019.05.005","volume":"47","author":"X Geng","year":"2019","unstructured":"Geng, X., Xie, L.: Data-driven decision making in power systems with probabilistic guarantees: theory and applications of chance-constrained optimization. Annu. Rev. Control. 47, 341\u2013363 (2019)","journal-title":"Annu. Rev. Control."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Giel, O.: Expected runtimes of a simple multi-objective evolutionary algorithm. In: The 2003 Congress on Evolutionary Computation, vol.\u00a03, pp. 1918\u20131925 (2003)","DOI":"10.1109\/CEC.2003.1299908"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"He, F., Shao, G.: An evolutionary algorithm for uncertain optimization problems. In: 2009 International Conference on Information Engineering and Computer Science, pp.\u00a01\u20134. IEEE (2009)","DOI":"10.1109\/ICIECS.2009.5366513"},{"key":"8_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24777-7"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.trc.2015.01.027","volume":"55","author":"K Kepaptsoglou","year":"2015","unstructured":"Kepaptsoglou, K., Fountas, G., Karlaftis, M.G.: Weather impact on containership routing in closed seas. Transp. Res. Part C Emerg. Technol. 55, 139\u2013155 (2015)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"issue":"6","key":"8_CR18","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1109\/TEVC.2013.2244898","volume":"17","author":"B Liu","year":"2013","unstructured":"Liu, B., Zhang, Q., Fern\u00e1ndez, F.V., Gielen, G.G.E.: An efficient evolutionary algorithm for chance-constrained bi-objective stochastic optimization. IEEE Trans. Evol. Comput. 17(6), 786\u2013796 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"8_CR19","unstructured":"Loughlin, D.H., Ranjithan, S.R.: Chance-constrained genetic algorithms. In: Genetic and Evolutionary Computation Conference, GECCO 1999, pp. 369\u2013376. Morgan Kaufmann Publishers Inc. (1999)"},{"issue":"2","key":"8_CR20","doi-asserted-by":"publisher","first-page":"272","DOI":"10.20965\/jaciii.2013.p0272","volume":"17","author":"K Masutomi","year":"2013","unstructured":"Masutomi, K., Nagata, Y., Ono, I.: An evolutionary algorithm for black-box chance-constrained function optimization. J. Adv. Comput. Intell. Intell. Inform. 17(2), 272\u2013282 (2013)","journal-title":"J. Adv. Comput. Intell. Intell. Inform."},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)","DOI":"10.1017\/CBO9780511813603"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Neumann, A., Bossek, J., Neumann, F.: Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions. In: GECCO 2021: Genetic and Evolutionary Computation Conference 2021, pp. 261\u2013269. ACM (2021)","DOI":"10.1145\/3449639.3459385"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-030-58112-1_28","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"A Neumann","year":"2020","unstructured":"Neumann, A., Neumann, F.: Optimising monotone chance-constrained submodular functions using evolutionary multi-objective algorithms. In: B\u00e4ck, T., et al. (eds.) PPSN 2020. LNCS, vol. 12269, pp. 404\u2013417. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58112-1_28"},{"key":"8_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-031-14714-2_21","volume-title":"PPSN XVII 2022","author":"A Neumann","year":"2022","unstructured":"Neumann, A., Xie, Y., Neumann, F.: Evolutionary algorithms for limiting the effect of uncertainty for the knapsack problem with stochastic profits. In: Rudolph, G., Kononova, A.V., Aguirre, H., Kerschke, P., Ochoa, G., Tu\u0161ar, T. (eds.) PPSN XVII 2022. LNCS, vol. 13398, pp. 294\u2013307. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14714-2_21"},{"key":"8_CR25","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-030-29414-4_7","volume-title":"Theory of Evolutionary Computation","author":"F Neumann","year":"2020","unstructured":"Neumann, F., Pourhassan, M., Roostapour, V.: Analysis of evolutionary algorithms in dynamic and stochastic environments. In: Theory of Evolutionary Computation. NCS, pp. 323\u2013357. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_7"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Neumann, F., Sutton, A.M.: Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem. In: FOGA 2019, pp. 147\u2013153. ACM (2019)","DOI":"10.1145\/3299904.3340315"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Neumann, F., Witt, C.: Runtime analysis of single- and multi-objective evolutionary algorithms for chance constrained optimization problems with normally distributed random variables. In: Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI), pp. 4800\u20134806 (2022)","DOI":"10.24963\/ijcai.2022\/665"},{"key":"8_CR28","unstructured":"Pathiranage, I.H., Neumann, F., Antipov, D., Neumann, A.: Effective 2- and 3-objective MOEA\/D approaches for the chance constrained knapsack problem. In: Genetic and Evolutionary Computation Conference, GECCO 2024. ACM (2024)"},{"key":"8_CR29","unstructured":"Pathiranage, I.H., Neumann, F., Antipov, D., Neumann, A.: Using 3-objective evolutionary algorithms for the dynamic chance constrained knapsack problem. In: Genetic and Evolutionary Computation Conference, GECCO 2024. ACM (2024)"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Perera, K., Neumann, A.: Multi-objective evolutionary algorithms with sliding window selection for the dynamic chance-constrained knapsack problem. In: Genetic and Evolutionary Computation Conference, GECCO 2024. ACM (2024)","DOI":"10.1145\/3638529.3654081"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Reid, W., Neumann, A., Ratcliffe, S., Neumann, F.: Advanced mine optimisation under uncertainty using evolution. In: GECCO 2021: Genetic and Evolutionary Computation Conference, Companion Volume, pp. 1605\u20131613. ACM (2021)","DOI":"10.1145\/3449726.3463135"},{"key":"8_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-319-99253-2_13","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"V Roostapour","year":"2018","unstructured":"Roostapour, V., Neumann, A., Neumann, F.: On the performance of baseline evolutionary algorithms on the dynamic knapsack problem. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11101, pp. 158\u2013169. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99253-2_13"},{"key":"8_CR33","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.tcs.2022.05.008","volume":"924","author":"V Roostapour","year":"2022","unstructured":"Roostapour, V., Neumann, A., Neumann, F.: Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints. Theor. Comput. Sci. 924, 129\u2013147 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103597","volume":"302","author":"V Roostapour","year":"2022","unstructured":"Roostapour, V., Neumann, A., Neumann, F., Friedrich, T.: Pareto optimization for subset selection with dynamic cost constraints. Artif. Intell. 302, 103597 (2022)","journal-title":"Artif. Intell."},{"key":"8_CR35","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/978-3-031-14721-0_37","volume-title":"PPSN XVII 2022","author":"F Shi","year":"2022","unstructured":"Shi, F., Yan, X., Neumann, F.: Runtime analysis of simple evolutionary algorithms for the chance-constrained makespan scheduling problem. In: Rudolph, G., Kononova, A.V., Aguirre, H., Kerschke, P., Ochoa, G., Tu\u0161ar, T. (eds.) PPSN XVII 2022. LNCS, vol. 13399, pp. 526\u2013541. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14721-0_37"},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"Stimson, M., Reid, W., Neumann, A., Ratcliffe, S., Neumann, F.: Improving confidence in evolutionary mine scheduling via uncertainty discounting. In: IEEE Congress on Evolutionary Computation, CEC 2023, pp. 1\u201310. IEEE (2023)","DOI":"10.1109\/CEC53210.2023.10254112"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Wang, A.J., Williams, B.C.: Chance-constrained scheduling via conflict-directed risk allocation. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI 2015, pp. 3620\u20133627. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9693"},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"Xie, Y., Harper, O., Assimi, H., Neumann, A., Neumann, F.: Evolutionary algorithms for the chance-constrained knapsack problem. In: Genetic and Evolutionary Computation Conference, GECCO 2019, pp. 338\u2013346. ACM (2019)","DOI":"10.1145\/3321707.3321869"},{"key":"8_CR39","doi-asserted-by":"crossref","unstructured":"Xie, Y., Neumann, A., Neumann, F.: Specific single- and multi-objective evolutionary algorithms for the chance-constrained knapsack problem. In: Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 271\u2013279. ACM (2020)","DOI":"10.1145\/3377930.3390162"},{"key":"8_CR40","doi-asserted-by":"crossref","unstructured":"Xie, Y., Neumann, A., Neumann, F.: Heuristic strategies for solving complex interacting stockpile blending problem with chance constraints. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 1079\u20131087. ACM (2021)","DOI":"10.1109\/CEC45853.2021.9504901"},{"key":"8_CR41","doi-asserted-by":"crossref","unstructured":"Xie, Y., Neumann, A., Neumann, F., Sutton, A.M.: Runtime analysis of RLS and the (1+1) EA for the chance-constrained knapsack problem with correlated uniform weights. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 1187\u20131194. ACM (2021)","DOI":"10.1145\/3449639.3459381"},{"key":"8_CR42","doi-asserted-by":"crossref","unstructured":"Yan, X., Neumann, A., Neumann, F.: Sampling-based pareto optimization for chance-constrained monotone submodular problems. In: Genetic and Evolutionary Computation Conference, GECCO 2024. ACM (2024)","DOI":"10.1145\/3638529.3654176"},{"key":"8_CR43","doi-asserted-by":"crossref","unstructured":"Yan, X., Neumann, A., Neumann, F.: Sliding window bi-objective evolutionary algorithms for optimizing chance-constrained monotone submodular functions. In: Parallel Problem Solving from Nature XVIII, PPSN 2024 (2024, to appear)","DOI":"10.1007\/978-3-031-70055-2_2"},{"issue":"6","key":"8_CR44","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70055-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T21:39:24Z","timestamp":1732743564000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70055-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700545","9783031700552"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70055-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}