{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T06:00:15Z","timestamp":1783749615292,"version":"3.55.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,8,27]],"date-time":"2018-08-27T00:00:00Z","timestamp":1535328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Investissement d\u2019avenir project","award":["ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH"]}]},{"DOI":"10.13039\/501100004836","name":"Det Frie Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["DFF-FNU 4002-00542"],"award-info":[{"award-number":["DFF-FNU 4002-00542"]}],"id":[{"id":"10.13039\/501100004836","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s00453-018-0502-x","type":"journal-article","created":{"date-parts":[[2018,8,27]],"date-time":"2018-08-27T16:55:39Z","timestamp":1535388939000},"page":"593-631","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":51,"title":["The ( $$1+\\lambda $$ 1 + \u03bb )\u00a0Evolutionary Algorithm with Self-Adjusting Mutation Rate"],"prefix":"10.1007","volume":"81","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Gie\u00dfen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,8,27]]},"reference":[{"key":"502_CR1","doi-asserted-by":"crossref","unstructured":"Alanazi, F., Lehre, P.K.: Runtime analysis of selection hyper-heuristics with classical learning mechanisms. In: Proceedings of CEC \u201914, pp. 2515\u20132523. IEEE (2014)","DOI":"10.1109\/CEC.2014.6900602"},{"key":"502_CR2","doi-asserted-by":"crossref","unstructured":"Antipov, D., Doerr, B., Fang, J., Hetet, T.: Runtime analysis for the $$(\\mu +\\lambda )$$ ( \u03bc + \u03bb ) EA optimizing OneMax. In: Proceedings of GECCO \u201918, pp. 1459\u20131466. ACM (2018)","DOI":"10.1145\/3205455.3205627"},{"key":"502_CR3","doi-asserted-by":"crossref","unstructured":"Auger, A., Doerr, B. (eds.): Theory of Randomized Search Heuristics. World Scientific Publishing, Singapore (2011)","DOI":"10.1142\/7438"},{"key":"502_CR4","doi-asserted-by":"crossref","unstructured":"Badkobeh, G., Lehre, P.K., Sudholt, D.: Unbiased black-box complexity of parallel search. In: Proceedings of PPSN\u00a0\u201914, pp. 892\u2013901. Springer (2014)","DOI":"10.1007\/978-3-319-10762-2_88"},{"key":"502_CR5","doi-asserted-by":"crossref","unstructured":"B\u00f6ttcher, S., Doerr, B., Neumann, F.: Optimal fixed and adaptive mutation rates for the LeadingOnes problem. In: Proceedings of PPSN\u00a0\u201910, pp. 1\u201310. Springer (2010)","DOI":"10.1007\/978-3-642-15844-5_1"},{"key":"502_CR6","doi-asserted-by":"crossref","unstructured":"Buzdalov, M., Doerr, B.: Runtime analysis of the $$(1+(\\lambda ,\\lambda ))$$ ( 1 + ( \u03bb , \u03bb ) ) genetic algorithm on random satisfiable 3-CNF formulas. In: Proceedings of GECCO \u201917, pp. 1343\u20131350. ACM (2017)","DOI":"10.1145\/3071178.3071297"},{"key":"502_CR7","doi-asserted-by":"crossref","unstructured":"Cathabard, S., Lehre, P.K., Yao, X.: Non-uniform mutation rates for problems with unknown solution lengths. In: Proceedings of FOGA \u201911, pp. 173\u2013180. ACM (2011)","DOI":"10.1145\/1967654.1967670"},{"key":"502_CR8","doi-asserted-by":"crossref","unstructured":"Cervantes, J., Stephens, C.R.: Rank based variation operators for genetic algorithms. In: Proceedings of GECCO \u201908, pp. 905\u2013912. ACM (2008)","DOI":"10.1145\/1389095.1389271"},{"key":"502_CR9","doi-asserted-by":"crossref","unstructured":"Dang, D-C., Lehre, P.K.: Self-adaptation of mutation rates in non-elitist populations. In: Proceedings of PPSN\u00a0\u201916, pp. 803\u2013813. Springer (2016)","DOI":"10.1007\/978-3-319-45823-6_75"},{"key":"502_CR10","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1017\/S0963548309990599","volume":"19","author":"M Dietzfelbinger","year":"2010","unstructured":"Dietzfelbinger, M., Rowe, J.E., Wegener, I., Woelfel, P.: Tight bounds for blind search on the integers and the reals. Comb. Probab. Comput. 19, 711\u2013728 (2010)","journal-title":"Comb. Probab. Comput."},{"key":"502_CR11","first-page":"1","volume-title":"Theory of Randomized Search Heuristics","author":"B Doerr","year":"2011","unstructured":"Doerr, B.: Analyzing randomized search heuristics: tools from probability theory. In: Auger, A., Doerr, B. (eds.) Theory of Randomized Search Heuristics, pp. 1\u201320. World Scientific Publishing, Singapore (2011)"},{"key":"502_CR12","doi-asserted-by":"crossref","unstructured":"Doerr, B.: Optimal parameter settings for the $$(1+(\\lambda , \\lambda ))$$ ( 1 + ( \u03bb , \u03bb ) ) genetic algorithm. In: Proceedings of GECCO\u00a0\u201916, pp. 1107\u20131114. ACM (2016)","DOI":"10.1145\/2908812.2908885"},{"key":"502_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.spl.2018.03.016","volume":"139","author":"B Doerr","year":"2018","unstructured":"Doerr, B.: An elementary analysis of the probability that a binomial random variable exceeds its expectation. Stat. Probab. Lett. 139, 67\u201374 (2018)","journal-title":"Stat. Probab. Lett."},{"key":"502_CR14","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C.: Optimal parameter choices through self-adjustment: applying the 1\/5-th rule in discrete settings. In: Proceedings of GECCO\u00a0\u201915, pp. 1335\u20131342. ACM (2015)","DOI":"10.1145\/2739480.2754684"},{"key":"502_CR15","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 $$ \u03bb ) evolutionary algorithm\u2014different asymptotic runtimes for different instances. Theor. Comput. Sci. 561, 3\u201323 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"502_CR16","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Witt, C.: Quasirandom evolutionary algorithms. In: Proceedings of GECCO \u201910, pp. 1457\u20131464. ACM (2010)","DOI":"10.1145\/1830483.1830749"},{"key":"502_CR17","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Witt, C.: Sharp bounds by probability-generating functions and variable drift. In: Proceedings of GECCO \u201911, pp. 2083\u20132090. ACM (2011)","DOI":"10.1145\/2001576.2001856"},{"key":"502_CR18","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"},{"key":"502_CR19","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 (2015a)","journal-title":"Theor. Comput. Sci."},{"key":"502_CR20","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Solving problems with unknown solution length at (almost) no extra cost. In: Proceedings of GECCO \u201915, pp. 831\u2013838. ACM (2015b)","DOI":"10.1145\/2739480.2754681"},{"key":"502_CR21","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: The right mutation strength for multi-valued decision variables. In: Proceedings\u00a0of GECCO \u201916, pp. 1115\u20131122. ACM (2016a)","DOI":"10.1145\/2908812.2908891"},{"key":"502_CR22","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Provably optimal self-adjusting step sizes for multi-valued decision variables. In: Proceedings of PPSN\u00a0\u201916, pp. 782\u2013791. Springer (2016b)","DOI":"10.1007\/978-3-319-45823-6_73"},{"key":"502_CR23","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., Yang, J.: Optimal parameter choices via precise black-box analysis. In: Proceedings of GECCO\u00a0\u201916, pp. 1123\u20131130. ACM (2016c)","DOI":"10.1145\/2908812.2908950"},{"key":"502_CR24","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., Yang, J.: $$k$$ k -bit mutation with self-adjusting $$k$$ k outperforms standard bit mutation. In: Proceedings of PPSN\u00a0\u201916, pp. 824\u2013834. Springer (2016d)","DOI":"10.1007\/978-3-319-45823-6_77"},{"key":"502_CR25","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Unknown solution length problems with no asymptotically optimal run time. In: Proceedings of GECCO \u201917, pp. 1367\u20131374. ACM (2017a)","DOI":"10.1145\/3071178.3071233"},{"key":"502_CR26","doi-asserted-by":"crossref","unstructured":"Doerr, B., Gie\u00dfen, C., Witt, C., Yang, J.: The (1+ $$\\lambda $$ \u03bb )\u00a0evolutionary algorithm with self-adjusting mutation rate. In: Proceedings of GECCO \u201917, pp. 1351\u20131358. ACM (2017b)","DOI":"10.1145\/3071178.3071279"},{"key":"502_CR27","doi-asserted-by":"crossref","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Proceedings of GECCO \u201917, pp. 777\u2013784. ACM (2017c)","DOI":"10.1145\/3071178.3071301"},{"key":"502_CR28","doi-asserted-by":"crossref","unstructured":"Doerr, B., Lissovoi, A., Oliveto, P.S., Warwicker, J.A.: On the runtime analysis of selection hyper-heuristics with adaptive learning periods. In: Proceedings of GECCO \u201918, pp. 1015\u20131022. ACM (2018a)","DOI":"10.1145\/3205455.3205611"},{"key":"502_CR29","doi-asserted-by":"crossref","unstructured":"Doerr, B., Witt, C., Yang, J.: Runtime analysis for self-adaptive mutation rates. In: Proc. GECCO \u201918, pp. 1475\u20131482. ACM (2018b)","DOI":"10.1145\/3205455.3205569"},{"key":"502_CR30","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. Theor. Comput. Sci. 276, 51\u201381 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"502_CR31","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. Evolut. Comput. 3, 124\u2013141 (1999)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"502_CR32","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/evco.1999.7.2.173","volume":"7","author":"J Garnier","year":"1999","unstructured":"Garnier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutations. Evolut. Comput. 7, 173\u2013203 (1999)","journal-title":"Evolut. Comput."},{"key":"502_CR33","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s00453-016-0214-z","volume":"78","author":"C Gie\u00dfen","year":"2017","unstructured":"Gie\u00dfen, C., Witt, C.: The interplay of population size and mutation probability in the (1+ $$\\lambda $$ \u03bb ) EA on OneMax. Algorithmica 78, 587\u2013609 (2017)","journal-title":"Algorithmica"},{"key":"502_CR34","doi-asserted-by":"crossref","unstructured":"Giel, O., Wegener, I.: Evolutionary algorithms and the maximum matching problem. In: Proceedings of STACS \u201903, pp. 415\u2013426. Springer (2003)","DOI":"10.1007\/3-540-36494-3_37"},{"key":"502_CR35","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1162\/evco_a_00212","volume":"26","author":"H-K Hwang","year":"2018","unstructured":"Hwang, H.-K., Panholzer, A., Rolin, N., Tsai, T.-H., Chen, W.-M.: Probabilistic analysis of the (1+1)-evolutionary algorithm. Evolut. Comput. 26, 299\u2013345 (2018)","journal-title":"Evolut. Comput."},{"key":"502_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17339-4","volume-title":"Analyzing Evolutionary Algorithms\u2014The Computer Science Perspective","author":"T Jansen","year":"2013","unstructured":"Jansen, T.: Analyzing Evolutionary Algorithms\u2014The Computer Science Perspective. Springer, Berlin (2013)"},{"key":"502_CR37","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.jda.2005.01.002","volume":"4","author":"T Jansen","year":"2006","unstructured":"Jansen, T., Wegener, I.: On the analysis of a dynamic evolutionary algorithm. J. Discrete Algorithms 4, 181\u2013199 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"502_CR38","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1162\/106365605774666921","volume":"13","author":"T Jansen","year":"2005","unstructured":"Jansen, T., De Jong, K.A., Wegener, I.: On the choice of the offspring population size in evolutionary algorithms. Evolut. Comput. 13, 413\u2013440 (2005)","journal-title":"Evolut. Comput."},{"key":"502_CR39","unstructured":"Johannsen, D.: Random combinatorial structures and randomized search heuristics. Ph.D. thesis, Saarland University (2010)"},{"key":"502_CR40","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1111\/j.1467-9574.1980.tb00681.x","volume":"34","author":"R Kaas","year":"1980","unstructured":"Kaas, R., Buhrman, J.M.: Mean, median and mode in binomial distributions. Stat. Neerl. 34, 13\u201318 (1980)","journal-title":"Stat. Neerl."},{"key":"502_CR41","doi-asserted-by":"crossref","unstructured":"K\u00f6tzing, T., Lissovoi, A., Witt, C.: (1+1) EA on generalized dynamic OneMax. In: Proceedings of FOGA\u00a0\u201915, pp. 40\u201351. ACM (2015)","DOI":"10.1145\/2725494.2725502"},{"key":"502_CR42","doi-asserted-by":"crossref","unstructured":"L\u00e4ssig, J., Sudholt, D.: Adaptive population models for offspring populations and parallel evolutionary algorithms. In: Proceedings of FOGA\u00a0\u201911, pp. 181\u2013192. ACM (2011)","DOI":"10.1145\/1967654.1967671"},{"key":"502_CR43","doi-asserted-by":"crossref","unstructured":"Lehre, P.K., \u00d6zcan, E.: A runtime analysis of simple hyper-heuristics: to mix or not to mix operators. In: Proceedings of FOGA \u201913, pp. 97\u2013104. ACM (2013)","DOI":"10.1145\/2460239.2460249"},{"key":"502_CR44","doi-asserted-by":"crossref","unstructured":"Lehre, P.K., Witt, C.: Concentrated hitting times of randomized search heuristics with variable drift. In: Proceedings of ISAAC\u00a0\u201914, pp. 686\u2013697. Springer (2014)","DOI":"10.1007\/978-3-319-13075-0_54"},{"key":"502_CR45","doi-asserted-by":"crossref","unstructured":"Lissovoi, A., Oliveto, P.S., Warwicker, J.A.: On the runtime analysis of generalised selection hyper-heuristics for pseudo-Boolean optimisation. In: Proceedings of GECCO \u201917, pp. 849\u2013856. ACM (2017)","DOI":"10.1145\/3071178.3071288"},{"key":"502_CR46","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1108\/17563780910959893","volume":"2","author":"B Mitavskiy","year":"2009","unstructured":"Mitavskiy, B., Rowe, J.E., Cannings, C.: Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links. Int. J. Intell. Comput. Cybern. 2, 243\u2013284 (2009)","journal-title":"Int. J. Intell. Comput. Cybern."},{"key":"502_CR47","unstructured":"M\u00fchlenbein, H.: How genetic algorithms really work: Mutation and hillclimbing. In: Proceedings of PPSN \u201992, pp. 15\u201326. Elsevier (1992)"},{"key":"502_CR48","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.tcs.2006.11.002","volume":"378","author":"F Neumann","year":"2007","unstructured":"Neumann, F., Wegener, I.: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor. Comput. Sci. 378, 32\u201340 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"502_CR49","volume-title":"Bioinspired Computation in Combinatorial Optimization\u2014Algorithms and Their Computational Complexity","author":"F Neumann","year":"2010","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization\u2014Algorithms and Their Computational Complexity. Springer, Berlin (2010)"},{"key":"502_CR50","doi-asserted-by":"crossref","unstructured":"Oliveto, P.S., Lehre, P.K., Neumann, F.: Theoretical analysis of rank-based mutation-combining exploration and exploitation. In: Proceedings of CEC\u00a0\u201909, pp. 1455\u20131462. IEEE (2009)","DOI":"10.1109\/CEC.2009.4983114"},{"key":"502_CR51","doi-asserted-by":"crossref","unstructured":"Qian, C., Tang, K., Zhou, Z-H.: Selection hyper-heuristics can provably be helpful in evolutionary multi-objective optimization. In: Proceedings of PPSN \u201916, pp. 835\u2013846. Springer (2016)","DOI":"10.1007\/978-3-319-45823-6_78"},{"key":"502_CR52","first-page":"26","volume":"62","author":"H Robbins","year":"1955","unstructured":"Robbins, H.: A remark on Stirling\u2019s formula. Am. Math. Mon. 62, 26\u201329 (1955)","journal-title":"Am. Math. Mon."},{"key":"502_CR53","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TEVC.2012.2202241","volume":"17","author":"D Sudholt","year":"2013","unstructured":"Sudholt, D.: A new method for lower bounds on the running time of evolutionary algorithms. IEEE Trans. Evolut. Comput. 17, 418\u2013435 (2013)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"502_CR54","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Simulated annealing beats Metropolis in combinatorial optimization. In: Proceedings of ICALP \u201905, pp. 589\u2013601. Springer (2005)","DOI":"10.1007\/11523468_48"},{"key":"502_CR55","doi-asserted-by":"crossref","unstructured":"Zarges, C.: Rigorous runtime analysis of inversely fitness proportional mutation rates. In: Proceedings of PPSN \u201908, pp. 112\u2013122. Springer (2008)","DOI":"10.1007\/978-3-540-87700-4_12"},{"key":"502_CR56","doi-asserted-by":"crossref","unstructured":"Zarges, C.: On the utility of the population size for inversely fitness proportional mutation rates. In: Proceedings of FOGA \u201909, pp. 39\u201346. ACM (2009)","DOI":"10.1145\/1527125.1527132"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-018-0502-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0502-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0502-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T15:49:22Z","timestamp":1751816962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-018-0502-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,27]]},"references-count":56,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["502"],"URL":"https:\/\/doi.org\/10.1007\/s00453-018-0502-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,27]]},"assertion":[{"value":"16 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}