{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T08:07:58Z","timestamp":1773734878870,"version":"3.50.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T00:00:00Z","timestamp":1762992000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T00:00:00Z","timestamp":1762992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100007493","name":"Fondation Math\u00e9matique Jacques Hadamard","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007493","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s00453-025-01345-5","type":"journal-article","created":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T04:28:07Z","timestamp":1763008087000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Flexible Evolutionary Algorithm with Dynamic Mutation Rate Archive"],"prefix":"10.1007","volume":"88","author":[{"given":"Martin S.","family":"Krejca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,13]]},"reference":[{"key":"1345_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29414-4","volume-title":"Theory of Evolutionary Computation - Recent Developments in Discrete Optimization","year":"2020","unstructured":"Doerr, B., Neumann, F. (eds.): Theory of Evolutionary Computation - Recent Developments in Discrete Optimization. Springer, Cham, Switzerland (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4"},{"issue":"1","key":"1345_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco_a_00313","volume":"31","author":"A Rajabi","year":"2023","unstructured":"Rajabi, A., Witt, C.: Stagnation detection with randomized local search. Evol. Comput. 31(1), 1\u201329 (2023). https:\/\/doi.org\/10.1162\/evco_a_00313","journal-title":"Evol. Comput."},{"key":"1345_CR3","doi-asserted-by":"publisher","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Proc. of GECCO\u00a0\u201917, pp. 777\u2013784 (2017). https:\/\/doi.org\/10.1145\/3071178.3071301","DOI":"10.1145\/3071178.3071301"},{"key":"1345_CR4","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s00453-012-9616-8","volume":"64","author":"PK Lehre","year":"2012","unstructured":"Lehre, P.K., Witt, C.: Black-box search by unbiased variation. Algorithmica 64, 623\u2013642 (2012)","journal-title":"Algorithmica"},{"key":"1345_CR5","doi-asserted-by":"publisher","first-page":"113670","DOI":"10.1016\/j.tcs.2022.12.020","volume":"946","author":"B Doerr","year":"2023","unstructured":"Doerr, B., Rajabi, A.: Stagnation detection meets fast mutation. Theoret. Comput. Sci. 946, 113670 (2023). https:\/\/doi.org\/10.1016\/j.tcs.2022.12.020","journal-title":"Theoret. Comput. Sci."},{"key":"1345_CR6","doi-asserted-by":"publisher","unstructured":"Rajabi, A., Witt, C.: Stagnation detection in highly multimodal fitness landscapes. In: Proc. of GECCO\u00a0\u201921, pp. 1178\u20131186. ACM Press, New York, USA (2021). https:\/\/doi.org\/10.1145\/3449639.3459336","DOI":"10.1145\/3449639.3459336"},{"key":"1345_CR7","doi-asserted-by":"publisher","unstructured":"Krejca, M.S., Witt, C.: A flexible evolutionary algorithm with dynamic mutation rate archive. In: Proc. of GECCO\u00a0\u201924. ACM, New York, USA (2024). https:\/\/doi.org\/10.1145\/3638529.3654076","DOI":"10.1145\/3638529.3654076"},{"key":"1345_CR8","doi-asserted-by":"publisher","unstructured":"Krejca, M., Witt, C.: Theory of estimation-of-distribution algorithms. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation\u00a0\u2013 Recent Developments in Discrete Optimization, pp. 405\u2013442. Springer, Cham, Switzerland (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4","DOI":"10.1007\/978-3-030-29414-4"},{"key":"1345_CR9","doi-asserted-by":"publisher","unstructured":"Dang, D., Eremeev, A.V., Lehre, P.K.: Escaping local optima with non-elitist evolutionary algorithms. In: Proc. of AAAI\u00a0\u201921, pp. 12275\u201312283. AAAI Press, Palo Alto, USA (2021). https:\/\/doi.org\/10.1609\/AAAI.V35I14.17457","DOI":"10.1609\/AAAI.V35I14.17457"},{"key":"1345_CR10","doi-asserted-by":"publisher","unstructured":"Doerr, B., Houssaini, T.E.G.E., Rajabi, A., Witt, C.: How well does the metropolis algorithm cope with local optima? In: Proc. of GECCO\u00a0\u201923, pp. 1000\u20131008. ACM, New York, USA (2023). https:\/\/doi.org\/10.1145\/3583131.3590390","DOI":"10.1145\/3583131.3590390"},{"key":"1345_CR11","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). https:\/\/doi.org\/10.1007\/s00453-002-0940-2","journal-title":"Algorithmica"},{"issue":"5","key":"1345_CR12","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1109\/TEVC.2021.3068574","volume":"25","author":"D Corus","year":"2021","unstructured":"Corus, D., Oliveto, P.S., Yazdani, D.: Fast immune system-inspired hypermutation operators for combinatorial optimization. IEEE Trans. Evol. Comput. 25(5), 956\u2013970 (2021). https:\/\/doi.org\/10.1109\/TEVC.2021.3068574","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1345_CR13","doi-asserted-by":"publisher","unstructured":"Zarges, C.: Theoretical foundations of immune-inspired randomized search heuristics for optimization. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation\u00a0\u2013 Recent Developments in Discrete Optimization, pp. 443\u2013474. Springer, Cham, Switzerland (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4","DOI":"10.1007\/978-3-030-29414-4"},{"key":"1345_CR14","doi-asserted-by":"publisher","unstructured":"Friedrich, T., Quinzan, F., Wagner, M.: Escaping large deceptive basins of attraction with heavy-tailed mutation operators. In: Proc. of GECCO\u00a0\u201918, pp. 293\u2013300. ACM, Cham, Switzerland (2018). https:\/\/doi.org\/10.1145\/3205455.3205515","DOI":"10.1145\/3205455.3205515"},{"key":"1345_CR15","doi-asserted-by":"publisher","unstructured":"Friedrich, T., G\u00f6bel, A., Quinzan, F., Wagner, M.: Heavy-tailed mutation operators in single-objective combinatorial optimization. In: Proc. of PPSN\u00a0\u201918, pp. 134\u2013145. Springer, Cham, Switzerland (2018). https:\/\/doi.org\/10.1007\/978-3-319-99253-2_11","DOI":"10.1007\/978-3-319-99253-2_11"},{"key":"1345_CR16","doi-asserted-by":"publisher","unstructured":"Wu, M., Qian, C., Tang, K.: Dynamic mutation based Pareto optimization for subset selection. In: Proc. of ICIC\u00a0\u201918, pp. 25\u201335. Springer, Cham, Switzerland (2018). https:\/\/doi.org\/10.1007\/978-3-319-95957-3_4","DOI":"10.1007\/978-3-319-95957-3_4"},{"key":"1345_CR17","doi-asserted-by":"publisher","unstructured":"Antipov, D., Doerr, B.: Runtime analysis of a heavy-tailed $${(1+(\\lambda , \\lambda ))}$$ genetic algorithm on jump functions. In: Prof. of PPSN\u00a0\u201920, pp. 545\u2013559. Springer, Cham, Switzerland (2020). https:\/\/doi.org\/10.1007\/978-3-030-58115-2_38","DOI":"10.1007\/978-3-030-58115-2_38"},{"issue":"3","key":"1345_CR18","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s11047-021-09841-7","volume":"20","author":"F Quinzan","year":"2021","unstructured":"Quinzan, F., G\u00f6bel, A., Wagner, M., Friedrich, T.: Evolutionary algorithms and submodular functions: Benefits of heavy-tailed mutations. Nat. Comput. 20(3), 561\u2013575 (2021). https:\/\/doi.org\/10.1007\/s11047-021-09841-7","journal-title":"Nat. Comput."},{"issue":"4","key":"1345_CR19","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1162\/EVCO_A_00328","volume":"31","author":"W Zheng","year":"2023","unstructured":"Zheng, W., Doerr, B.: Theoretical analyses of multiobjective evolutionary algorithms on multimodal objectives. Evol. Comput. 31(4), 337\u2013373 (2023). https:\/\/doi.org\/10.1162\/EVCO_A_00328","journal-title":"Evol. Comput."},{"key":"1345_CR20","doi-asserted-by":"publisher","first-page":"1724","DOI":"10.1007\/s00453-022-00957-5","volume":"84","author":"D Antipov","year":"2022","unstructured":"Antipov, D., Buzdalov, M., Doerr, B.: Fast mutation in crossover-based algorithms. Algorithmica 84, 1724\u20131761 (2022). https:\/\/doi.org\/10.1007\/s00453-022-00957-5","journal-title":"Algorithmica"},{"key":"1345_CR21","doi-asserted-by":"publisher","unstructured":"Dang, D., Eremeev, A.V., Lehre, P.K., Qin, X.: Fast non-elitist evolutionary algorithms with power-law ranking selection. In: Proc. of GECCO\u00a0\u201922, pp. 1372\u20131380. ACM, New York, USA (2022). https:\/\/doi.org\/10.1145\/3512290.3528873","DOI":"10.1145\/3512290.3528873"},{"issue":"1","key":"1345_CR22","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/S00453-023-01146-8","volume":"86","author":"B Doerr","year":"2024","unstructured":"Doerr, B., Ghannane, Y., Ibn Brahim, M.: Runtime analysis for permutation-based evolutionary algorithms. Algorithmica 86(1), 90\u2013129 (2024). https:\/\/doi.org\/10.1007\/S00453-023-01146-8","journal-title":"Algorithmica"},{"issue":"5","key":"1345_CR23","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1109\/TEVC.2023.3250552","volume":"27","author":"B Doerr","year":"2023","unstructured":"Doerr, B., Qu, Z.: A first runtime analysis of the NSGA-II on a multimodal problem. IEEE Trans. Evol. Comput. 27(5), 1288\u20131297 (2023). https:\/\/doi.org\/10.1109\/TEVC.2023.3250552","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1345_CR24","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., P\u00e9rez C\u00e1ceres, L., St\u00fctzle, T., Birattari, M.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016). https:\/\/doi.org\/10.1016\/j.orp.2016.09.002","journal-title":"Oper. Res. Perspect."},{"key":"1345_CR25","doi-asserted-by":"publisher","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Proc.\u00a0of LION-5, pp. 507\u2013523. Springer, Berlin, Heidelberg, Germany (2011). https:\/\/doi.org\/10.1007\/978-3-642-25566-3_40","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"1345_CR26","unstructured":"Lindauer, M., Eggensperger, K., Feurer, M., Biedenkapp, A., Deng, D., Benjamins, C., Ruhkopf, T., Sass, R., Hutter, F.: Smac3: A versatile bayesian optimization package for hyperparameter optimization. CoRR abs\/2109.09831 (2021)"},{"key":"1345_CR27","doi-asserted-by":"publisher","unstructured":"Hall, G.T., Oliveto, P.S., Sudholt, D.: On the impact of the cutoff time on the performance of algorithm configurators. In: Proc. of GECCO\u00a0\u201919, pp. 907\u2013915. ACM, New York, USA (2019). https:\/\/doi.org\/10.1145\/3321707.3321879","DOI":"10.1145\/3321707.3321879"},{"key":"1345_CR28","doi-asserted-by":"publisher","unstructured":"Hall, G.T., Oliveto, P.S., Sudholt, D.: Fast perturbative algorithm configurators. In: Proc. of PPSN\u00a0\u201920, vol. 12269, pp. 19\u201332. Springer, Cham, Switzerland (2020). https:\/\/doi.org\/10.1007\/978-3-030-58112-1_2","DOI":"10.1007\/978-3-030-58112-1_2"},{"key":"1345_CR29","doi-asserted-by":"publisher","unstructured":"Hall, G.T., Oliveto, P.S., Sudholt, D.: Analysis of the performance of algorithm configurators for search heuristics with global mutation operators. In: Proc. of GECCO\u00a0\u201920, pp. 823\u2013831. ACM, New York, USA (2020). https:\/\/doi.org\/10.1145\/3377930.3390218","DOI":"10.1145\/3377930.3390218"},{"key":"1345_CR30","doi-asserted-by":"publisher","first-page":"103629","DOI":"10.1016\/J.ARTINT.2021.103629","volume":"303","author":"GT Hall","year":"2022","unstructured":"Hall, G.T., Oliveto, P.S., Sudholt, D.: On the impact of the performance metric on efficient algorithm configuration. Artif. Intell. 303, 103629\u2013110362927 (2022). https:\/\/doi.org\/10.1016\/J.ARTINT.2021.103629","journal-title":"Artif. Intell."},{"key":"1345_CR31","doi-asserted-by":"publisher","unstructured":"Doerr, B., Doerr, C.: Theory of parameter control for discrete black-box optimization: Provable performance gains through dynamic parameter choices. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation\u00a0\u2013 Recent Developments in Discrete Optimization, pp. 271\u2013321. Springer, Cham, Switzerland (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4","DOI":"10.1007\/978-3-030-29414-4"},{"issue":"3","key":"1345_CR32","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1109\/TAC.1968.1098903","volume":"13","author":"M Schumer","year":"1968","unstructured":"Schumer, M., Steiglitz, K.: Adaptive step size random search. IEEE Trans. Autom. Control 13(3), 270\u2013276 (1968). https:\/\/doi.org\/10.1109\/TAC.1968.1098903","journal-title":"IEEE Trans. Autom. Control"},{"key":"1345_CR33","volume-title":"Evolutionstrategie: Optimierung Technischer Systeme Nach Prinzipien der Biologischen Evolution","author":"I Rechenberg","year":"1973","unstructured":"Rechenberg, I.: Evolutionstrategie: Optimierung Technischer Systeme Nach Prinzipien der Biologischen Evolution. Frommann-Holzboog Verlag, Stuttgart, Germany (1973)"},{"key":"1345_CR34","doi-asserted-by":"publisher","unstructured":"Doerr, B., Doerr, C.: Optimal parameter choices through self-adjustment: Applying the 1\/5-th rule in discrete settings. In: Proc. of GECCO\u00a0\u201915, pp. 1335\u20131342. ACM Press, New York, USA (2015). https:\/\/doi.org\/10.1145\/2739480.2754684","DOI":"10.1145\/2739480.2754684"},{"issue":"6","key":"1345_CR35","doi-asserted-by":"publisher","first-page":"1694","DOI":"10.1007\/s00453-022-00933-z","volume":"84","author":"A Rajabi","year":"2022","unstructured":"Rajabi, A., Witt, C.: Self-adjusting evolutionary algorithms for multimodal optimization. Algorithmica 84(6), 1694\u20131723 (2022). https:\/\/doi.org\/10.1007\/s00453-022-00933-z","journal-title":"Algorithmica"},{"key":"1345_CR36","doi-asserted-by":"publisher","unstructured":"Dang, D.-C., Lehre, P.K.: Self-adaptation of mutation rates in non-elitist populations. In: Proc. of PPSN\u00a0\u201916, pp. 803\u2013813. Springer, Cham, Switzerland (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_75","DOI":"10.1007\/978-3-319-45823-6_75"},{"key":"1345_CR37","doi-asserted-by":"publisher","unstructured":"Lehre, P.K., Qin, X.: Self-adaptation via multi-objectivisation: a theoretical study. In: Proc. of GECCO\u00a0\u201922, pp. 1417\u20131425. ACM, New York, USA (2022). https:\/\/doi.org\/10.1145\/3512290.3528836","DOI":"10.1145\/3512290.3528836"},{"key":"1345_CR38","doi-asserted-by":"publisher","unstructured":"Lehre, P.K., Qin, X.: Self-adaptation can improve the noise-tolerance of evolutionary algorithms. In: Proc. of FOGA\u00a0\u201923, pp. 105\u2013116. ACM, New York, USA (2023). https:\/\/doi.org\/10.1145\/3594805.3607128","DOI":"10.1145\/3594805.3607128"},{"key":"1345_CR39","doi-asserted-by":"publisher","unstructured":"Lehre, P.K., Qin, X.: Self-adaptation can help evolutionary algorithms track dynamic optima. In: Proc. of GECCO\u00a0\u201923, pp. 1619\u20131627. ACM, New York, USA (2023). https:\/\/doi.org\/10.1145\/3583131.3590494","DOI":"10.1145\/3583131.3590494"},{"issue":"4","key":"1345_CR40","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1109\/TEVC.2020.2985450","volume":"24","author":"B Case","year":"2020","unstructured":"Case, B., Lehre, P.K.: Self-adaptation in nonelitist evolutionary algorithms on discrete problems with unknown structure. IEEE Trans. Evol. Comput. 24(4), 650\u2013663 (2020). https:\/\/doi.org\/10.1109\/TEVC.2020.2985450","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"1345_CR41","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(4), 1012\u20131053 (2021). https:\/\/doi.org\/10.1007\/s00453-020-00726-2","journal-title":"Algorithmica"},{"key":"1345_CR42","doi-asserted-by":"publisher","unstructured":"Doerr, B., Doerr, C., Yang, J.: $$k$$-bit mutation with self-adjusting $$k$$ outperforms standard bit mutation. In: Proc. of PPSN\u00a0\u201916, pp. 824\u2013834. Springer, Cham, Switzerland (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_77","DOI":"10.1007\/978-3-319-45823-6_77"},{"issue":"3","key":"1345_CR43","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1162\/EVCO_A_00258","volume":"28","author":"A Lissovoi","year":"2020","unstructured":"Lissovoi, A., Oliveto, P.S., Warwicker, J.A.: Simple hyper-heuristics control the neighbourhood size of randomised local search optimally for LeadingOnes. Evol. Comput. 28(3), 437\u2013461 (2020). https:\/\/doi.org\/10.1162\/EVCO_A_00258","journal-title":"Evol. Comput."},{"key":"1345_CR44","doi-asserted-by":"publisher","first-page":"1038041","DOI":"10.1016\/J.ARTINT.2022.103804","volume":"314","author":"A Lissovoi","year":"2023","unstructured":"Lissovoi, A., Oliveto, P.S., Warwicker, J.A.: When move acceptance selection hyper-heuristics outperform Metropolis and elitist evolutionary algorithms and when not. Artif. Intell. 314, 1038041\u201310380423 (2023). https:\/\/doi.org\/10.1016\/J.ARTINT.2022.103804","journal-title":"Artif. Intell."},{"key":"1345_CR45","doi-asserted-by":"publisher","unstructured":"Wegener, I.: Theoretical aspects of evolutionary algorithms. In: Proc. of ICALP\u00a0\u201901, pp. 64\u201378. Springer, Berlin, Heidelberg, Germany (2001). https:\/\/doi.org\/10.1007\/3-540-48224-5_6","DOI":"10.1007\/3-540-48224-5_6"},{"issue":"3","key":"1345_CR46","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(3), 418\u2013435 (2013). https:\/\/doi.org\/10.1109\/TEVC.2012.2202241","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"1345_CR47","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(1), 51\u201381 (2001). https:\/\/doi.org\/10.1016\/S0004-3702(01)00058-3","journal-title":"Artif. Intell."},{"key":"1345_CR48","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). https:\/\/doi.org\/10.1007\/s00453-012-9622-x","journal-title":"Algorithmica"},{"key":"1345_CR49","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2019.08.021","volume":"796","author":"T K\u00f6tzing","year":"2019","unstructured":"K\u00f6tzing, T., Krejca, M.S.: First-hitting times under drift. Theoret. Comput. Sci. 796, 51\u201369 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.08.021","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"1345_CR50","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":"1345_CR51","doi-asserted-by":"publisher","unstructured":"Lengler, J.: Drift analysis. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation\u00a0\u2013 Recent Developments in Discrete Optimization, pp. 89\u2013131. Springer, Cham, Switzerland (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4","DOI":"10.1007\/978-3-030-29414-4"},{"key":"1345_CR52","volume-title":"Convergence Properties of Evolutionary Algorithms","author":"G Rudolph","year":"1997","unstructured":"Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kova\u010d, Hamburg, Germany (1997)"},{"key":"1345_CR53","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. Theoret. Comput. Sci. 378, 32\u201340 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2006.11.002","journal-title":"Theoret. Comput. Sci."},{"key":"1345_CR54","doi-asserted-by":"publisher","unstructured":"Reichel, J., Skutella, M.: On the size of weights in randomized search heuristics. In: Proc. of FOGA\u00a02009, pp. 21\u201328 (2009). https:\/\/doi.org\/10.1145\/1527125.1527130","DOI":"10.1145\/1527125.1527130"},{"issue":"2","key":"1345_CR55","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/TEVC.2006.871251","volume":"10","author":"GR Raidl","year":"2006","unstructured":"Raidl, G.R., Koller, G., Julstrom, B.A.: Biased mutation operators for subgraph-selection problems. IEEE Trans. Evol. Comput. 10(2), 145\u2013156 (2006). https:\/\/doi.org\/10.1109\/TEVC.2006.871251","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1\u20132","key":"1345_CR56","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/J.IPL.2013.09.013","volume":"114","author":"C Witt","year":"2014","unstructured":"Witt, C.: Fitness levels with tail bounds for the analysis of randomized search heuristics. Inf. Process. Lett. 114(1\u20132), 38\u201341 (2014). https:\/\/doi.org\/10.1016\/J.IPL.2013.09.013","journal-title":"Inf. Process. Lett."},{"key":"1345_CR57","doi-asserted-by":"publisher","unstructured":"Doerr, B.: Probabilistic tools for the analysis of randomized optimization heuristics. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation\u00a0\u2013 Recent Developments in Discrete Optimization, pp. 1\u201387. Springer, Cham, Switzerland (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4","DOI":"10.1007\/978-3-030-29414-4"},{"key":"1345_CR58","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). https:\/\/doi.org\/10.1016\/j.artint.2020.103345","journal-title":"Artif. Intell."},{"key":"1345_CR59","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/J.TCS.2022.08.014","volume":"940","author":"C Witt","year":"2023","unstructured":"Witt, C.: How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys. Theoret. Comput. Sci. 940, 18\u201342 (2023). https:\/\/doi.org\/10.1016\/J.TCS.2022.08.014","journal-title":"Theoret. Comput. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-025-01345-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-025-01345-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-025-01345-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T05:53:44Z","timestamp":1773726824000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-025-01345-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,13]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["1345"],"URL":"https:\/\/doi.org\/10.1007\/s00453-025-01345-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,13]]},"assertion":[{"value":"11 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2026","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The original online version of this article was revised due to update Algorithm 1 and Algorithm 2 with high resolution images.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"5"}}