{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T04:11:22Z","timestamp":1783397482584,"version":"3.54.6"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T00:00:00Z","timestamp":1690329600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T00:00:00Z","timestamp":1690329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s00453-023-01146-8","type":"journal-article","created":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T06:01:51Z","timestamp":1690351311000},"page":"90-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Runtime Analysis for Permutation-based Evolutionary Algorithms"],"prefix":"10.1007","volume":"86","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yassine","family":"Ghannane","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marouane","family":"Ibn Brahim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,7,26]]},"reference":[{"key":"1146_CR1","doi-asserted-by":"crossref","unstructured":"Antipov, D., Buzdalov, M., Doerr, B.: First steps towards a runtime analysis when starting with a good solution. In: Parallel Problem Solving From Nature, PPSN 2020, Part II, pp. 560\u2013573. Springer (2020)","DOI":"10.1007\/978-3-030-58115-2_39"},{"key":"1146_CR2","doi-asserted-by":"crossref","unstructured":"Antipov, D., Buzdalov, M., Doerr, B.: Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 1115\u20131123. ACM (2021)","DOI":"10.1145\/3449639.3459377"},{"key":"1146_CR3","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)","journal-title":"Algorithmica"},{"key":"1146_CR4","doi-asserted-by":"crossref","unstructured":"Auger, A., Doerr, B. (eds.): Theory of Randomized Search Heuristics. World Scientific Publishing (2011)","DOI":"10.1142\/7438"},{"key":"1146_CR5","doi-asserted-by":"crossref","unstructured":"Antipov, D., Doerr, B.: Runtime analysis of a heavy-tailed $${(1+(\\lambda , \\lambda ))}$$ genetic algorithm on jump functions. In: Parallel Problem Solving From Nature, PPSN 2020, Part\u00a0II, pp. 545\u2013559. Springer (2020)","DOI":"10.1007\/978-3-030-58115-2_38"},{"key":"1146_CR6","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1007\/s00453-021-00907-7","volume":"84","author":"D Antipov","year":"2022","unstructured":"Antipov, D., Doerr, B., Karavaev, V.: A rigorous runtime analysis of the $${(1 + (\\lambda,\\lambda ))}$$ GA on jump functions. Algorithmica 84, 1573\u20131602 (2022)","journal-title":"Algorithmica"},{"key":"1146_CR7","doi-asserted-by":"crossref","unstructured":"Bassin, A., Buzdalov, M.: The $$(1+(\\lambda ,\\lambda ))$$ genetic algorithm for permutations. In: Genetic and Evolutionary Computation Conference, GECCO 2020, Companion, pp. 1669\u20131677. ACM (2020)","DOI":"10.1145\/3377929.3398148"},{"key":"1146_CR8","doi-asserted-by":"crossref","unstructured":"Benbaki, R., Benomar, Z., Doerr, B.: A rigorous runtime analysis of the 2-MMAS$$_{\\rm ib}$$ on jump functions: ant colony optimizers can cope well with local optima. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 4\u201313. ACM (2021)","DOI":"10.1145\/3449639.3459350"},{"key":"1146_CR9","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":"1146_CR10","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":"1146_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1162\/EVCO_a_00147","volume":"24","author":"D Corus","year":"2016","unstructured":"Corus, D., Lehre, P.K., Neumann, F., Pourhassan, M.: A parameterised complexity analysis of bi-level optimisation with evolutionary algorithms. Evol. Comput. 24, 183\u2013203 (2016)","journal-title":"Evol. Comput."},{"key":"1146_CR12","doi-asserted-by":"crossref","unstructured":"Corus, D., Oliveto, P.S., Yazdani, D.: Automatic adaptation of hypermutation rates for multimodal optimisation. In: Foundations of Genetic Algorithms, FOGA 2021, pp. 4:1\u20134:12. ACM (2021)","DOI":"10.1145\/3450218.3477305"},{"key":"1146_CR13","doi-asserted-by":"crossref","unstructured":"Do, A.V., Bossek, J., Neumann, A., Neumann, F.: Evolving diverse sets of tours for the travelling salesperson problem. In: Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 681\u2013689. ACM (2020)","DOI":"10.1145\/3377930.3389844"},{"key":"1146_CR14","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1162\/EVCO_a_00158","volume":"23","author":"B Doerr","year":"2015","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Unbiased black-box complexities of jump functions. Evol. Comput. 23, 641\u2013670 (2015)","journal-title":"Evol. Comput."},{"key":"1146_CR15","doi-asserted-by":"crossref","unstructured":"Dang, D.-C., Eremeev, A.V., Lehre, P.K., Qin, X.: Fast non-elitist evolutionary algorithms with power-law ranking selection. In: Genetic and Evolutionary Computation Conference, GECCO 2022, pp. 1372\u20131380. ACM (2022)","DOI":"10.1145\/3512290.3528873"},{"key":"1146_CR16","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":"1146_CR17","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":"1146_CR18","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":"1146_CR19","doi-asserted-by":"crossref","unstructured":"Doerr, B., Ghannane, Y., Brahim, M.I.: Towards a stronger theory for permutation-based evolutionary algorithms. In: Genetic and Evolutionary Computation Conference, GECCO 2022, pp. 1390\u20131398. ACM (2022)","DOI":"10.1145\/3512290.3528720"},{"key":"1146_CR20","doi-asserted-by":"crossref","unstructured":"Do, A.V., Guo, M., Neumann, A., Neumann, F.: Analysis of evolutionary diversity optimisation for permutation problems. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 574\u2013582. ACM (2021)","DOI":"10.1145\/3449639.3459313"},{"key":"1146_CR21","doi-asserted-by":"crossref","unstructured":"Doerr, B., Happ, E.: Directed trees: A powerful representation for sorting and ordering problems. In: Congress on Evolutionary Computation, CEC 2008, pp. 3606\u20133613. IEEE (2008)","DOI":"10.1109\/CEC.2008.4631286"},{"key":"1146_CR22","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1162\/evco.2007.15.4.401","volume":"15","author":"B Doerr","year":"2007","unstructured":"Doerr, B., Hebbinghaus, N., Neumann, F.: Speeding up evolutionary algorithms through asymmetric mutation operators. Evol. Comput. 15, 401\u2013410 (2007)","journal-title":"Evol. Comput."},{"key":"1146_CR23","doi-asserted-by":"crossref","unstructured":"Doerr, B., Johannsen, D.: Adjacency list matchings: an ideal genotype for cycle covers. In: Genetic and Evolutionary Computation Conference, GECCO 2007, pp. 1203\u20131210. ACM (2007)","DOI":"10.1145\/1276958.1277192"},{"key":"1146_CR24","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":"1146_CR25","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2012.01.048","volume":"436","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Non-existence of linear universal drift functions. Theoret. Comput. Sci. 436, 71\u201386 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"1146_CR26","doi-asserted-by":"crossref","unstructured":"Doerr, B., K\u00f6tzing, T.: Lower bounds from fitness levels made easy. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 1142\u20131150. ACM (2021)","DOI":"10.1145\/3449639.3459352"},{"key":"1146_CR27","doi-asserted-by":"publisher","first-page":"3017","DOI":"10.1007\/s00453-020-00775-7","volume":"83","author":"B Doerr","year":"2021","unstructured":"Doerr, B., K\u00f6tzing, T.: Multiplicative up-drift. Algorithmica 83, 3017\u20133058 (2021)","journal-title":"Algorithmica"},{"key":"1146_CR28","doi-asserted-by":"crossref","unstructured":"Doerr, B., Klein, C., Storch, T.: Faster evolutionary algorithms by superior graph representation. In: Foundations of Computational Intelligence, FOCI 2007, pp. 245\u2013250. IEEE (2007)","DOI":"10.1109\/FOCI.2007.372176"},{"key":"1146_CR29","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":"1146_CR30","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":"1146_CR31","doi-asserted-by":"crossref","unstructured":"Doerr, B., Neumann, F. (eds.): Theory of Evolutionary Computation\u2014Recent Developments in Discrete Optimization. Springer (2020). Also available at http:\/\/www.lix.polytechnique.fr\/Labo\/Benjamin.Doerr\/doerr_neumann_book.html","DOI":"10.1007\/978-3-030-29414-4"},{"key":"1146_CR32","doi-asserted-by":"publisher","first-page":"3059","DOI":"10.1007\/s00453-020-00780-w","volume":"83","author":"B Doerr","year":"2021","unstructured":"Doerr, B.: The runtime of the compact genetic algorithm on Jump functions. Algorithmica 83, 3059\u20133107 (2021)","journal-title":"Algorithmica"},{"key":"1146_CR33","doi-asserted-by":"publisher","first-page":"1659","DOI":"10.1007\/s00453-021-00896-7","volume":"84","author":"B Doerr","year":"2022","unstructured":"Doerr, B.: Does comma selection help to cope with local optima? Algorithmica 84, 1659\u20131693 (2022)","journal-title":"Algorithmica"},{"key":"1146_CR34","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3250552","author":"B Doerr","year":"2023","unstructured":"Doerr, B., Zhongdi, Q.: A first runtime analysis of the NSGA-II on a multimodal problem. Trans. Evolut. Comput. (2023). https:\/\/doi.org\/10.1109\/TEVC.2023.3250552","journal-title":"Trans. Evolut. Comput."},{"key":"1146_CR35","doi-asserted-by":"publisher","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)","journal-title":"Theoret. Comput. Sci."},{"key":"1146_CR36","doi-asserted-by":"crossref","unstructured":"Doerr, B., Zheng, W.: Theoretical analyses of multi-objective evolutionary algorithms on multi-modal objectives. In: Conference on Artificial Intelligence, AAAI 2021, pp. 12293\u201312301. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i14.17459"},{"key":"1146_CR37","doi-asserted-by":"crossref","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing, 2nd edn. Springer (2015)","DOI":"10.1007\/978-3-662-44874-8"},{"key":"1146_CR38","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":"1146_CR39","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":"1146_CR40","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1007\/s00453-018-0429-2","volume":"81","author":"T Gavenciak","year":"2019","unstructured":"Gavenciak, T., Geissmann, B., Lengler, J.: Sorting by swaps with noisy comparisons. Algorithmica 81, 796\u2013827 (2019)","journal-title":"Algorithmica"},{"key":"1146_CR41","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":"1146_CR42","doi-asserted-by":"crossref","unstructured":"Hevia\u00a0Fajardo, M.A., Sudholt, D.: Self-adjusting offspring population sizes outperform fixed parameters on the cliff function. In: Foundations of Genetic Algorithms, FOGA 2021, pp. 5:1\u20135:15. ACM (2021)","DOI":"10.1145\/3450218.3477306"},{"key":"1146_CR43","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":"1146_CR44","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":"1146_CR45","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00453-010-9396-y","volume":"59","author":"J J\u00e4gersk\u00fcpper","year":"2011","unstructured":"J\u00e4gersk\u00fcpper, J.: Combining Markov-chain analysis and drift analysis - the (1+1) evolutionary algorithm on linear functions reloaded. Algorithmica 59, 409\u2013424 (2011)","journal-title":"Algorithmica"},{"key":"1146_CR46","doi-asserted-by":"crossref","unstructured":"Jansen, T.: Analyzing Evolutionary Algorithms\u2013The Computer Science Perspective. Springer (2013)","DOI":"10.1007\/978-3-642-17339-4"},{"key":"1146_CR47","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":"1146_CR48","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":"1146_CR49","doi-asserted-by":"crossref","unstructured":"Jansen, T., Zarges, C.: Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering. In: Hans-Georg B., Langdon, W.B. (eds.) Foundations of Genetic Algorithms, FOGA 2011, pp. 1\u201314. ACM (2011)","DOI":"10.1145\/1967654.1967656"},{"key":"1146_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":"1146_CR51","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). Also available at https:\/\/arxiv.org\/abs\/1712.00964","DOI":"10.1007\/978-3-030-29414-4_2"},{"key":"1146_CR52","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez, C., Panholzer, A., Prodinger, H.: Generating random derangements. In: Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2008, pp. 234\u2013240. SIAM (2008)","DOI":"10.1137\/1.9781611972986.7"},{"key":"1146_CR53","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/s11047-021-09856-0","volume":"21","author":"M M\u00fchlenthaler","year":"2022","unstructured":"M\u00fchlenthaler, M., Ra\u00df, A., Schmitt, M., Wanka, R.: Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax. Nat. Comput. 21, 651\u2013677 (2022)","journal-title":"Nat. Comput."},{"key":"1146_CR54","doi-asserted-by":"publisher","first-page":"2750","DOI":"10.1016\/j.cor.2006.12.009","volume":"35","author":"F Neumann","year":"2008","unstructured":"Neumann, F.: Expected runtimes of evolutionary algorithms for the Eulerian cycle problem. Comput. OR 35, 2750\u20132759 (2008)","journal-title":"Comput. OR"},{"key":"1146_CR55","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1162\/evco_a_00199","volume":"25","author":"S Nallaperuma","year":"2017","unstructured":"Nallaperuma, S., Neumann, F., Sudholt, D.: Expected fitness gains of randomized search heuristics for the traveling salesperson problem. Evol. Comput. 25, 673\u2013705 (2017)","journal-title":"Evol. Comput."},{"key":"1146_CR56","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":"1146_CR57","unstructured":"OEIS Foundation Inc. The On-Line Encyclopedia of Integer Sequences, (2022). Published electronically at http:\/\/oeis.org"},{"key":"1146_CR58","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, 561\u2013575 (2021)","journal-title":"Nat. Comput."},{"key":"1146_CR59","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":"1146_CR60","unstructured":"de Montmort, P.R.: Essay d\u2019analyse sur les jeux de hazard, 2nd edn. Quillau, Paris (1713)"},{"key":"1146_CR61","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. Theoret. Comput. Sci. 545, 20\u201338 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"1146_CR62","unstructured":"Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Verlag Dr, Kov\u01cec (1997)"},{"key":"1146_CR63","doi-asserted-by":"crossref","unstructured":"Rajabi, A., Witt, C.: Stagnation detection in highly multimodal fitness landscapes. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 1178\u20131186. ACM (2021)","DOI":"10.1145\/3449639.3459336"},{"key":"1146_CR64","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, 1694\u20131723 (2022)","journal-title":"Algorithmica"},{"key":"1146_CR65","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\u201329 (2023)","journal-title":"Evol. Comput."},{"key":"1146_CR66","doi-asserted-by":"crossref","unstructured":"Sutton, A.M., Neumann, F.: A parameterized runtime analysis of evolutionary algorithms for the Euclidean traveling salesperson problem. In: AAAI Conference on Artificial Intelligence, AAAI 2012, pp. 1105\u20131111. AAAI Press (2012)","DOI":"10.1609\/aaai.v26i1.8273"},{"key":"1146_CR67","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1162\/EVCO_a_00119","volume":"22","author":"AM Sutton","year":"2014","unstructured":"Sutton, A.M., Neumann, F., Nallaperuma, S.: Parameterized runtime analyses of evolutionary algorithms for the planar Euclidean traveling salesperson problem. Evol. Comput. 22, 595\u2013628 (2014)","journal-title":"Evol. Comput."},{"key":"1146_CR68","doi-asserted-by":"publisher","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":"1146_CR69","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":"1146_CR70","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Theoretical aspects of evolutionary algorithms. In: Automata, Languages and Programming, ICALP 2001, pp. 64\u201378. Springer (2001)","DOI":"10.1007\/3-540-48224-5_6"},{"key":"1146_CR71","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":"1146_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":"1146_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"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01146-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-023-01146-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01146-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T00:09:46Z","timestamp":1729814986000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-023-01146-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,26]]},"references-count":73,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["1146"],"URL":"https:\/\/doi.org\/10.1007\/s00453-023-01146-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,26]]},"assertion":[{"value":"2 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest with regard to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}]}}