{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T22:19:13Z","timestamp":1787609953877,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032362131","type":"print"},{"value":"9783032362148","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T00:00:00Z","timestamp":1787616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T00:00:00Z","timestamp":1787616000000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-36214-8_5","type":"book-chapter","created":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T21:40:43Z","timestamp":1787607643000},"page":"67-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Runtime Bound for\u00a0the\u00a0$$(\\mu +1)\\text {-EA}$$ on\u00a0BinVal"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-5525-3493","authenticated-orcid":false,"given":"Joris","family":"Belder","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0004-7629","authenticated-orcid":false,"given":"Johannes","family":"Lengler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3641-1824","authenticated-orcid":false,"given":"Raghu Raman","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,25]]},"reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1007\/S00453-020-00731-5","volume":"83","author":"D Antipov","year":"2021","unstructured":"Antipov, D., Doerr, B.: A tight runtime analysis for the $$(\\mu + \\lambda )$$ EA. Algorithmica 83(4), 1054\u20131095 (2021). https:\/\/doi.org\/10.1007\/S00453-020-00731-5","journal-title":"Algorithmica"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Antipov, D., Doerr, B., Yang, Q.: The efficiency threshold for the offspring population size of the $$(\\mu, \\lambda )$$ EA. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1268\u20131276. ACM (2019). https:\/\/doi.org\/10.1145\/3321707.3321851","DOI":"10.1145\/3321707.3321851"},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1109\/tevc.2017.2724201","volume":"22","author":"DC Dang","year":"2018","unstructured":"Dang, D.C., et al.: Escaping local optima using crossover with emergent diversity. IEEE Trans. Evol. Comput. 22(3), 484\u2013497 (2018). https:\/\/doi.org\/10.1109\/tevc.2017.2724201","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"18","key":"5_CR4","doi-asserted-by":"publisher","first-page":"20683","DOI":"10.1609\/aaai.v38i18.30055","volume":"38","author":"B Doerr","year":"2024","unstructured":"Doerr, B., Echarghaoui, A., Jamal, M., Krejca, M.S.: Runtime analysis of the $$(\\mu + 1)$$ GA: provable speed-ups from strong drift towards diverse populations. Proc. AAAI Conf. Artif. Intell. 38(18), 20683\u201320691 (2024). https:\/\/doi.org\/10.1609\/aaai.v38i18.30055","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/S00453-011-9585-3","volume":"65","author":"B Doerr","year":"2013","unstructured":"Doerr, B., Goldberg, L.A.: Adaptive drift analysis. Algorithmica 65(1), 224\u2013250 (2013). https:\/\/doi.org\/10.1007\/S00453-011-9585-3","journal-title":"Algorithmica"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Doerr, B., Jansen, T., Sudholt, D., Winzen, C., Zarges, C.: Mutation rate matters even when optimizing monotonic functions. Evol. Comput. 21(1), 1\u201327 (2013). https:\/\/doi.org\/10.1162\/EVCO_A_00055","DOI":"10.1162\/EVCO_A_00055"},{"issue":"4","key":"5_CR7","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(4), 673\u2013697 (2012). https:\/\/doi.org\/10.1007\/s00453-012-9622-x","journal-title":"Algorithmica"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2014.03.015","volume":"561","author":"B Doerr","year":"2015","unstructured":"Doerr, B., K\u00fcnnemann, M.: Optimizing linear functions with the $$(1+\\lambda )$$ evolutionary algorithm\u2013different asymptotic runtimes for different instances. Theoret. Comput. Sci. 561, 3\u201323 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2014.03.015","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"5_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/s0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the $$(1+1)$$ evolutionary algorithm. Theoret. Comput. Sci. 276(1\u20132), 51\u201381 (2002). https:\/\/doi.org\/10.1016\/s0304-3975(01)00182-7","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/B:NACO.0000023417.31393.c7","volume":"3","author":"J He","year":"2004","unstructured":"He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Nat. Comput. 3(1), 21\u201335 (2004). https:\/\/doi.org\/10.1023\/B:NACO.0000023417.31393.c7","journal-title":"Nat. Comput."},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"K\u00f6tzing, T., Sander, J.: Anytime analysis on BinVal: adaptive parameters help (2026). https:\/\/doi.org\/10.48550\/ARXIV.2604.06976","DOI":"10.48550\/ARXIV.2604.06976"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Krejca, M.S., Neumann, F., Witt, C.: Population dynamics and improved runtime guarantees for the $$(\\mu +1)$$ EA on BinVal. In: Proceedings of the Foundations of Genetic Algorithms, pp. 142\u2013153. FOGA 2025, ACM (2025). https:\/\/doi.org\/10.1145\/3729878.3746614","DOI":"10.1145\/3729878.3746614"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Lengler, J.: Drift analysis, pp. 89\u2013131. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_2","DOI":"10.1007\/978-3-030-29414-4_2"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Lengler, J.: A general dichotomy of evolutionary algorithms on monotone functions. IEEE Trans. Evol. Comput. 24(6) (2019). https:\/\/doi.org\/10.1109\/TEVC.2019.2917014","DOI":"10.1109\/TEVC.2019.2917014"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Lengler, J., Meier, J.: Large population sizes and crossover help in dynamic environments. In: B\u00e4ck, T., et al. (eds.) Proceedings of the Parallel Problem Solving from Nature, pp. 610\u2013622. LNCS, Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-58112-1_42","DOI":"10.1007\/978-3-030-58112-1_42"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Lengler, J., Riedi, S.: Runtime analysis of the $$(\\mu + 1)$$-EA on the dynamic BinVal function. SN Comput. Sci. 3(4) (2022). https:\/\/doi.org\/10.1007\/s42979-022-01203-z","DOI":"10.1007\/s42979-022-01203-z"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Lengler, J., Schaller, U.: The $$(1+1)$$-EA on noisy linear functions with random positive weights. In: Proceedings of the IEEE Symposium Series on Computational Intelligence, pp. 712\u2013719. IEEE (2018). https:\/\/doi.org\/10.1109\/SSCI.2018.8628785","DOI":"10.1109\/SSCI.2018.8628785"},{"issue":"4","key":"5_CR18","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1017\/S0963548318000275","volume":"27","author":"J Lengler","year":"2018","unstructured":"Lengler, J., Steger, A.: Drift analysis and evolutionary algorithms revisited. Comb. Probab. Comput. 27(4), 643\u2013666 (2018). https:\/\/doi.org\/10.1017\/S0963548318000275","journal-title":"Comb. Probab. Comput."},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2021.03.025","volume":"875","author":"J Lengler","year":"2021","unstructured":"Lengler, J., Zou, X.: Exponential slowdown for larger populations: The $$(\\mu + 1)$$-EA on monotone functions. Theoret. Comput. Sci. 875, 28\u201351 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.03.025","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"5_CR20","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00453-016-0262-4","volume":"78","author":"A Lissovoi","year":"2016","unstructured":"Lissovoi, A., Witt, C.: A runtime analysis of parallel evolutionary algorithms in dynamic optimization. Algorithmica 78(2), 641\u2013659 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0262-4","journal-title":"Algorithmica"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Sudholt, D.: The benefits of population diversity in evolutionary algorithms: a survey of rigorous runtime analyses, pp. 359\u2013404. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_8","DOI":"10.1007\/978-3-030-29414-4_8"},{"issue":"1","key":"5_CR22","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1162\/evco.2006.14.1.65","volume":"14","author":"C Witt","year":"2006","unstructured":"Witt, C.: Runtime analysis of the $$(\\mu + 1)$$ EA on simple pseudo-Boolean functions. Evol. Comput. 14(1), 65\u201386 (2006). https:\/\/doi.org\/10.1162\/evco.2006.14.1.65","journal-title":"Evol. Comput."},{"issue":"1","key":"5_CR23","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.tcs.2008.05.011","volume":"403","author":"C Witt","year":"2008","unstructured":"Witt, C.: Population size versus runtime of a simple evolutionary algorithm. Theoret. Comput. Sci. 403(1), 104\u2013120 (2008). https:\/\/doi.org\/10.1016\/j.tcs.2008.05.011","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"5_CR24","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). https:\/\/doi.org\/10.1017\/s0963548312000600","journal-title":"Comb. Probab. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-36214-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T21:40:44Z","timestamp":1787607644000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-36214-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,25]]},"ISBN":["9783032362131","9783032362148"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-36214-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,25]]},"assertion":[{"value":"25 August 2026","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":"Trento","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}