{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T20:54:39Z","timestamp":1767992079346,"version":"3.49.0"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00453-021-00896-7","type":"journal-article","created":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:03:16Z","timestamp":1641772996000},"page":"1659-1693","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Does Comma Selection Help to Cope with Local Optima?"],"prefix":"10.1007","volume":"84","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9786-220X","authenticated-orcid":false,"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,10]]},"reference":[{"key":"896_CR1","doi-asserted-by":"crossref","unstructured":"Antipov, D., Buzdalov, M., Doerr, B.: Fast mutation in crossover-based algorithms. In: Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 1268\u20131276. ACM (2020)","DOI":"10.1145\/3377930.3390172"},{"key":"896_CR2","volume-title":"Theory of Randomized Search Heuristics","year":"2011","unstructured":"Auger, A., Doerr, B. (eds.): Theory of Randomized Search Heuristics. World Scientific Publishing, Singapore (2011)"},{"key":"896_CR3","doi-asserted-by":"crossref","unstructured":"Antipov, D., Doerr, B.: Precise runtime analysis for plateaus. In: Parallel Problem Solving From Nature, PPSN 2018, Part\u00a0II, pp. 117\u2013128. Springer (2018)","DOI":"10.1007\/978-3-319-99259-4_10"},{"key":"896_CR4","doi-asserted-by":"crossref","unstructured":"Antipov, D., Doerr, B., Fang, J., Hetet, T.: Runtime analysis for the $${(\\mu +\\lambda )}$$ EA optimizing OneMax. In: Genetic and Evolutionary Computation Conference, GECCO 2018, pp. 1459\u20131466. ACM (2018)","DOI":"10.1145\/3205455.3205627"},{"key":"896_CR5","unstructured":"Antipov, D., Doerr, B., Karavaev, V.: The $$(1 + (\\lambda ,\\lambda ))$$ GA is even faster on multimodal problems. In: Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 1259\u20131267. ACM (2020)"},{"key":"896_CR6","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 2019, pp. 1461\u20131469. ACM (2019)","DOI":"10.1145\/3321707.3321838"},{"key":"896_CR7","doi-asserted-by":"crossref","unstructured":"Alanazi, F., Lehre, P.K.: Runtime analysis of selection hyper-heuristics with classical learning mechanisms. In: Congress on Evolutionary Computation, CEC 2104, pp. 2515\u20132523. IEEE (2014)","DOI":"10.1109\/CEC.2014.6900602"},{"key":"896_CR8","doi-asserted-by":"crossref","unstructured":"B\u00f6ttcher, S., Doerr, B., Neumann, F.: Optimal fixed and adaptive mutation rates for the LeadingOnes problem. In: Parallel Problem Solving from Nature, PPSN 2010, pp. 1\u201310. Springer (2010)","DOI":"10.1007\/978-3-642-15844-5_1"},{"key":"896_CR9","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1109\/TEVC.2017.2753538","volume":"22","author":"D Corus","year":"2018","unstructured":"Corus, D., Dang, D.-C., Eremeev, A.V., Lehre, P.K.: Level-based analysis of genetic algorithms and other search processes. IEEE Trans. Evol. Comput. 22, 707\u2013719 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"896_CR10","doi-asserted-by":"crossref","unstructured":"Corus, D., Oliveto, P.S., Yazdani, D.: On the runtime analysis of the Opt-IA artificial immune system. In: Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 83\u201390. ACM (2017)","DOI":"10.1145\/3071178.3079194"},{"key":"896_CR11","doi-asserted-by":"crossref","unstructured":"Corus, D., Oliveto, P.S., Yazdani, D.: Fast artificial immune systems. In: Parallel Problem Solving from Nature, PPSN 2018, Part II, pp. 67\u201378. Springer (2018)","DOI":"10.1007\/978-3-319-99259-4_6"},{"key":"896_CR12","doi-asserted-by":"crossref","unstructured":"Dang, D.-C., Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Lehre, P.K., Oliveto, P.S., Sudholt, D., Sutton, A.M.: Escaping local optima with diversity mechanisms and crossover. In: Genetic and Evolutionary Computation Conference, GECCO 2016, pp. 645\u2013652. ACM (2016)","DOI":"10.1145\/2908812.2908956"},{"key":"896_CR13","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1109\/TEVC.2017.2724201","volume":"22","author":"D-C Dang","year":"2018","unstructured":"Dang, D.-C., Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Lehre, P.K., Oliveto, P.S., Sudholt, D., Sutton, A.M.: Escaping local optima using crossover with emergent diversity. IEEE Trans. Evol. Comput. 22, 484\u2013497 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"896_CR14","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, 224\u2013250 (2013)","journal-title":"Algorithmica"},{"key":"896_CR15","doi-asserted-by":"crossref","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theoret. Comput. Sci. 276, 51\u201381 (2002)","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"896_CR16","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-different asymptotic runtimes for different instances. Theoret. Comput. Sci. 561, 3\u201323 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"896_CR17","doi-asserted-by":"publisher","unstructured":"Doerr, B., K\u00f6tzing, T.: Multiplicative up-drift. Algorithmica (2021). https:\/\/doi.org\/10.1007\/s00453-020-00775-7","DOI":"10.1007\/s00453-020-00775-7"},{"key":"896_CR18","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/s00453-015-0103-x","volume":"75","author":"D-C Dang","year":"2016","unstructured":"Dang, D.-C., Lehre, P.K.: Runtime analysis of non-elitist populations: from classical optimisation to partial information. Algorithmica 75, 428\u2013461 (2016)","journal-title":"Algorithmica"},{"key":"896_CR19","doi-asserted-by":"crossref","unstructured":"Dang, D.-C., Lehre, P.K.: Self-adaptation of mutation rates in non-elitist populations. In: Parallel Problem Solving from Nature, PPSN 2016, pp. 803\u2013813. Springer (2016)","DOI":"10.1007\/978-3-319-45823-6_75"},{"key":"896_CR20","doi-asserted-by":"crossref","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 777\u2013784. ACM (2017)","DOI":"10.1145\/3071178.3071301"},{"key":"896_CR21","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/s00453-018-0507-5","volume":"81","author":"D-C Dang","year":"2019","unstructured":"Dang, D.-C., Lehre, P.K., Nguyen, P.T.H.: Level-based analysis of the univariate marginal distribution algorithm. Algorithmica 81, 668\u2013702 (2019)","journal-title":"Algorithmica"},{"key":"896_CR22","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: Genetic and evolutionary computation conference, GECCO 2018, pp. 1015\u20131022. ACM (2018)","DOI":"10.1145\/3205455.3205611"},{"key":"896_CR23","doi-asserted-by":"crossref","unstructured":"Doerr, B., Neumann, F.: editors. Theory of Evolutionary Computation\u2014Recent Developments in Discrete Optimization. Springer (2020). https:\/\/cs.adelaide.edu.au\/~frank\/papers\/TheoryBook2019-selfarchived.pdf","DOI":"10.1007\/978-3-030-29414-4"},{"key":"896_CR24","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2018.09.024","volume":"773","author":"B Doerr","year":"2019","unstructured":"Doerr, B.: Analyzing randomized search heuristics via stochastic domination. Theoret. Comput. Sci. 773, 115\u2013137 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"896_CR25","doi-asserted-by":"crossref","unstructured":"Doerr, B.: An exponential lower bound for the runtime of the compact genetic algorithm on jump functions. In: Foundations of genetic algorithms, FOGA 2019, pp. 25\u201333. ACM (2019)","DOI":"10.1145\/3299904.3340304"},{"key":"896_CR26","doi-asserted-by":"crossref","unstructured":"Doerr, B.: A tight runtime analysis for the cGA on jump functions: EDAs can cross fitness valleys at no extra cost. In: Genetic and Evolutionary Computation Conference, GECCO 2019, pp. 1488\u20131496. ACM (2019)","DOI":"10.1145\/3321707.3321747"},{"key":"896_CR27","doi-asserted-by":"crossref","unstructured":"Doerr, B.: Does comma selection help to cope with local optima? In: Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 1304\u20131313. ACM (2020)","DOI":"10.1145\/3377930.3389823"},{"key":"896_CR28","doi-asserted-by":"crossref","unstructured":"Doerr, B.: Lower bounds for non-elitist evolutionary algorithms via negative multiplicative drift. In: Parallel Problem Solving From Nature, PPSN 2020, Part\u00a0II, pp. 604\u2013618. Springer (2020)","DOI":"10.1007\/978-3-030-58115-2_42"},{"key":"896_CR29","doi-asserted-by":"crossref","unstructured":"Doerr, B.: Probabilistic tools for the analysis of randomized optimization heuristics. In: Doerr, B., Neumann, F. (eds), Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pp. 1\u201387. Springer (2020). arXiv:1801.06733","DOI":"10.1007\/978-3-030-29414-4_1"},{"key":"896_CR30","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, 1012\u20131053 (2021)","journal-title":"Algorithmica"},{"key":"896_CR31","doi-asserted-by":"crossref","unstructured":"Eremeev, A.V.: Modeling and analysis of genetic algorithm with tournament selection. In: Artificial Evolution, AE 1999, pp. 84\u201395. Springer (1999)","DOI":"10.1007\/10721187_6"},{"key":"896_CR32","unstructured":"Friedrich, T., G\u00f6bel, A., Quinzan, F., Wagner, M.: Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations. CoRR, arXiv:1805.10902 (2018)"},{"key":"896_CR33","doi-asserted-by":"crossref","unstructured":"Friedrich, T., G\u00f6bel, A., Quinzan, F., Wagner, M.: Heavy-tailed mutation operators in single-objective combinatorial optimization. In: Parallel Problem Solving from Nature, PPSN 2018, Part I, pp. 134\u2013145. Springer (2018)","DOI":"10.1007\/978-3-319-99253-2_11"},{"key":"896_CR34","doi-asserted-by":"crossref","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Nallaperuma, S., Neumann, F., Schirneck, M.: Fast building block assembly by majority vote crossover. In: Genetic and Evolutionary Computation Conference, GECCO 2016, pp. 661\u2013668. ACM (2016)","DOI":"10.1145\/2908812.2908884"},{"key":"896_CR35","doi-asserted-by":"crossref","unstructured":"Friedrich, T., Quinzan, F., Wagner, M.: Escaping large deceptive basins of attraction with heavy-tailed mutation operators. In: Genetic and Evolutionary Computation Conference, GECCO 2018, pp. 293\u2013300. ACM (2018)","DOI":"10.1145\/3205455.3205515"},{"key":"896_CR36","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. Evol. Comput. 7, 173\u2013203 (1999)","journal-title":"Evol. Comput."},{"key":"896_CR37","doi-asserted-by":"crossref","unstructured":"Gie\u00dfen, C., Witt, C.: The interplay of population size and mutation probability in the $${(1 + \\lambda )}$$ EA on OneMax. Algorithmica 78, 587\u2013609 (2017)","DOI":"10.1007\/s00453-016-0214-z"},{"key":"896_CR38","doi-asserted-by":"publisher","first-page":"502","DOI":"10.2307\/1426671","volume":"13","author":"B Hajek","year":"1982","unstructured":"Hajek, B.: Hitting-time and occupation-time bounds implied by drift analysis with applications. Adv. Appl. Probab. 13, 502\u2013525 (1982)","journal-title":"Adv. Appl. Probab."},{"key":"896_CR39","doi-asserted-by":"crossref","unstructured":"Happ, E., Johannsen, D., Klein, C., Neumann, F.: Rigorous analyses of fitness-proportional selection for optimizing linear functions. In: Genetic and Evolutionary Computation Conference, GECCO 2008, pp. 953\u2013960. ACM (2008)","DOI":"10.1145\/1389095.1389277"},{"key":"896_CR40","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58, 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"896_CR41","doi-asserted-by":"crossref","unstructured":"Hasen\u00f6hrl, V., Sutton, A.M.: On the runtime dynamics of the compact genetic algorithm on jump functions. In: Genetic and Evolutionary Computation Conference, GECCO 2018, pp. 967\u2013974. ACM (2018)","DOI":"10.1145\/3205455.3205608"},{"key":"896_CR42","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J He","year":"2001","unstructured":"He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artif. Intell. 127, 51\u201381 (2001)","journal-title":"Artif. Intell."},{"key":"896_CR43","doi-asserted-by":"crossref","unstructured":"Jansen, T.: A comparison of simulated annealing with a simple evolutionary algorithm. In: Foundations of Genetic Algorithms, FOGA 2005, pp. 37\u201357. Springer (2005)","DOI":"10.1007\/11513575_3"},{"key":"896_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17339-4","volume-title":"Analyzing Evolutionary Algorithms - The Computer Science Perspective","author":"T Jansen","year":"2013","unstructured":"Jansen, T.: Analyzing Evolutionary Algorithms - The Computer Science Perspective. Springer, Berlin (2013)"},{"key":"896_CR45","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1162\/106365605774666921","volume":"13","author":"T Jansen","year":"2005","unstructured":"Jansen, T., De, J., Kenneth, 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":"896_CR46","doi-asserted-by":"crossref","unstructured":"J\u00e4gersk\u00fcpper, J., Storch, T.: When the plus strategy outperforms the comma strategy and when not. In: Foundations of Computational Intelligence, FOCI 2007, pp. 25\u201332. IEEE (2007)","DOI":"10.1109\/FOCI.2007.372143"},{"key":"896_CR47","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00453-002-0940-2","volume":"34","author":"T Jansen","year":"2002","unstructured":"Jansen, T., Wegener, I.: The analysis of evolutionary algorithms - a proof that crossover really can help. Algorithmica 34, 47\u201366 (2002)","journal-title":"Algorithmica"},{"key":"896_CR48","doi-asserted-by":"crossref","unstructured":"Jansen, T., Wegener, I.: A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation. Theoret. Comput. Sci. 386, 73\u201393 (2007)","DOI":"10.1016\/j.tcs.2007.06.003"},{"key":"896_CR49","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, 490\u2013506 (2016)","journal-title":"Algorithmica"},{"key":"896_CR50","doi-asserted-by":"crossref","unstructured":"Lehre, P.K.: Negative drift in populations. In: Parallel Problem Solving from Nature, PPSN 2010, pp. 244\u2013253. Springer (2010)","DOI":"10.1007\/978-3-642-15844-5_25"},{"key":"896_CR51","doi-asserted-by":"crossref","unstructured":"Lehre, P.K.: Fitness-levels for non-elitist populations. In: Genetic and Evolutionary Computation Conference, GECCO 2011, pp. 2075\u20132082. ACM (2011)","DOI":"10.1145\/2001576.2001855"},{"key":"896_CR52","doi-asserted-by":"crossref","unstructured":"Lengler, J.: Drift analysis. In: Doerr, B., Neumann, F. (eds.), Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pp. 89\u2013131. Springer, (2020). arXiv:1712.00964","DOI":"10.1007\/978-3-030-29414-4_2"},{"key":"896_CR53","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: Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 849\u2013856. ACM (2017)","DOI":"10.1145\/3071178.3071288"},{"key":"896_CR54","doi-asserted-by":"crossref","unstructured":"Lissovoi, A., Oliveto, P.S., Warwicker, J.A.: On the time complexity of algorithm selection hyper-heuristics for multimodal optimisation. In: Conference on Artificial Intelligence, AAAI 2019, pp. 2322\u20132329. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33012322"},{"key":"896_CR55","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. Combinat. Probab. Comput. 27, 643\u2013666 (2018)","journal-title":"Combinat. Probab. Comput."},{"key":"896_CR56","doi-asserted-by":"crossref","unstructured":"Neumann, F., Oliveto, P.S., Witt, C.: Theoretical analysis of fitness-proportional selection: landscapes and efficiency. In: Genetic and Evolutionary Computation Conference, GECCO 2009, pp. 835\u2013842. ACM (2009)","DOI":"10.1145\/1569901.1570016"},{"key":"896_CR57","doi-asserted-by":"publisher","first-page":"103345","DOI":"10.1016\/j.artint.2020.103345","volume":"287","author":"PTH Nguyen","year":"2020","unstructured":"Nguyen, P.T.H., Sudholt, D.: Memetic algorithms outperform evolutionary algorithms in multimodal optimisation. Artif. Intell. 287, 103345 (2020)","journal-title":"Artif. Intell."},{"key":"896_CR58","doi-asserted-by":"crossref","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization \u2013 Algorithms and Their Computational Complexity. Springer (2010)","DOI":"10.1007\/978-3-642-16544-3"},{"key":"896_CR59","doi-asserted-by":"crossref","unstructured":"Oliveto, P.S., Paix\u00e3o, T., Heredia, J.P., Sudholt, D., Trubenov\u00e1, B.: How to escape local optima in black box optimisation: when non-elitism outperforms elitism. Algorithmica 80, 1604\u20131633 (2018)","DOI":"10.1007\/s00453-017-0369-2"},{"key":"896_CR60","doi-asserted-by":"crossref","unstructured":"Oliveto, P.S., Witt, C.: Simplified drift analysis for proving lower bounds in evolutionary computation. Algorithmica 59, 369\u2013386 (2011)","DOI":"10.1007\/s00453-010-9387-z"},{"key":"896_CR61","unstructured":"Oliveto, P.S., Witt, C.: Erratum: simplified drift analysis for proving lower bounds in evolutionary computation. CoRR, arXiv:1211.7184 (2012)"},{"key":"896_CR62","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2015.01.002","volume":"605","author":"PS Oliveto","year":"2015","unstructured":"Oliveto, P.S., Witt, C.: Improved time complexity analysis of the simple genetic algorithm. Theoret. Comput. Sci. 605, 21\u201341 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"896_CR63","doi-asserted-by":"crossref","unstructured":"Paix\u00e3o, T., Heredia, J. P., Sudholt, D., Trubenov\u00e1, B.: Towards a runtime comparison of natural and artificial evolution. Algorithmica 78, 681\u2013713 (2017)","DOI":"10.1007\/s00453-016-0212-1"},{"key":"896_CR64","doi-asserted-by":"crossref","unstructured":"Rowe, J.E.: Aishwaryaprajna: The benefits and limitations of voting mechanisms in evolutionary optimisation. In: Foundations of Genetic Algorithms, FOGA 2019, pp. 34\u201342. ACM (2019)","DOI":"10.1145\/3299904.3340305"},{"key":"896_CR65","doi-asserted-by":"crossref","unstructured":"Rowe, J.E., Sudholt, D.: The choice of the offspring population size in the (1, $$\\lambda $$) evolutionary algorithm. Theoret. Comput. Sci. 545, 20\u201338 (2014)","DOI":"10.1016\/j.tcs.2013.09.036"},{"key":"896_CR66","doi-asserted-by":"publisher","first-page":"2511","DOI":"10.1016\/j.tcs.2009.03.003","volume":"410","author":"D Sudholt","year":"2009","unstructured":"Sudholt, D.: The impact of parametrization in memetic evolutionary algorithms. Theoret. Comput. Sci. 410, 2511\u20132528 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"896_CR67","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. Evol. Comput. 17, 418\u2013435 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"896_CR68","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Simulated annealing beats Metropolis in combinatorial optimization. In: Automata, Languages and Programming, ICALP 2005, pp. 589\u2013601. Springer (2005)","DOI":"10.1007\/11523468_48"},{"key":"896_CR69","first-page":"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, 65\u201386 (2006)","journal-title":"Evol. Comput."},{"key":"896_CR70","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. Combin. Probab. Comput. 22, 294\u2013318 (2013)","journal-title":"Combin. Probab. Comput."},{"key":"896_CR71","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/s00453-018-0463-0","volume":"81","author":"C Witt","year":"2019","unstructured":"Witt, C.: Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax. Algorithmica 81, 632\u2013667 (2019)","journal-title":"Algorithmica"},{"key":"896_CR72","doi-asserted-by":"crossref","unstructured":"Wu, M., Qian, C., Tang, K.: Dynamic mutation based Pareto optimization for subset selection. In: Intelligent Computing Methodologies, ICIC 2018, Part III, pp. 25\u201335. Springer (2018)","DOI":"10.1007\/978-3-319-95957-3_4"},{"key":"896_CR73","doi-asserted-by":"crossref","unstructured":"Whitley, D., Varadarajan, S., Hirsch, R., Mukhopadhyay, A.: Exploration and exploitation without mutation: solving the jump function in $${\\Theta (n)}$$ time. In: Parallel Problem Solving from Nature, PPSN 2018, Part II, pp. 55\u201366. Springer (2018)","DOI":"10.1007\/978-3-319-99259-4_5"},{"key":"896_CR74","doi-asserted-by":"crossref","unstructured":"Wang, S., Zheng, W., Doerr, B.: Choosing the right algorithm with hints from complexity theory. In: International Joint Conference on Artificial Intelligence, IJCAI 2021, pp. 1697\u20131703. ijcai.org (2021)","DOI":"10.24963\/ijcai.2021\/234"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00896-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-021-00896-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00896-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T22:52:44Z","timestamp":1726440764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-021-00896-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,10]]},"references-count":74,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["896"],"URL":"https:\/\/doi.org\/10.1007\/s00453-021-00896-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,10]]},"assertion":[{"value":"27 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}