{"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":1787609953613,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":32,"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_13","type":"book-chapter","created":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T21:40:59Z","timestamp":1787607659000},"page":"196-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The $$(1+1)\\text {-EA} $$ in\u00a0Dynamic Environments"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-9643-1712","authenticated-orcid":false,"given":"Georg","family":"Hasebe","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":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1162\/evco.2006.14.3.291","volume":"14","author":"D Arnold","year":"2006","unstructured":"Arnold, D., Beyer, H.G.: Optimum tracking with evolution strategies. Evol. Comput. 14(3), 291\u2013308 (2006)","journal-title":"Evol. Comput."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Branke, J.: Evolutionary Optimization in Dynamic Environments, vol. 1. Springer (2002)","DOI":"10.1007\/978-1-4615-0911-0_1"},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1007\/s00453-016-0187-y","volume":"78","author":"DC Dang","year":"2017","unstructured":"Dang, D.C., Jansen, T., Lehre, P.K.: Populations can be essential in tracking dynamic optima. Algorithmica 78(2), 660\u2013680 (2017)","journal-title":"Algorithmica"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/EVCO_a_00055","volume":"21","author":"B Doerr","year":"2013","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","journal-title":"Evol. Comput."},{"issue":"4","key":"13_CR5","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":"13_CR6","doi-asserted-by":"publisher","unstructured":"Doerr, C., Ye, F., Horesh, N., Wang, H., Shir, O.M., B\u00e4ck, T.: Benchmarking discrete optimization heuristics with IOHprofiler. Appl. Soft Comput. 88, 106027 (2020). https:\/\/doi.org\/10.1016\/j.asoc.2019.106027","DOI":"10.1016\/j.asoc.2019.106027"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Droste, S.: Analysis of the $$(1+1)$$ EA for a dynamically changing OneMax-variant. In: Proceedings of the Congress on Evolutionary Computation, vol.\u00a01, pp. 55\u201360. IEEE (2002)","DOI":"10.1109\/CEC.2002.1006209"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Droste, S.: Analysis of the $$(1+1)$$ EA for a dynamically bitwise changing OneMax. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 909\u2013921. Springer (2003)","DOI":"10.1007\/3-540-45105-6_103"},{"key":"13_CR9","doi-asserted-by":"publisher","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","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Hasebe, G.: Numerical verification for the $$(1+1)$$ EA on noisy linear functions with Uniform(0,1) weights. Zenodo (2026). https:\/\/doi.org\/10.5281\/zenodo.18620302","DOI":"10.5281\/zenodo.18620302"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Hasebe, G., Lengler, J., Ravi, R.R.: The $$(1+1)$$-EA in dynamic environments: extended version (2026). https:\/\/doi.org\/10.5281\/zenodo.19233285","DOI":"10.5281\/zenodo.19233285"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Janett, D., Lengler, J.: Two-dimensional drift analysis: optimizing two functions simultaneously can be hard. Theoret. Comput. Sci. 971, 114072 (2023). https:\/\/doi.org\/10.1016\/j.tcs.2023.114072","DOI":"10.1016\/j.tcs.2023.114072"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Jansen, T., Schellbach, U.: Theoretical analysis of a mutation-based evolutionary algorithm for a tracking problem in the lattice. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 841\u2013848 (2005)","DOI":"10.1145\/1068009.1068152"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Jansen, T., Zarges, C.: Evolutionary algorithms and artificial immune systems on a bi-stable dynamic optimisation problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 975\u2013982 (2014)","DOI":"10.1145\/2576768.2598344"},{"issue":"5","key":"13_CR15","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/s42979-025-03999-y","volume":"6","author":"M Kaufmann","year":"2025","unstructured":"Kaufmann, M., Larcher, M., Lengler, J., Sieberling, O.: Hardest monotone functions for evolutionary algorithms. SN Comput. Sci. 6(5), 512 (2025). https:\/\/doi.org\/10.1007\/s42979-025-03999-y","journal-title":"SN Comput. Sci."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"K\u00f6tzing, T., Lissovoi, A., Witt, C.: $$(1+1)$$ EA on generalized dynamic OneMax. In: Proceedings of the Foundations of Genetic Algorithms, pp. 40\u201351 (2015)","DOI":"10.1145\/2725494.2725502"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"K\u00f6tzing, T., Molter, H.: ACO beats EA on a dynamic pseudo-Boolean function. In: Proceedings of the Parallel Problem Solving from Nature, pp. 113\u2013122. Springer (2012)","DOI":"10.1007\/978-3-642-32937-1_12"},{"key":"13_CR18","unstructured":"L\u00e4ssig, J., Sudholt, D.: The benefit of populations and migration in dynamic optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1267\u20131274 (2010)"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Lengler, J.: Drift analysis. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pp. 89\u2013131. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_2","DOI":"10.1007\/978-3-030-29414-4_2"},{"issue":"6","key":"13_CR20","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1109\/TEVC.2019.2917014","volume":"24","author":"J Lengler","year":"2020","unstructured":"Lengler, J.: A general dichotomy of evolutionary algorithms on monotone functions. IEEE Trans. Evol. Comput. 24(6), 995\u20131009 (2020). https:\/\/doi.org\/10.1109\/TEVC.2019.2917014","journal-title":"IEEE Trans. Evol. Comput."},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Lengler, J., Martinsson, A., Steger, A.: When does hillclimbing fail on monotone functions: an entropy compression argument. In: Proceedings of the Analytic Algorithmics and Combinatorics, pp. 94\u2013102. SIAM (2019)","DOI":"10.1137\/1.9781611975505.10"},{"issue":"1","key":"13_CR22","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s11047-022-09915-0","volume":"23","author":"J Lengler","year":"2024","unstructured":"Lengler, J., Meier, J.: Large population sizes and crossover help in dynamic environments. Nat. Comput. 23(1), 115\u2013129 (2024). https:\/\/doi.org\/10.1007\/s11047-022-09915-0","journal-title":"Nat. Comput."},{"issue":"4","key":"13_CR23","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/s42979-022-01203-z","volume":"3","author":"J Lengler","year":"2022","unstructured":"Lengler, J., Riedi, S.: Runtime analysis of the $$(\\mu + 1)$$-EA on the dynamic BinVal function. SN Comput. Sci. 3(4), 324 (2022). https:\/\/doi.org\/10.1007\/s42979-022-01203-z","journal-title":"SN Comput. Sci."},{"key":"13_CR24","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 (2018). https:\/\/doi.org\/10.1109\/SSCI.2018.8628785","DOI":"10.1109\/SSCI.2018.8628785"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2021.04.011","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.04.011","journal-title":"Theoret. Comput. Sci."},{"issue":"Part A","key":"13_CR26","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2014.06.035","volume":"561","author":"A Lissovoi","year":"2015","unstructured":"Lissovoi, A., Witt, C.: Runtime analysis of ant colony optimization on dynamic shortest path problems. Theoret. Comput. Sci. 561(Part A), 73\u201385 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.05.001","volume":"6","author":"TT Nguyen","year":"2012","unstructured":"Nguyen, T.T., Yang, S., Branke, J.: Evolutionary dynamic optimization: a survey of the state of the art. Swarm Evol. Comput. 6, 1\u201324 (2012). https:\/\/doi.org\/10.1016\/j.swevo.2012.05.001","journal-title":"Swarm Evol. Comput."},{"key":"13_CR28","unstructured":"Oliveto, P.S., Witt, C.: Erratum: simplified drift analysis for proving lower bounds in evolutionary computation (2012). https:\/\/arxiv.org\/abs\/1211.7184"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Oliveto, P.S., Zarges, C.: Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 837\u2013844 (2013)","DOI":"10.1145\/2463372.2463478"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Rohlfshagen, P., Lehre, P.K., Yao, X.: Dynamic evolutionary optimisation: an analysis of frequency and magnitude of change. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1713\u20131720 (2009)","DOI":"10.1145\/1569901.1570131"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Vermetten, D., Lengler, J., Rusin, D., B\u00e4ck, T., Doerr, C.: Empirical analysis of the dynamic binary value problem with IOHprofiler. In: Proceedings of the Parallel Problem Solving from Nature, pp. 20\u201335. Springer (2024)","DOI":"10.1007\/978-3-031-70068-2_2"},{"issue":"2","key":"13_CR32","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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T21:41:01Z","timestamp":1787607661000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-36214-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,25]]},"ISBN":["9783032362131","9783032362148"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-36214-8_13","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"}}]}}