{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T22:09:34Z","timestamp":1770070174469,"version":"3.49.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T00:00:00Z","timestamp":1644969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T00:00:00Z","timestamp":1644969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004836","name":"Danish Council for Independent Research","doi-asserted-by":"crossref","award":["DFF-FNU 8021-00260B"],"award-info":[{"award-number":["DFF-FNU 8021-00260B"]}],"id":[{"id":"10.13039\/501100004836","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00453-022-00933-z","type":"journal-article","created":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T05:02:30Z","timestamp":1644987750000},"page":"1694-1723","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Self-Adjusting Evolutionary Algorithms for Multimodal Optimization"],"prefix":"10.1007","volume":"84","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0898-5003","authenticated-orcid":false,"given":"Amirhossein","family":"Rajabi","sequence":"first","affiliation":[]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,16]]},"reference":[{"issue":"3","key":"933_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2996355","volume":"49","author":"A Aleti","year":"2016","unstructured":"Aleti, A., Moser, I.: A systematic literature review of adaptive parameter control methods for evolutionary algorithms. ACM Comput. Surv. 49(3), 1\u201335 (2016)","journal-title":"ACM Comput. Surv."},{"key":"933_CR2","doi-asserted-by":"crossref","unstructured":"Antipov, D., Doerr, B.: Runtime analysis of a heavy-tailed (1+$$(\\lambda ,\\lambda )$$) genetic algorithm on jump functions. In: T.\u00a0B\u00e4ck, M.\u00a0Preuss, A.H. Deutz, H.\u00a0Wang, C.\u00a0Doerr, M.T.M. Emmerich, H.\u00a0Trautmann (eds.) Proceedinsgs of PPSN\u00a0\u201920, Lecture Notes in Computer Science, Vol. 12270, pp. 545\u2013559. Springer (2020)","DOI":"10.1007\/978-3-030-58115-2_38"},{"key":"933_CR3","doi-asserted-by":"crossref","unstructured":"Antipov, D., Doerr, B., Karavaev, V.: A tight runtime analysis for the (1 + ($$\\lambda , \\lambda $$)) GA on LeadingOnes. In: Proceedings of FOGA \u201919, pp. 169\u2013182. ACM Press (2019)","DOI":"10.1145\/3299904.3340317"},{"key":"933_CR4","unstructured":"Antipov, D., Doerr, B., Karavaev, V.: The $$(1 + (\\lambda , \\lambda ))$$ GA is even faster on multimodal problems. In: Proceedings of GECCO\u00a0\u201920, pp. 1259\u20131267. ACM Press (2020)"},{"key":"933_CR5","doi-asserted-by":"crossref","unstructured":"Auger, A., Doerr, B. (eds.): Theory of Randomized Search Heuristics. World Scientific Publishing (2011)","DOI":"10.1142\/7438"},{"key":"933_CR6","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E.K., Gendreau, M., Hyde, M.R., Kendall, G., Ochoa, G., \u00d6zcan, E., Qu, R.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64, 1695\u20131724 (2013)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"933_CR7","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1162\/EVCO_a_00185","volume":"24","author":"M Buzdalov","year":"2016","unstructured":"Buzdalov, M., Doerr, B., Kever, M.: The unrestricted black-box complexity of jump functions. Evol. Comput. 24(4), 719\u2013744 (2016)","journal-title":"Evol. Comput."},{"key":"933_CR8","doi-asserted-by":"crossref","unstructured":"Corus, D., Oliveto, P.S., Yazdani, D.: Fast artificial immune systems. In: Proceedings of PPSN \u201918, pp. 67\u201378. Springer (2018)","DOI":"10.1007\/978-3-319-99259-4_6"},{"key":"933_CR9","doi-asserted-by":"crossref","unstructured":"Dang, D.C., Lehre, P.K.: Self-adaptation of mutation rates in non-elitist populations. In: Proc. of PPSN \u201916, pp. 803\u2013813. Springer (2016)","DOI":"10.1007\/978-3-319-45823-6_75"},{"key":"933_CR10","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: Proceedings of GECCO \u201919, pp. 1488\u20131496. ACM Press (2019)","DOI":"10.1145\/3321707.3321747"},{"issue":"5","key":"933_CR11","doi-asserted-by":"publisher","first-page":"1658","DOI":"10.1007\/s00453-017-0354-9","volume":"80","author":"B Doerr","year":"2018","unstructured":"Doerr, B., Doerr, C.: Optimal static and self-adjusting parameter choices for the (1+($$\\lambda $$, $$\\lambda $$)) genetic algorithm. Algorithmica 80(5), 1658\u20131709 (2018)","journal-title":"Algorithmica"},{"key":"933_CR12","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C.: Theory of parameter control for discrete black-box optimization: Provable performance gains through dynamic parameter choices. In: B.\u00a0Doerr, F.\u00a0Neumann (eds.) Theory of Evolutionary Computation\u2014Recent Developments in Discrete Optimization, pp. 271\u2013321. Springer (2020)","DOI":"10.1007\/978-3-030-29414-4_6"},{"issue":"5","key":"933_CR13","doi-asserted-by":"publisher","first-page":"1732","DOI":"10.1007\/s00453-017-0341-1","volume":"80","author":"B Doerr","year":"2018","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Static and self-adjusting mutation strengths for multi-valued decision variables. Algorithmica 80(5), 1732\u20131768 (2018)","journal-title":"Algorithmica"},{"key":"933_CR14","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., Yang, J.: k-bit mutation with self-adjusting k outperforms standard bit mutation. In: J.\u00a0Handl, E.\u00a0Hart, P.R. Lewis, M.\u00a0L\u00f3pez-Ib\u00e1\u00f1ez, G.\u00a0Ochoa, B.\u00a0Paechter (eds.) Proceedings of PPSN\u00a02016, Lecture Notes in Computer Science, vol. 9921, pp. 824\u2013834. Springer (2016)","DOI":"10.1007\/978-3-319-45823-6_77"},{"key":"933_CR15","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Witt, C.: Quasirandom evolutionary algorithms. In: Proceedings of GECCO\u00a0\u201910, pp. 1457\u20131464. ACM Press (2010)","DOI":"10.1145\/1830483.1830749"},{"issue":"2","key":"933_CR16","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(2), 593\u2013631 (2019)","journal-title":"Algorithmica"},{"key":"933_CR17","doi-asserted-by":"crossref","unstructured":"Doerr, B., Krejca, M.S.: Significance-based estimation-of-distribution algorithms. In: Proceedings of GECCO \u201918, pp. 1483\u20131490. ACM Press (2018)","DOI":"10.1145\/3205455.3205553"},{"key":"933_CR18","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 Press (2017)","DOI":"10.1145\/3071178.3071301"},{"key":"933_CR19","doi-asserted-by":"crossref","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. CoRR arXiv:1703.03334 (2017)","DOI":"10.1145\/3071178.3071301"},{"key":"933_CR20","doi-asserted-by":"crossref","unstructured":"Doerr, B., Neumann, F. (eds.): Theory of Evolutionary Computation - Recent Developments in Discrete Optimization. Springer, Natural Computing Series (2020)","DOI":"10.1007\/978-3-030-29414-4"},{"key":"933_CR21","doi-asserted-by":"crossref","unstructured":"Doerr, B., Witt, C., Yang, J.: Runtime analysis for self-adaptive mutation rates. In: Proceedings of GECCO \u201918, pp. 1475\u20131482. ACM Press (2018)","DOI":"10.1145\/3205455.3205569"},{"key":"933_CR22","doi-asserted-by":"crossref","unstructured":"Doerr, B., Zheng, W.: Theoretical analyses of multi-objective evolutionary algorithms on multi-modal objectives. In: Proceedings of AAAI\u00a0\u201921, pp. 12293\u201312301. AAAI Press (2021)","DOI":"10.1145\/3449726.3462719"},{"key":"933_CR23","doi-asserted-by":"crossref","unstructured":"Doerr, C., Wagner, M.: Sensitivity of parameter control mechanisms with respect to their initialization. In: Proceedings of PPSN \u201918, pp. 360\u2013372. Springer (2018)","DOI":"10.1007\/978-3-319-99259-4_29"},{"key":"933_CR24","doi-asserted-by":"crossref","unstructured":"Doerr, C., Ye, F., van Rijn, S., Wang, H., B\u00e4ck, T.: Towards a theory-guided benchmarking suite for discrete black-box optimization heuristics: Profiling (1+$$\\lambda $$) EA variants on OneMax and LeadingOnes. In: Proceedings of GECCO \u201918, pp. 951\u2013958. ACM Press (2018)","DOI":"10.1145\/3205455.3205621"},{"key":"933_CR25","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. Theoret. Comput. Sci. 276, 51\u201381 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"933_CR26","doi-asserted-by":"crossref","unstructured":"Eiben, A.E., Marchiori, E., Valk\u00f3, V.A.: Evolutionary algorithms with on-the-fly population size adjustment. In: Proceedings of PPSN \u201904, pp. 41\u201350. Springer (2004)","DOI":"10.1007\/978-3-540-30217-9_5"},{"key":"933_CR27","doi-asserted-by":"crossref","unstructured":"Fajardo, M.A.H.: An empirical evaluation of success-based parameter control mechanisms for evolutionary algorithms. In: Proceedings of GECCO \u201919, pp. 787\u2013795. ACM Press (2019)","DOI":"10.1145\/3321707.3321858"},{"key":"933_CR28","doi-asserted-by":"crossref","unstructured":"Friedrich, T., Quinzan, F., Wagner, M.: Escaping large deceptive basins of attraction with heavy-tailed mutation operators. In: Proceedings of GECCO \u201918, pp. 293\u2013300. ACM Press (2018)","DOI":"10.1145\/3205455.3205515"},{"key":"933_CR29","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":"933_CR30","doi-asserted-by":"publisher","first-page":"502","DOI":"10.2307\/1426671","volume":"14","author":"B Hajek","year":"1982","unstructured":"Hajek, B.: Hitting and occupation time bounds implied by drift analysis with applications. Adv. Appl. Probab. 14, 502\u2013525 (1982)","journal-title":"Adv. Appl. Probab."},{"key":"933_CR31","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood search. In: R.\u00a0Mart\u00ed, P.M. Pardalos, M.G.C. Resende (eds.) Handbook of Heuristics, pp. 759\u2013787. Springer (2018)","DOI":"10.1007\/978-3-319-07124-4_19"},{"key":"933_CR32","doi-asserted-by":"crossref","unstructured":"Jansen, T.: Analyzing Evolutionary Algorithms\u2014The Computer Science Perspective. Springer (2013)","DOI":"10.1007\/978-3-642-17339-4"},{"key":"933_CR33","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, 413\u2013440 (2005)","journal-title":"Evol. Comput."},{"issue":"4","key":"933_CR34","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1162\/1063656043138905","volume":"12","author":"T Jansen","year":"2004","unstructured":"Jansen, T., Wiegand, R.P.: The cooperative coevolutionary (1+1) EA. Evol. Comput. 12(4), 405\u2013434 (2004)","journal-title":"Evol. Comput."},{"key":"933_CR35","doi-asserted-by":"crossref","unstructured":"L\u00e4ssig, J., Sudholt, D.: Adaptive population models for offspring populations and parallel evolutionary algorithms. In: Proceedings of FOGA \u201911, pp. 181\u2013192. ACM Press (2011)","DOI":"10.1145\/1967654.1967671"},{"key":"933_CR36","doi-asserted-by":"crossref","unstructured":"Lengler, J.: A general dichotomy of evolutionary algorithms on monotone functions. In: Proceedings of PPSN \u201918, pp. 3\u201315. Springer (2018)","DOI":"10.1007\/978-3-319-99259-4_1"},{"key":"933_CR37","doi-asserted-by":"crossref","unstructured":"Lissovoi, A., Oliveto, P.S., Warwicker, J.A.: Simple hyper-heuristics control the neighbourhood size of randomised local search optimally for leadingones. Evolutionary Computation (2020). In print","DOI":"10.1162\/evco_a_00258"},{"key":"933_CR38","doi-asserted-by":"crossref","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization\u2014Algorithms and Their Computational Complexity. Springer (2010)","DOI":"10.1007\/978-3-642-16544-3"},{"key":"933_CR39","doi-asserted-by":"crossref","unstructured":"Rajabi, A., Witt, C.: Self-adjusting evolutionary algorithms for multimodal optimization. In: Proceedings of GECCO\u00a0\u201920, pp. 1314\u20131322. ACM Press (2020)","DOI":"10.1145\/3377930.3389833"},{"key":"933_CR40","doi-asserted-by":"crossref","unstructured":"Rajabi, A., Witt, C.: Stagnation detection with randomized local search. In: Proceedings of EvoCOP\u00a0\u201921, pp. 152\u2013168. Springer (2021)","DOI":"10.1007\/978-3-030-72904-2_10"},{"key":"933_CR41","doi-asserted-by":"crossref","unstructured":"Rodionova, A., Antonov, K., Buzdalova, A., Doerr, C.: Offspring population size matters when comparing evolutionary algorithms with self-adjusting mutation rates. In: Proceedings of GECCO \u201919, pp. 855\u2013863. ACM Press (2019)","DOI":"10.1145\/3321707.3321827"},{"key":"933_CR42","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 GECCO \u201909, pp. 1713\u20131720. ACM Press (2009)","DOI":"10.1145\/1569901.1570131"},{"key":"933_CR43","doi-asserted-by":"crossref","unstructured":"Rowe, J.E., Aishwaryaprajna: The benefits and limitations of voting mechanisms in evolutionary optimisation. In: Proceedings of FOGA \u201919, pp. 34\u201342. ACM Press (2019)","DOI":"10.1145\/3299904.3340305"},{"key":"933_CR44","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":"933_CR45","unstructured":"Wegener, I.: Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In: R.\u00a0Sarker, M.\u00a0Mohammadian, X.\u00a0Yao (eds.) Evolutionary Optimization. Kluwer Academic Publishers (2001)"},{"key":"933_CR46","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: Proceedings of PPSN \u201918, pp. 55\u201366. Springer (2018)","DOI":"10.1007\/978-3-319-99259-4_5"},{"key":"933_CR47","doi-asserted-by":"crossref","unstructured":"Witt, C.: Population size vs. runtime of a simple EA. In: Proceedings of CEC \u201903, vol.\u00a03, pp. 1996\u20132003. IEEE Press (2003)","DOI":"10.1109\/CEC.2003.1299918"},{"issue":"1","key":"933_CR48","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(1), 65\u201386 (2006)","journal-title":"Evol. Comput."},{"issue":"1","key":"933_CR49","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.tcs.2008.05.011","volume":"403","author":"C Witt","year":"2008","unstructured":"Witt, C.: Population size versus runtime of a simple evolutionary algorithm. Theoret. Comput. Sci. 403(1), 104\u2013120 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"933_CR50","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, 294\u2013318 (2013)","journal-title":"Comb. Probab. Comput."},{"key":"933_CR51","doi-asserted-by":"crossref","unstructured":"Ye, F., Doerr, C., B\u00e4ck, T.: Interpolating local and global search by controlling the variance of standard bit mutation. In: Proceedings of CEC \u201919, pp. 2292\u20132299 (2019)","DOI":"10.1109\/CEC.2019.8790107"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00933-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-00933-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00933-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T17:57:12Z","timestamp":1726682232000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-00933-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,16]]},"references-count":51,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["933"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-00933-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,16]]},"assertion":[{"value":"31 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}