{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T06:01:47Z","timestamp":1783749707978,"version":"3.55.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,7,5]],"date-time":"2017-07-05T00:00:00Z","timestamp":1499212800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"LabEx LMH","award":["ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s00453-017-0341-1","type":"journal-article","created":{"date-parts":[[2017,7,5]],"date-time":"2017-07-05T13:35:58Z","timestamp":1499261758000},"page":"1732-1768","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":51,"title":["Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables"],"prefix":"10.1007","volume":"80","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Timo","family":"K\u00f6tzing","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,7,5]]},"reference":[{"key":"341_CR1","doi-asserted-by":"crossref","DOI":"10.1142\/7438","volume-title":"Theory of Randomized Search Heuristics","author":"A Auger","year":"2011","unstructured":"Auger, A., Doerr, B.: Theory of Randomized Search Heuristics. World Scientific, Singapore (2011)"},{"key":"341_CR2","unstructured":"Auger, A., Hansen, N.: Linear convergence on positively homogeneous functions of a comparison based step-size adaptive randomized search: the (1+1) ES with generalized one-fifth success rule. CoRR (2013). arXiv:1310.8397"},{"key":"341_CR3","doi-asserted-by":"crossref","unstructured":"Badkobeh, G., Lehre, P.K., Sudholt, D.: Unbiased black-box complexity of parallel search. In: Proceedings of Parallel Problem Solving from Nature (PPSN\u201914), Lecture Notes in Computer Science, vol. 8672, pp. 892\u2013901. Springer (2014)","DOI":"10.1007\/978-3-319-10762-2_88"},{"key":"341_CR4","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 Parallel Problem Solving from Nature (PPSN\u201910), Lecture Notes in Computer Science, vol. 6238, pp. 1\u201310. Springer (2010)","DOI":"10.1007\/978-3-642-15844-5_1"},{"key":"341_CR5","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 Genetic and Evolutionary Computation Conference (GECCO\u201917). ACM (2017)","DOI":"10.1145\/3071178.3071297"},{"key":"341_CR6","doi-asserted-by":"crossref","unstructured":"Dang, D., Lehre, P.K.: Self-adaptation of mutation rates in non-elitist populations. In: Proceedings of Parallel Problem Solving from Nature (PPSN\u201916), Lecture Notes in Computer Science, vol. 9921, pp. 803\u2013813. Springer (2016)","DOI":"10.1007\/978-3-319-45823-6_75"},{"key":"341_CR7","doi-asserted-by":"crossref","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":"341_CR8","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":"341_CR9","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C.: The impact of random initialization on the runtime of randomized search heuristics. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201914), pp. 1375\u20131382. ACM (2014)","DOI":"10.1145\/2576768.2598359"},{"key":"341_CR10","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 Genetic and Evolutionary Computation Conference (GECCO\u201915), pp. 1335\u20131342. ACM (2015)","DOI":"10.1145\/2739480.2754684"},{"key":"341_CR11","doi-asserted-by":"crossref","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 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"341_CR12","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 Parallel Problem Solving from Nature (PPSN\u201916), Lecture Notes in Computer Science, vol. 9921, pp. 782\u2013791. Springer (2016)","DOI":"10.1007\/978-3-319-45823-6_73"},{"key":"341_CR13","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: The right mutation strength for multi-valued decision variables. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201916), pp. 1115\u20131122. ACM (2016)","DOI":"10.1145\/2908812.2908891"},{"key":"341_CR14","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 Parallel Problem Solving from Nature (PPSN\u201916), Lecture Notes in Computer Science, vol. 9921, pp. 824\u2013834. Springer (2016)","DOI":"10.1007\/978-3-319-45823-6_77"},{"key":"341_CR15","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., Yang, J.: Optimal parameter choices via precise black-box analysis. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201916), pp. 1123\u20131130. ACM (2016)","DOI":"10.1145\/2908812.2908950"},{"key":"341_CR16","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Witt, C.: Sharp bounds by probability-generating functions and variable drift. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201911), pp. 2083\u20132090. ACM (2011)","DOI":"10.1145\/2001576.2001856"},{"key":"341_CR17","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 Genetic and Evolutionary Computation Conference (GECCO\u201917). ACM (2017)","DOI":"10.1145\/3071178.3071279"},{"key":"341_CR18","doi-asserted-by":"crossref","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":"341_CR19","doi-asserted-by":"crossref","unstructured":"Doerr, B., Johannsen, D.: Adjacency list matchings: an ideal genotype for cycle covers. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201907), pp. 1203\u20131210. ACM (2007)","DOI":"10.1145\/1276958.1277192"},{"key":"341_CR20","doi-asserted-by":"crossref","unstructured":"Doerr, B., Johannsen, D., Schmidt, M.: Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets. In: Proceedings of Foundations of Genetic Algorithms (FOGA\u201911), pp. 119\u2013126. ACM (2011)","DOI":"10.1145\/1967654.1967665"},{"key":"341_CR21","doi-asserted-by":"crossref","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":"341_CR22","doi-asserted-by":"crossref","unstructured":"Doerr, B., Pohl, S.: Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201912), pp. 1317\u20131324. ACM (2012)","DOI":"10.1145\/2330163.2330346"},{"key":"341_CR23","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s00224-004-1177-z","volume":"39","author":"S Droste","year":"2006","unstructured":"Droste, S., Jansen, T., Wegener, I.: Upper and lower bounds for randomized search heuristics in black-box optimization. Theory Comput. Syst. 39, 525\u2013544 (2006)","journal-title":"Theory Comput. Syst."},{"key":"341_CR24","doi-asserted-by":"crossref","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":"341_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05094-1","volume-title":"Introduction to Evolutionary Computing","author":"AE Eiben","year":"2003","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer, Berlin (2003)"},{"key":"341_CR26","doi-asserted-by":"crossref","unstructured":"Gunia, C.: On the analysis of the approximation capability of simple evolutionary algorithms for scheduling problems. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201905), pp. 571\u2013578. ACM (2005)","DOI":"10.1145\/1068009.1068106"},{"key":"341_CR27","doi-asserted-by":"crossref","unstructured":"Hansen, N., Gawelczyk, A., Ostermeier, A.: Sizing the population with respect to the local progress in (1, $$ \\lambda $$ \u03bb )-evolution strategies\u2014a theoretical analysis. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC\u201995), pp. 80\u201385. IEEE (1995)","DOI":"10.1109\/ICEC.1995.489123"},{"key":"341_CR28","doi-asserted-by":"crossref","first-page":"57","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, 57\u201385 (2001)","journal-title":"Artif. Intell."},{"key":"341_CR29","doi-asserted-by":"crossref","unstructured":"J\u00e4gersk\u00fcpper, J.: Rigorous runtime analysis of the (1+1) ES: 1\/5-rule and ellipsoidal fitness landscapes. In: Proceedings of Foundations of Genetic Algorithms (FOGA\u201905), Lecture Notes in Computer Science, vol. 3469, pp. 260\u2013281. Springer (2005)","DOI":"10.1007\/11513575_14"},{"key":"341_CR30","doi-asserted-by":"crossref","unstructured":"J\u00e4gersk\u00fcpper, J.: Oblivious randomized direct search for real-parameter optimization. In: Proceedings of European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, vol. 5193, pp. 553\u2013564. Springer (2008)","DOI":"10.1007\/978-3-540-87744-8_46"},{"key":"341_CR31","doi-asserted-by":"crossref","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":"341_CR32","doi-asserted-by":"crossref","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":"341_CR33","unstructured":"Johannsen, D.: Random combinatorial structures and randomized search heuristics. Ph.D. thesis, Saarland University. http:\/\/scidok.sulb.uni-saarland.de\/volltexte\/2011\/3529\/ (2010)"},{"key":"341_CR34","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/TEVC.2014.2308294","volume":"19","author":"G Karafotias","year":"2015","unstructured":"Karafotias, G., Hoogendoorn, M., Eiben, A.: Parameter control in evolutionary algorithms: trends and challenges. IEEE Trans. Evolut. Comput. 19, 167\u2013187 (2015)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"341_CR35","doi-asserted-by":"crossref","unstructured":"K\u00f6tzing, T., Lissovoi, A., Witt, C.: (1+1) EA on generalized dynamic OneMax. In: Proceedings of Foundations of Genetic Algorithms (FOGA\u201915), pp. 40\u201351. ACM (2015)","DOI":"10.1145\/2725494.2725502"},{"key":"341_CR36","doi-asserted-by":"crossref","unstructured":"L\u00e4ssig, J., Sudholt, D.: Adaptive population models for offspring populations and parallel evolutionary algorithms. In: Proceedings of Foundations of Genetic Algorithms (FOGA\u201911), pp. 181\u2013192. ACM (2011)","DOI":"10.1145\/1967654.1967671"},{"key":"341_CR37","doi-asserted-by":"crossref","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":"341_CR38","doi-asserted-by":"crossref","unstructured":"Lissovoi, A., Witt, C.: MMAS vs. population-based EA on a family of dynamic fitness functions. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201914), pp. 1399\u20131406. ACM (2014)","DOI":"10.1145\/2576768.2598301"},{"key":"341_CR39","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1108\/17563780910959893","volume":"2","author":"B Mitavskiy","year":"2009","unstructured":"Mitavskiy, B., Rowe, J., 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":"341_CR40","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":"341_CR41","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 Congress on Evolutionary Computation (CEC\u201909), pp. 1455\u20131462. IEEE (2009)","DOI":"10.1109\/CEC.2009.4983114"},{"key":"341_CR42","volume-title":"Representations for Genetic and Evolutionary Algorithms","author":"F Rothlauf","year":"2006","unstructured":"Rothlauf, F.: Representations for Genetic and Evolutionary Algorithms, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"341_CR43","doi-asserted-by":"crossref","unstructured":"Rudolph, G.: An evolutionary algorithm for integer programming. In: Proceedings of Parallel Problem Solving from Nature (PPSN\u201994), pp. 139\u2013148. Springer (1994)","DOI":"10.1007\/3-540-58484-6_258"},{"key":"341_CR44","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1023\/B:JMMA.0000049379.14872.f5","volume":"3","author":"J Scharnow","year":"2004","unstructured":"Scharnow, J., Tinnefeld, K., Wegener, I.: The analysis of evolutionary algorithms on sorting and shortest paths problems. J. Math. Model. Algorithms 3, 349\u2013366 (2004)","journal-title":"J. Math. Model. Algorithms"},{"key":"341_CR45","doi-asserted-by":"crossref","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":"341_CR46","doi-asserted-by":"crossref","unstructured":"Zarges, C.: Rigorous runtime analysis of inversely fitness proportional mutation rates. In: Proceedings of Parallel Problem Solving from Nature (PPSN\u201908), Lecture Notes in Computer Science, vol. 5199, pp. 112\u2013122. Springer (2008)","DOI":"10.1007\/978-3-540-87700-4_12"},{"key":"341_CR47","doi-asserted-by":"crossref","unstructured":"Zarges, C.: On the utility of the population size for inversely fitness proportional mutation rates. In: Proceedings of Foundations of Genetic Algorithms (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-017-0341-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0341-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0341-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T08:28:45Z","timestamp":1750494525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0341-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,5]]},"references-count":47,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["341"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0341-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,5]]}}}