{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T09:28:36Z","timestamp":1759742916142,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031300349"},{"type":"electronic","value":"9783031300356"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30035-6_11","type":"book-chapter","created":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T06:05:48Z","timestamp":1680156348000},"page":"162-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["OneMax Is Not the\u00a0Easiest Function for\u00a0Fitness Improvements"],"prefix":"10.1007","author":[{"given":"Marc","family":"Kaufmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxime","family":"Larcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Lengler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xun","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,31]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Antipov, D., Doerr, B., Yang, Q.: The efficiency threshold for the offspring population size of the $$(\\mu , \\lambda )$$ EA. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 1461\u20131469 (2019)","DOI":"10.1145\/3321707.3321838"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Auger, A.: Benchmarking the (1+ 1) evolution strategy with one-fifth success rule on the BBOB-2009 function testbed. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 2447\u20132452 (2009)","DOI":"10.1145\/1570256.1570342"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1007\/978-3-319-10762-2_88","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"G Badkobeh","year":"2014","unstructured":"Badkobeh, G., Lehre, P.K., Sudholt, D.: Unbiased black-box complexity of\u00a0parallel\u00a0search. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 892\u2013901. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10762-2_88"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-15844-5_1","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"S B\u00f6ttcher","year":"2010","unstructured":"B\u00f6ttcher, S., Doerr, B., Neumann, F.: Optimal fixed and adaptive mutation rates for the LeadingOnes problem. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 1\u201310. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_1"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Colin, S., Doerr, B., F\u00e9rey, G.: Monotonic functions in EC: anything but monotone! In: Genetic and Evolutionary Computation Conference (GECCO), pp. 753\u2013760 (2014)","DOI":"10.1145\/2576768.2598338"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1007\/s00453-016-0201-4","volume":"78","author":"D Corus","year":"2017","unstructured":"Corus, D., He, J., Jansen, T., Oliveto, P.S., Sudholt, D., Zarges, C.: On easiest functions for mutation operators in bio-inspired optimisation. Algorithmica 78(2), 714\u2013740 (2017)","journal-title":"Algorithmica"},{"key":"11_CR7","unstructured":"Devroye, L.: The compound random search. Ph.D. dissertation, Purdue Univ., West Lafayette, IN (1972)"},{"key":"11_CR8","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: Theory of Evolutionary Computation. NCS, pp. 1\u201387. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_1"},{"key":"11_CR9","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-030-29414-4_6","volume-title":"Theory of Evolutionary Computation","author":"B Doerr","year":"2020","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. NCS, pp. 271\u2013321. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_6"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2014.11.028","volume":"567","author":"B Doerr","year":"2015","unstructured":"Doerr, B., Doerr, C., Ebel, F.: From black-box complexity to designing new genetic algorithms. Theor. Comput. Sci. 567, 87\u2013104 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"10","key":"11_CR11","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"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2019.06.014","volume":"801","author":"B Doerr","year":"2020","unstructured":"Doerr, B., Doerr, C., Yang, J.: Optimal parameter choices via precise black-box analysis. Theor. Comput. Sci. 801, 1\u201334 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s00453-012-9622-x","volume":"64","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. Algorithmica 64, 673\u2013697 (2012)","journal-title":"Algorithmica"},{"issue":"4","key":"11_CR14","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":"11_CR15","doi-asserted-by":"crossref","unstructured":"Doerr, C., Wagner, M.: Simple on-the-fly parameter selection mechanisms for two classical discrete black-box optimization benchmark problems. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 943\u2013950 (2018)","DOI":"10.1145\/3205455.3205560"},{"issue":"3","key":"11_CR16","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s11047-006-9001-0","volume":"5","author":"S Droste","year":"2006","unstructured":"Droste, S.: A rigorous analysis of the compact genetic algorithm for linear functions. Nat. Comput. 5(3), 257\u2013283 (2006)","journal-title":"Nat. Comput."},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"AE Eiben","year":"1999","unstructured":"Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Trans. Evol. Comput. 3, 124\u2013141 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1109\/TEVC.2014.2318025","volume":"19","author":"J He","year":"2014","unstructured":"He, J., Chen, T., Yao, X.: On the easiest and hardest fitness functions. IEEE Trans. Evol. Comput. 19(2), 295\u2013305 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Hevia Fajardo, M.A., Sudholt, D.: Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter. arXiv preprint arXiv:2104.05624 (2021)","DOI":"10.1145\/3449639.3459338"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Hevia Fajardo, M.A., Sudholt, D.: Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 1151\u20131159 (2021)","DOI":"10.1145\/3449639.3459338"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-73482-6_4","volume-title":"Foundations of Genetic Algorithms","author":"T Jansen","year":"2007","unstructured":"Jansen, T.: On the brittleness of evolutionary algorithms. In: Stephens, C.R., Toussaint, M., Whitley, D., Stadler, P.F. (eds.) FOGA 2007. LNCS, vol. 4436, pp. 54\u201369. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73482-6_4"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Larcher, M., Lengler, J., Zou, X.: Onemax is not the easiest function for fitness improvements. arXiv preprint arXiv:2204.07017 (2022)","DOI":"10.1007\/978-3-031-30035-6_11"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Larcher, M., Lengler, J., Zou, X.: Self-adjusting population sizes for the $$(1, \\lambda )$$-EA on monotone functions (2022). https:\/\/arxiv.org\/abs\/2204.00531","DOI":"10.1007\/978-3-031-14721-0_40"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Larcher, M., Lengler, J., Zou, X.: Self-adjusting population sizes for the $$(1, \\lambda )$$-EA on monotone functions. In: Rudolph, G., Kononova, A.V., Aguirre, H., Kerschke, P., Ochoa, G., Tusar, T. (eds.) Parallel Problem Solving from Nature (PPSN) XVII. PPSN 2022. Lecture Notes in Computer Science, vol. 13399, pp. 569\u2013585. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14721-0_40","DOI":"10.1007\/978-3-031-14721-0_40"},{"issue":"1","key":"11_CR25","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(1), 77\u2013112 (2004)","journal-title":"Nat. Comput."},{"issue":"3","key":"11_CR26","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/s00453-015-0048-0","volume":"75","author":"T K\u00f6tzing","year":"2016","unstructured":"K\u00f6tzing, T.: Concentration of first hitting times under additive drift. Algorithmica 75(3), 490\u2013506 (2016)","journal-title":"Algorithmica"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Lehre, P., Qin, X.: More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments. Algorithmica 1\u201346 (2022). https:\/\/doi.org\/10.1007\/s00453-022-01044-5","DOI":"10.1007\/s00453-022-01044-5"},{"issue":"6","key":"11_CR28","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1109\/TEVC.2019.2917014","volume":"24","author":"J Lengler","year":"2019","unstructured":"Lengler, J.: A general dichotomy of evolutionary algorithms on monotone functions. IEEE Trans. Evol. Comput. 24(6), 995\u20131009 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"11_CR29","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-030-29414-4_2","volume-title":"Theory of Evolutionary Computation","author":"J Lengler","year":"2020","unstructured":"Lengler, J.: Drift analysis. In: Theory of Evolutionary Computation. NCS, pp. 89\u2013131. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_2"},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/978-3-030-58112-1_42","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"J Lengler","year":"2020","unstructured":"Lengler, J., Meier, J.: Large population sizes and crossover help in dynamic environments. In: B\u00e4ck, T., et al. (eds.) PPSN 2020. LNCS, vol. 12269, pp. 610\u2013622. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58112-1_42"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-030-72904-2_6","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"J Lengler","year":"2021","unstructured":"Lengler, J., Riedi, S.: Runtime analysis of the $$(\\mu + 1)$$-EA on the dynamic BinVal function. In: Zarges, C., Verel, S. (eds.) EvoCOP 2021. LNCS, vol. 12692, pp. 84\u201399. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72904-2_6"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Lengler, J., Schaller, U.: The $$(1+1)$$-EA on noisy linear functions with random positive weights. In: Symposium Series on Computational Intelligence (SSCI), pp. 712\u2013719. IEEE (2018)","DOI":"10.1109\/SSCI.2018.8628785"},{"key":"11_CR33","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2013.06.015","volume":"545","author":"P Oliveto","year":"2014","unstructured":"Oliveto, P., Witt, C.: On the analysis of the simple genetic algorithm. Theor. Comput. Sci. 545, 2\u201319 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR34","series-title":"Medizinische Informatik und Statistik","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-81283-5_8","volume-title":"Simulationsmethoden in der Medizin und Biologie","author":"I Rechenberg","year":"1978","unstructured":"Rechenberg, I.: Evolutionsstrategien. In: Schneider, B., Ranft, U. (eds.) Simulationsmethoden in der Medizin und Biologie. Medizinische Informatik und Statistik, vol. 8, pp. 83\u2013114. Springer, Berlin (1978). https:\/\/doi.org\/10.1007\/978-3-642-81283-5_8"},{"key":"11_CR35","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.tcs.2013.09.036","volume":"545","author":"JE Rowe","year":"2014","unstructured":"Rowe, J.E., Sudholt, D.: The choice of the offspring population size in the (1, $$\\lambda $$) evolutionary algorithm. Theor. Comput. Sci. 545, 20\u201338 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"11_CR36","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1109\/TAC.1968.1098903","volume":"13","author":"M Schumer","year":"1968","unstructured":"Schumer, M., Steiglitz, K.: Adaptive step size random search. IEEE Trans. Autom. Control 13(3), 270\u2013276 (1968)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"11_CR37","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TEVC.2012.2202241","volume":"17","author":"D Sudholt","year":"2012","unstructured":"Sudholt, D.: A new method for lower bounds on the running time of evolutionary algorithms. IEEE Trans. Evol. Comput. 17(3), 418\u2013435 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"11_CR38","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1017\/S0963548312000600","volume":"22","author":"C Witt","year":"2013","unstructured":"Witt, C.: Tight bounds on the optimization time of a randomized search heuristic on linear functions. Comb. Probab. Comput. 22(2), 294\u2013318 (2013)","journal-title":"Comb. Probab. Comput."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30035-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T23:15:36Z","timestamp":1680650136000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30035-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031300349","9783031300356"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30035-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brno","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2023\/evocop\/","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":"32","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":"15","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":"47% - 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":"4","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":"1.7","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)"}}]}}