{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:47:28Z","timestamp":1742917648488,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031700705"},{"type":"electronic","value":"9783031700712"}],"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-70071-2_1","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:02:54Z","timestamp":1725649374000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Self-adjusting Evolutionary Algorithms are Slow on\u00a0a\u00a0Class of\u00a0Multimodal Landscapes"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Lengler","sequence":"first","affiliation":[]},{"given":"Konstantin","family":"Sturm","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Dang, D.C., Eremeev, A., Lehre, P.K.: Non-elitist evolutionary algorithms excel in fitness landscapes with sparse deceptive regions and dense valleys. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1133\u20131141 (2021)","DOI":"10.1145\/3449639.3459398"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C.: Theory of parameter control for discrete black-box optimization: provable performance gains through dynamic parameter choices. In: Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pp. 271\u2013321 (2020)","DOI":"10.1007\/978-3-030-29414-4_6"},{"issue":"10","key":"1_CR3","doi-asserted-by":"publisher","first-page":"3108","DOI":"10.1007\/s00453-021-00854-3","volume":"83","author":"B Doerr","year":"2021","unstructured":"Doerr, B., Doerr, C., Lengler, J.: Self-adjusting mutation rates with provably optimal success rules. Algorithmica 83(10), 3108\u20133147 (2021)","journal-title":"Algorithmica"},{"issue":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1007\/s00453-020-00726-2","volume":"83","author":"B Doerr","year":"2021","unstructured":"Doerr, B., Witt, C., Yang, J.: Runtime analysis for self-adaptive mutation rates. Algorithmica 83(4), 1012\u20131053 (2021)","journal-title":"Algorithmica"},{"key":"1_CR5","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications, vol. 2, vol.\u00a081. Wiley, New York (1991)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Hevia\u00a0Fajardo, M.A., Sudholt, D.: Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter. Algorithmica (2023)","DOI":"10.1007\/s00453-023-01153-9"},{"key":"1_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2023.104061","volume":"328","author":"MA Hevia Fajardo","year":"2024","unstructured":"Hevia Fajardo, M.A., Sudholt, D.: Self-adjusting offspring population sizes outperform fixed parameters on the cliff function. Artif. Intell. 328, 104061 (2024)","journal-title":"Artif. Intell."},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1007\/978-3-319-45823-6_74","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"T Jansen","year":"2016","unstructured":"Jansen, T., Zarges, C.: Example landscapes to support analysis of multimodal optimisation. In: Handl, J., Hart, E., Lewis, P.R., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 792\u2013802. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_74"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Jorritsma, J., Lengler, J., Sudholt, D.: Comma selection outperforms plus selection on onemax with randomly planted optima. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1602\u20131610. ACM, New York (2023)","DOI":"10.1145\/3583131.3590488"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-031-57712-3_10","volume-title":"Evolutionary Computation in Combinatorial Optimization - EvoCOP 2024","author":"M Kaufmann","year":"2023","unstructured":"Kaufmann, M., Larcher, M., Lengler, J., Sieberling, O.: Hardest monotone functions for evolutionary algorithms. In: St\u00fctzle, T., Wagner, M. (eds.) EvoCOP 2024. LNCS, vol. 14632, pp. 146\u2013161. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-57712-3_10"},{"key":"1_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114181","volume":"979","author":"M Kaufmann","year":"2023","unstructured":"Kaufmann, M., Larcher, M., Lengler, J., Zou, X.: Self-adjusting population sizes for the (1, $$\\lambda $$)-EA on monotone functions. Theoret. Comput. Sci. 979, 114181 (2023)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Larcher, M., Lengler, J., Zou, X.: Onemax is not the easiest function for fitness improvements. Evol. Comput. 1\u201330 (2024)","DOI":"10.1162\/evco_a_00348"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/B:NACO.0000023416.59689.4e","volume":"3","author":"S Kern","year":"2004","unstructured":"Kern, S., M\u00fcller, S.D., Hansen, N., B\u00fcche, D., Ocenasek, J., Koumoutsakos, P.: Learning probability distributions in continuous evolutionary algorithms - a comparative review. Nat. Comput. 3, 77\u2013112 (2004)","journal-title":"Nat. Comput."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Lengler, J., Schiller, L., Sieberling, O.: Plus strategies are exponentially slower for planted optima of random height. In: Proceedings of the Genetic and Evolutionary Computation Conference (2024)","DOI":"10.1145\/3638529.3654088"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Rechenberg, I.: Evolutionsstrategien. In: Simulationsmethoden in der Medizin und Biologie: Workshop, Hannover, 29 September\u20131 October 1977, pp. 83\u2013114. Springer, Heidelberg (1978)","DOI":"10.1007\/978-3-642-81283-5_8"}],"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-70071-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:09:41Z","timestamp":1725649781000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70071-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700705","9783031700712"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70071-2_1","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":"The authors have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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"}}]}}