{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T17:40:31Z","timestamp":1767980431482,"version":"3.49.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031577116","type":"print"},{"value":"9783031577123","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-57712-3_10","type":"book-chapter","created":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T18:02:14Z","timestamp":1713463334000},"page":"146-161","source":"Crossref","is-referenced-by-count":4,"title":["Hardest Monotone Functions for\u00a0Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Marc","family":"Kaufmann","sequence":"first","affiliation":[]},{"given":"Maxime","family":"Larcher","sequence":"additional","affiliation":[]},{"given":"Johannes","family":"Lengler","sequence":"additional","affiliation":[]},{"given":"Oliver","family":"Sieberling","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1162\/evco_a_00290","volume":"29","author":"N Buskulic","year":"2021","unstructured":"Buskulic, N., Doerr, C.: Maximizing drift is not optimal for solving OneMax. Evol. Comput. 29(4), 521\u2013541 (2021)","journal-title":"Evol. Comput."},{"key":"10_CR2","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":"10_CR3","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":"10_CR4","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":"10_CR5","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s00453-018-0502-x","volume":"81","author":"B Doerr","year":"2019","unstructured":"Doerr, B., Gie\u00dfen, C., Witt, C., Yang, J.: The (1+ $$\\lambda $$) evolutionary algorithm with self-adjusting mutation rate. Algorithmica 81, 593\u2013631 (2019)","journal-title":"Algorithmica"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-15844-5_5","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"B Doerr","year":"2010","unstructured":"Doerr, B., Jansen, T., Sudholt, D., Winzen, C., Zarges, C.: Optimizing monotone functions can be difficult. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 42\u201351. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_5"},{"issue":"1","key":"10_CR7","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)","journal-title":"Evol. Comput."},{"key":"10_CR8","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":"10_CR9","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.: How the (1+ $$\\lambda $$) evolutionary algorithm optimizes linear functions. Theor. Comput. Sci. 561, 3\u201323 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR10","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)","DOI":"10.1145\/3071178.3071301"},{"key":"10_CR11","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), pp. 1015\u20131022 (2018)","DOI":"10.1145\/3205455.3205611"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Doerr, C., Janett, D.A., Lengler, J.: Tight runtime bounds for static unary unbiased evolutionary algorithms on linear functions. In: Genetic and Evolutionary Computation Conference (GECCO) (2023)","DOI":"10.1145\/3583131.3590482"},{"key":"10_CR13","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":"2","key":"10_CR14","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":"10_CR15","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/s00453-023-01153-9","volume":"86","author":"MA Hevia Fajardo","year":"2024","unstructured":"Hevia Fajardo, M.A., Sudholt, D.: Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter. Algorithmica 86, 526\u2013565 (2024)","journal-title":"Algorithmica"},{"key":"10_CR16","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), pp. 25\u201332. IEEE (2007)","DOI":"10.1109\/FOCI.2007.372143"},{"key":"10_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114072","volume":"971","author":"D Janett","year":"2023","unstructured":"Janett, D., Lengler, J.: Two-dimensional drift analysis: optimizing two functions simultaneously can be hard. Theor. Comput. Sci. 971, 114072 (2023)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-73482-6_4","volume-title":"Foundations of Genetic Algorithms (FOGA)","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"},{"issue":"4","key":"10_CR19","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1162\/106365605774666921","volume":"13","author":"T Jansen","year":"2005","unstructured":"Jansen, T., Jong, K.A.D., Wegener, I.: On the choice of the offspring population size in evolutionary algorithms. Evol. Comput. 13(4), 413\u2013440 (2005)","journal-title":"Evol. Comput."},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Jorritsma, J., Lengler, J., Sudholt, D.: Comma selection outperforms plus selection on OneMax with randomly planted optima. In: Genetic and Evolutionary Computation Conference (GECCO) (2023)","DOI":"10.1145\/3583131.3590488"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-031-14721-0_40","volume-title":"Parallel Problem Solving from Nature (PPSN)","author":"M Kaufmann","year":"2022","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., Tu\u0161ar, T. (eds.) PPSN 2022. LNCS, vol. 13399, pp. 569\u2013585. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14721-0_40"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-031-30035-6_11","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"M Kaufmann","year":"2023","unstructured":"Kaufmann, M., Larcher, M., Lengler, J., Zou, X.: OneMax is not the easiest function for fitness improvements. In: P\u00e9rez C\u00e1ceres, L., St\u00fctzle, T. (eds.) EvoCOP 2023. LNCS, vol. 13987, pp. 162\u2013178. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30035-6_11"},{"key":"10_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114181","volume":"979","author":"M Kaufmann","year":"2023","unstructured":"Kaufmann, M., Larcher, M., Lengler, J., Zou, X.: Self-adjusting population sizes for the (1, $$\\lambda $$)-EA on monotone functions. Theor. Comput. Sci. 979, 114181 (2023)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-15844-5_24","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"J L\u00e4ssig","year":"2010","unstructured":"L\u00e4ssig, J., Sudholt, D.: General scheme for analyzing running times of parallel evolutionary algorithms. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 234\u2013243. Springer, Cham (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_24"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"L\u00e4ssig, J., Sudholt, D.: Adaptive population models for offspring populations and parallel evolutionary algorithms. In: Foundations of Genetic Algorithms (FOGA), pp. 181\u2013192 (2011)","DOI":"10.1145\/1967654.1967671"},{"issue":"6","key":"10_CR26","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":"10_CR27","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: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation. NCS, pp. 89\u2013131. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_2"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Lengler, J., Martinsson, A., Steger, A.: When does hillclimbing fail on monotone functions: an entropy compression argument. In: Analytic Algorithmics and Combinatorics (ANALCO), pp. 94\u2013102. SIAM (2019)","DOI":"10.1137\/1.9781611975505.10"},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/978-3-030-58112-1_42","volume-title":"Parallel Problem Solving from Nature (PPSN)","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":"10_CR30","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-030-72904-2_6","volume-title":"Evolutionary Computation in Combinatorial Optimization (EvoCOP)","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":"10_CR31","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"},{"issue":"4","key":"10_CR32","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)","journal-title":"Comb. Probab. Comput."},{"key":"10_CR33","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. Theor. Comput. Sci. 875, 28\u201351 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Neumann, F., Oliveto, P.S., Witt, C.: Theoretical analysis of fitness-proportional selection: landscapes and efficiency. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 835\u2013842 (2009)","DOI":"10.1145\/1569901.1570016"},{"key":"10_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":"10_CR36","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":"10_CR37","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-57712-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T18:03:10Z","timestamp":1713463390000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57712-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031577116","9783031577123"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57712-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}