{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:48:41Z","timestamp":1762300121253,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147135"},{"type":"electronic","value":"9783031147142"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14714-2_21","type":"book-chapter","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T21:03:13Z","timestamp":1660424593000},"page":"294-307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Evolutionary Algorithms for\u00a0Limiting the\u00a0Effect of\u00a0Uncertainty for\u00a0the\u00a0Knapsack Problem with\u00a0Stochastic Profits"],"prefix":"10.1007","author":[{"given":"Aneta","family":"Neumann","sequence":"first","affiliation":[]},{"given":"Yue","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Antipov, D., Buzdalov, M., Doerr, B.: Fast mutation in crossover-based algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 1268\u20131276. ACM (2020)","DOI":"10.1145\/3377930.3390172"},{"key":"21_CR2","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: ECAI 2020\u201324th European Conference on Artificial Intelligence. Frontiers in Artificial Intelligence and Applications, vol. 325, pp. 307\u2013314. IOS Press (2020)"},{"key":"21_CR3","unstructured":"Capponi, L.N., Peroni, R.d.L.: Mine planning under uncertainty. Insights Mining Sci. Technol. 2(1), 17\u201325 (2020)"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/mnsc.6.1.73","volume":"6","author":"A Charnes","year":"1959","unstructured":"Charnes, A., Cooper, W.W.: Chance-constrained programming. Manage. Sci. 6(1), 73\u201379 (1959)","journal-title":"Manage. Sci."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Chiong, R., Weise, T., Michalewicz, Z. (eds.): Variants of evolutionary algorithms for real-world applications. Springer (2012)","DOI":"10.1007\/978-3-642-23424-8"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Corder, G.W., Foreman, D.I.: Nonparametric Statistics for Non-statisticians: A Step-by-Step Approach. Wiley, Hoboken (2009)","DOI":"10.1002\/9781118165881"},{"key":"21_CR7","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-29414-4_1","volume-title":"Theory of Evolutionary Computation","author":"B Doerr","year":"2020","unstructured":"Doerr, B.: Probabilistic tools for the analysis of randomized optimization heuristics. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation. NCS, pp. 1\u201387. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_1"},{"key":"21_CR8","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":"21_CR9","doi-asserted-by":"crossref","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 777\u2013784. ACM (2017)","DOI":"10.1145\/3071178.3071301"},{"key":"21_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44874-8","volume-title":"Introduction to evolutionary computing","author":"AE Eiben","year":"2015","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to evolutionary computing, 2nd edn. Springer, Natural Computing Series (2015)","edition":"2"},{"issue":"9","key":"21_CR11","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1080\/03057920412331272144","volume":"81","author":"RK Jana","year":"2004","unstructured":"Jana, R.K., Biswal, M.P.: Stochastic simulation-based genetic algorithm for chance constraint programming problems with continuous random variables. Int. J. Comput. Math. 81(9), 1069\u20131076 (2004)","journal-title":"Int. J. Comput. Math."},{"key":"21_CR12","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, Berlin (2004)"},{"issue":"6","key":"21_CR13","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":"21_CR14","unstructured":"Loughlin, D.H., Ranjithan, S.R.: Chance-constrained genetic algorithms. In: Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation - Volume 1, GECCO 1999, pp. 369\u2013376. Morgan Kaufmann Publishers Inc. (1999)"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.cageo.2012.08.008","volume":"51","author":"D Marcotte","year":"2013","unstructured":"Marcotte, D., Caron, J.: Ultimate open pit stochastic optimization. Comput. Geosci. 51, 238\u2013246 (2013)","journal-title":"Comput. Geosci."},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Morton, D.P., Wood, R.K.: On a stochastic knapsack problem and generalizations, pp. 149\u2013168. Springer, US, Boston, MA (1998)","DOI":"10.1007\/978-1-4757-2807-1_5"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Myburgh, C., Deb, K.: Evolutionary algorithms in large-scale open pit mine scheduling. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2010, pp. 1155\u20131162. ACM (2010)","DOI":"10.1145\/1830483.1830696"},{"key":"21_CR18","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., Preuss, M., Deutz, A., Wang, H., Doerr, C., Emmerich, M., Trautmann, H. (eds.) PPSN 2020. LNCS, vol. 12269, pp. 404\u2013417. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58112-1_28"},{"key":"21_CR19","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: Proceedings of the 15th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms, FOGA 2019, pp. 147\u2013153. ACM (2019)","DOI":"10.1145\/3299904.3340315"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Osada, Y., While, R.L., Barone, L., Michalewicz, Z.: Multi-mine planning using a multi-objective evolutionary algorithm. In: IEEE Congress on Evolutionary Computation, pp. 2902\u20132909 (2013)","DOI":"10.1109\/CEC.2013.6557922"},{"issue":"9","key":"21_CR21","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","volume":"32","author":"D Pisinger","year":"2005","unstructured":"Pisinger, D.: Where are the hard knapsack problems? Comput. Oper. Res. 32(9), 2271\u20132284 (2005)","journal-title":"Comput. Oper. Res."},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.swevo.2016.09.002","volume":"33","author":"P Rakshit","year":"2017","unstructured":"Rakshit, P., Konar, A., Das, S.: Noisy evolutionary optimization algorithms - a comprehensive survey. Swarm Evol. Comput. 33, 18\u201345 (2017)","journal-title":"Swarm Evol. Comput."},{"key":"21_CR23","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. Theoret. Comput. Sci. 924, 129\u2013147 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR24","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":"21_CR25","doi-asserted-by":"crossref","unstructured":"Xie, Y., Harper, O., Assimi, H., Neumann, A., Neumann, F.: Evolutionary algorithms for the chance-constrained knapsack problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019, pp. 338\u2013346. ACM (2019)","DOI":"10.1145\/3321707.3321869"},{"key":"21_CR26","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: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 271\u2013279. ACM (2020)","DOI":"10.1145\/3377930.3390162"},{"key":"21_CR27","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: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 1187\u20131194. ACM (2021)","DOI":"10.1145\/3449639.3459381"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14714-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:43:50Z","timestamp":1710261830000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14714-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147135","9783031147142"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14714-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 August 2022","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":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.75","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}