{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:59:22Z","timestamp":1773615562184,"version":"3.50.1"},"reference-count":84,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"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":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.3103\/s0146411621070208","type":"journal-article","created":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T09:15:43Z","timestamp":1643706943000},"page":"885-902","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The \u201cOne-Fifth Rule\u201d with Rollbacks for Self-Adjustment of the Population Size in the (1 + (\u03bb, \u03bb)) Genetic Algorithm"],"prefix":"10.3103","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6697-6714","authenticated-orcid":false,"given":"A. O.","family":"Bassin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7120-8824","authenticated-orcid":false,"given":"M. V.","family":"Buzdalov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2723-2077","authenticated-orcid":false,"given":"A. A.","family":"Shalyto","sequence":"additional","affiliation":[]}],"member":"1627","published-online":{"date-parts":[[2022,2,1]]},"reference":[{"key":"7414_CR1","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H., Adaptation in Natural and Artificial Systems, Ann Arbor, Mich.: Univ. of Michigan, 1975."},{"key":"7414_CR2","volume-title":"Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution","author":"I. Rechenberg","year":"1973","unstructured":"Rechenberg, I., Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution, Stuttgart: Fromman-Holzboorg Verlag, 1973."},{"key":"7414_CR3","volume-title":"Bin\u00e4re Optimierung durch somatische Mutation, Tech.","author":"H.-P. Schwefel","year":"1975","unstructured":"Schwefel, H.-P., Bin\u00e4re Optimierung durch somatische Mutation, Tech. Rep., TU Berlin and Medizinische Hochschule Hannover, 1975."},{"key":"7414_CR4","first-page":"14","volume":"4","author":"L.G. Fogel","year":"1962","unstructured":"Fogel L.G., Autonomous automata\u00b8 Ind. Res., 1962, vol. 4, pp. 14\u201319.","journal-title":"Ind. Res."},{"key":"7414_CR5","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"J.R. Koza","year":"1992","unstructured":"Koza, J.R., Genetic Programming: On the Programming of Computers by Means of Natural Selection, Cambridge, Mass.: MIT Press, 1992."},{"key":"7414_CR6","doi-asserted-by":"publisher","unstructured":"Eberhart, R. and Kennedy, J., A new optimizer using particle swarm theory, in MHS\u201995. Proc. Sixth Int. Symp. on Micro Machine and Human Science, Nagoya, Japan, 1995, IEEE, 1995, pp. 39\u201343. \u00a0https:\/\/doi.org\/10.1109\/MHS.1995.494215","DOI":"10.1109\/MHS.1995.494215"},{"key":"7414_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M. and Gambardella, L.M., Ant colony system: A cooperative learning approach to the traveling salesman problem, IEEE Trans. Evol. Comput., 1997, vol. 1., no. 1, pp. 53\u201366. \u00a0https:\/\/doi.org\/10.1109\/4235.585892","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7414_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","volume":"1","author":"R. Poli","year":"2007","unstructured":"Poli, R., Kennedy, J., and Blackwell, T., Particle swarm optimization: An overview, Swarm Intell., 2007, vol. 1, pp. 33\u201357. \u00a0https:\/\/doi.org\/10.1007\/s11721-007-0002-0","journal-title":"Swarm Intell."},{"key":"7414_CR9","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gela, C.D., and Vecchi, M.P., Optimization by simulated annealing, Science, 1983, vol. 220, no. 4598, pp. 671\u2013680. \u00a0https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"key":"7414_CR10","unstructured":"Bishop, J.M., Stochastic searching networks, First IEEE Int. Conf. on Artificial Neural Networks (Conf. Publ. No. 313), London, \n               1989, IET, 1989, pp. 329\u2013331."},{"key":"7414_CR11","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R. Storn","year":"1997","unstructured":"Storn, R. and Price, K., Differential evolution \u2013 A simple and efficient heuristic for global optimization over continuous spaces, J. Global Optim., 1997, vol. 11, no. 4, pp. 341\u2013359. \u00a0https:\/\/doi.org\/10.1023\/A:1008202821328","journal-title":"J. Global Optim."},{"key":"7414_CR12","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1162\/106365600750078808","volume":"8","author":"M. Pelikan","year":"2000","unstructured":"Pelikan, M., Goldberg, D.E., and Cant\u00fa-Paz, E., Linkage problem, distribution estimation, and Bayesian networks, Evol. Comput., 2000, vol. 8, no. 3, pp. 311\u2013340. \u00a0https:\/\/doi.org\/10.1162\/106365600750078808","journal-title":"Evol. Comput."},{"key":"7414_CR13","doi-asserted-by":"publisher","unstructured":"Doerr, B. and Krejca, M.S., Significance-based estimation-of-distribution algorithms, in Proc. Genetic and Evolutionary Computation Conf., Kyoto, 2018, Aguirre, H., Ed., New York: Association for Computing Machinery, 2018, pp. 1483\u20131490. \u00a0https:\/\/doi.org\/10.1145\/3205455.3205553","DOI":"10.1145\/3205455.3205553"},{"key":"7414_CR14","volume-title":"Essentials of Metaheuristics.","author":"S. Luke","year":"2009","unstructured":"Luke, S., Essentials of Metaheuristics. Lulu, 2009."},{"key":"7414_CR15","doi-asserted-by":"publisher","unstructured":"Orlov, A., Kureichik, V., Glushchenko, A., and Kureichik, V., Jr., Hybrid genetic algorithm for cutting stock and packaging problems, in IEEE East-West Design & Test Symp. (EWDTS), Yerevan, 2016, IEEE, 2016, pp. 1\u20134.\u00a0https:\/\/doi.org\/10.1109\/EWDTS.2016.7807680","DOI":"10.1109\/EWDTS.2016.7807680"},{"key":"7414_CR16","doi-asserted-by":"publisher","unstructured":"Gladkov, L.A., Gladkova, N.V., and Gromov, S.A., Hybrid models of solving optimization tasks on the basis of integrating evolutionary design and multiagent technologies, Artificial Intelligence Methods in Intelligent Algorithms. CSOC 2019, Silhavy, R., Ed., Advances in Intelligent Systems and Computing, vol. 985, Cham: Springer, 2019, pp. 381\u2013391. \u00a0https:\/\/doi.org\/10.1007\/978-3-030-19810-7_38","DOI":"10.1007\/978-3-030-19810-7_38"},{"key":"7414_CR17","doi-asserted-by":"publisher","unstructured":"Kuliev, E.V., Dukkardt, A.N., Kureychik, V.V., and Legebokov, A.A., Neighborhood research approach in swarm intelligence for solving the optimization problems, Proc. IEEE East-West Design & Test Symp., Kiev, 2014, IEEE, 2014, pp. 1\u20134. \u00a0https:\/\/doi.org\/10.1109\/EWDTS.2014.7027084","DOI":"10.1109\/EWDTS.2014.7027084"},{"key":"7414_CR18","doi-asserted-by":"publisher","unstructured":"Kuliev, E.V., Kureichik, V.Vl., and Kursitys, I.O., Decision making in VLSI components placement problem based on grey wolf optimization, Proc. IEEE East-West Design & Test Symp. (EWDTS), Batumi, Georgia, 2019, IEEE, 2019, pp. 1\u20134. \u00a0https:\/\/doi.org\/10.1109\/EWDTS.2019.8884371","DOI":"10.1109\/EWDTS.2019.8884371"},{"key":"7414_CR19","doi-asserted-by":"publisher","unstructured":"Kureichik, V., Kureichik, V., Jr., and Zaruba, D.V., Combined approach to place electronic computing equipment circuit elements, Proc. IEEE East-West Design & Test Symp. (EWDTS), Batumi, Georgia, 2015, IEEE, 2015, pp. 1\u20135. \u00a0https:\/\/doi.org\/10.1109\/EWDTS.2015.7493134","DOI":"10.1109\/EWDTS.2015.7493134"},{"key":"7414_CR20","doi-asserted-by":"publisher","unstructured":"Gladkov, L.A., Gladkova, N.V., and Leiba, S.N., Electronic computing equipment schemes elements placement based on hybrid intelligence approach, Intelligent Systems in Cybernetics and Automation Theory. CSOC 2015, Silhavy, R., Senkerik, R., Oplatkova, Z., Prokopova, Z., and Silhavy, P., Eds., Advances in Intelligent Systems and Computing, vol. 348, Cham: Springer, 2015, pp. 35\u201344. \u00a0https:\/\/doi.org\/10.1007\/978-3-319-18503-3_4","DOI":"10.1007\/978-3-319-18503-3_4"},{"key":"7414_CR21","doi-asserted-by":"publisher","unstructured":"Semenkina, M., Parallel version of self-configuring genetic algorithm application in spacecra. control system design, Proc. 15th Ann. Conf. Companion on Genetic and Evolutionary Computation, Amsterdam, 2013, Blum, C., Ed., New York: Association for Computing Machinery, 2013, pp.\u00a01751\u20131752. https:\/\/doi.org\/10.1145\/2464576.2480793","DOI":"10.1145\/2464576.2480793"},{"key":"7414_CR22","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1134\/S0005117916030097","volume":"77","author":"D.S. Chivilikhin","year":"2016","unstructured":"Chivilikhin, D.S., Ulyantsev, V.I., and Shalyto, A.A., Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas, Autom. Remote Control, 2016, vol. 77, no. 3, pp.\u00a0473\u2013484. \u00a0https:\/\/doi.org\/10.1134\/S0005117916030097","journal-title":"Autom. Remote Control"},{"key":"7414_CR23","doi-asserted-by":"publisher","unstructured":"Fonseca, C.M. and Fleming, P.J., Nonlinear system identification with multiobjective genetic algorithm, IFAC Proc. Vol., 1996, vol. 29, no. 1, pp. 1169\u20131174. \u00a0https:\/\/doi.org\/10.1016\/S1474-6670(17)57823-4","DOI":"10.1016\/S1474-6670(17)57823-4"},{"key":"7414_CR24","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1134\/S106423071402004X","volume":"53","author":"I.P. Buzhinsky","year":"2014","unstructured":"Buzhinsky, I.P., Ulyantsev, V.I., Chivilikhin, D.S., and Shalyto, A.A., Inducing finite state machines from training samples using ant colony optimization, J. Comput. Syst. Sci. Int., 2014, vol. 53, no. 2, pp. 256\u2013266. \u00a0https:\/\/doi.org\/10.1134\/S106423071402004X","journal-title":"J. Comput. Syst. Sci. Int."},{"key":"7414_CR25","unstructured":"Chivilikhin, D., Ulyantsev, V., and Shalyto, A., Extended finite-state machine inference with parallel ant colony based algorithms, Proc. Student Workshop on Bioinspired Optimization Methods and Their Applications, BIOMA 2014, Ljubljana, \n               2014, 2014, pp. 117\u2013126."},{"key":"7414_CR26","doi-asserted-by":"publisher","unstructured":"Chivilikhin, D., Ulyantsev, V., and Shalyto, A., Combining exact and metaheuristic techniques for learning extended finite state machines from test scenarios and temporal properties, 13th Int. Conf. on Machine Learning and Applications, Detroit, 2014, IEEE, 2014, pp. 350\u2013355. \u00a0https:\/\/doi.org\/10.1109\/ICMLA.2014.62","DOI":"10.1109\/ICMLA.2014.62"},{"key":"7414_CR27","doi-asserted-by":"publisher","unstructured":"Buzhinsky, I., Ulyantsev, V., Tsarev, F., and Shalyto, A., Search-based construction of finite-state machines with real-valued actions: New representation model, Proc. 15th Ann. Conf. Companion on Genetic and Evolutionary Computation, Amsterdam, 2013, Blum, C., Ed., New York: Association for Computing Machinery, 2013, pp. 199\u2013200. \u00a0https:\/\/doi.org\/10.1145\/2464576.2464678","DOI":"10.1145\/2464576.2464678"},{"key":"7414_CR28","doi-asserted-by":"publisher","unstructured":"El-Khatib, S., Skobtsov, Yu., and Rodzin, S., Improved particle swarm medical image segmentation algorithm for decision making, Intelligent Distributed Computing XIII. IDC 2019, Kotenko, I., Badica, C., Desnitsky, V., El\u00a0Baz, D., and Ivanovic, M., Eds., Studies in Computational Intelligence, vol. 868, Cham: Springer, 2019, pp.\u00a0437\u2013442. \u00a0https:\/\/doi.org\/10.1007\/978-3-030-32258-8_51","DOI":"10.1007\/978-3-030-32258-8_51"},{"key":"7414_CR29","series-title":"Genetic algorithm with optimal recombination for the asymmetric travelling salesman problem","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73441-5_36","volume-title":"Large-Scale Scientific Computing. LSSC 2017","author":"A.V. Eremeev","year":"2017","unstructured":"Eremeev, A.V. and Kovalenko, Yu.V., Genetic algorithm with optimal recombination for the asymmetric travelling salesman problem, in Large-Scale Scientific Computing. LSSC 2017, Lirkov, I. and Margenov, S., Eds., Lecture Notes in Computer Science, vol. 10665, Cham: Springer, 2017, pp. 341\u2013349. \u00a0https:\/\/doi.org\/10.1007\/978-3-319-73441-5_36"},{"key":"7414_CR30","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s12293-019-00291-4","volume":"12","author":"A.V. Eremeev","year":"2020","unstructured":"Eremeev, A.V. and Kovalenko, Yu.V., A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem, Memetic Comput., 2020, vol. 12, no. 1, pp.\u00a023\u201336. \u00a0https:\/\/doi.org\/10.1007\/s12293-019-00291-4","journal-title":"Memetic Comput."},{"key":"7414_CR31","doi-asserted-by":"publisher","unstructured":"Sanches, D., Whitley, D., and Tin\u00f3s, R., Improving an exact solver for the traveling salesman problem using partition crossover, Proc. Genetic and Evolutionary Computation Conference, Berlin, 2017, New York: Association for Computing Machinery, 2017, pp. 337\u2013344. \u00a0https:\/\/doi.org\/10.1145\/3071178.3071304","DOI":"10.1145\/3071178.3071304"},{"key":"7414_CR32","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1162\/EVCO_a_00184","volume":"24","author":"L.D. Whitley","year":"2016","unstructured":"Whitley, L.D., Chicano, F., and Goldman, B.W., Gray box optimization for Mk landscapes (NK landscapes and MAX-kSAT), Evol. Comput., 2016, vol. 24, no. 3, pp. 491\u2013519. \u00a0https:\/\/doi.org\/10.1162\/EVCO_a_00184","journal-title":"Evol. Comput."},{"key":"7414_CR33","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.apenergy.2014.12.020","volume":"141","author":"A. Gloti\u0107","year":"2015","unstructured":"Gloti\u0107, A. and Zamuda, A., Short-term combined economic and emission hydrothermal optimization by surrogate differential evolution, Appl. Energy, 2015, vol. 141, pp. 42\u201356. \u00a0https:\/\/doi.org\/10.1016\/j.apenergy.2014.12.020","journal-title":"Appl. Energy"},{"key":"7414_CR34","doi-asserted-by":"publisher","first-page":"3683","DOI":"10.1016\/j.asoc.2012.05.023","volume":"12","author":"T.W. Liao","year":"2012","unstructured":"Liao, T.W., Egbelu, P.J., and Chang, P.C., Two hybrid differential evolution algorithms for optimal inbound and outbound truck sequencing in cross docking operations, Appl. Soft Comput., 2012, vol. 12, no. 11, pp. 3683\u20133697. \u00a0https:\/\/doi.org\/10.1016\/j.asoc.2012.05.023","journal-title":"Appl. Soft Comput."},{"key":"7414_CR35","doi-asserted-by":"publisher","unstructured":"Feoktistov, V., Pietravalle, S., and Heslot, N., Optimal experimental design of field trials using differential evolution, IEEE Congress on Evolutionary Computation (CEC), Donostia, Spain, 2017, IEEE, 2017, pp. 1690\u20131696. \u00a0https:\/\/doi.org\/10.1109\/CEC.2017.7969505","DOI":"10.1109\/CEC.2017.7969505"},{"key":"7414_CR36","doi-asserted-by":"crossref","unstructured":"B\u00e4ck, T., Fogel, D.B., and Michalewicz, Z., Evolutionary Computation 1: Basic Algorithms and Operators, Inst. of Physics Publishing, 2000.","DOI":"10.1201\/9781420034349"},{"key":"7414_CR37","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TSMC.1986.289288","volume":"16","author":"J.J. Grefenstette","year":"1986","unstructured":"Grefenstette, J.J., Optimization of control parameters for genetic algorithms, IEEE Trans. Syst., Man, Cybern., 1986, vol. 16, pp. 122\u2013128. \u00a0https:\/\/doi.org\/10.1109\/TSMC.1986.289288","journal-title":"IEEE Trans. Syst., Man, Cybern."},{"key":"7414_CR38","series-title":"How genetic algorithms really work: Mutation and hillclimbing","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN II","author":"H. M\u00fchlenbein","year":"1992","unstructured":"M\u00fchlenbein, H., How genetic algorithms really work: Mutation and hillclimbing, in Parallel Problem Solving from Nature \u2013 PPSN II, Elsevier, 1992, pp. 15\u201326."},{"key":"7414_CR39","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"\u00c1.E. Eiben","year":"1999","unstructured":"Eiben, \u00c1.E., Hinterding, R., and Michalewicz, Z., Parameter control in evolutionary algorithms, IEEE Trans. Evol. Comput., 1999, vol. 3, no. 2, pp. 124\u2013141. \u00a0https:\/\/doi.org\/10.1109\/4235.771166","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7414_CR40","doi-asserted-by":"publisher","unstructured":"Stanovov, V., Akhmedova, S., Semenkin, E., and Semenkina, M., Generalized Lehmer mean for success history based adaptive differential evolution, IJCCI 2019\u2014Proc. 11th Int. Joint Conf. on Computational Intelligence, Vienna,\u00a02019, 2019, pp. 93\u2013100. \u00a0https:\/\/doi.org\/10.5220\/0008163600930100","DOI":"10.5220\/0008163600930100"},{"key":"7414_CR41","doi-asserted-by":"publisher","unstructured":"Stanovov, V., Akhmedova, S., and Semenkin, E., LSHADE algorithm with rank-based selective pressure strategy for solving CEC 2017 benchmark problems, IEEE Congress on Evolutionary Computation (CEC), Rio de Janeiro, 2018, IEEE, 2018, pp. 1\u20138. \u00a0https:\/\/doi.org\/10.1109\/CEC.2018.8477977","DOI":"10.1109\/CEC.2018.8477977"},{"key":"7414_CR42","doi-asserted-by":"publisher","unstructured":"Semenkina, M. and Semenkin, E., Memetic self-configuring genetic programming for solving machine learning problems, IIAI 4th Int. Congress on Advanced Applied Informatics, Okayama, Japan, 2015, IEEE, 2015, pp.\u00a0599\u2013604. \u00a0https:\/\/doi.org\/10.1109\/IIAI-AAI.2015.290","DOI":"10.1109\/IIAI-AAI.2015.290"},{"key":"7414_CR43","doi-asserted-by":"publisher","unstructured":"Semenkina, M., Akhmedova, S., Brester, C., and Semenkin, E., Choice of spacecraft control contour variant with self-configuring stochastic algorithms of multi-criteria optimization, Proc. 13th Int. Conf. on Informatics Control, Automation and Robotics, Lisbon, 2016, Gusikhin, O., Peaucelle, D., and Madani, K., Eds., New York: Association for Computing Machinery, 2016, pp. 281\u2013286. \u00a0https:\/\/doi.org\/10.5220\/0006009502810286","DOI":"10.5220\/0006009502810286"},{"key":"7414_CR44","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1515\/jaiscr-2016-0013","volume":"6","author":"V. Stanovov","year":"2016","unstructured":"Stanovov, V., Semenkin, E., and Semenkina, O., Self-configuring hybrid evolutionary algorithm for fuzzy imbalanced classification with adaptive instance selection, J. Artif. Intell. Soft Comput. Res., 2016, vol. 6, no. 3, pp.\u00a0173\u2013188. \u00a0https:\/\/doi.org\/10.1515\/jaiscr-2016-0013","journal-title":"J. Artif. Intell. Soft Comput. Res."},{"key":"7414_CR45","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N. Hansen","year":"2001","unstructured":"Hansen, N. and Ostermeier, A., Completely derandomized self-adaptation in evolution strategies, Evol. Comput., 2001, vol. 9, no. 2, pp. 159\u2013195. \u00a0https:\/\/doi.org\/10.1162\/106365601750190398","journal-title":"Evol. Comput."},{"key":"7414_CR46","doi-asserted-by":"publisher","unstructured":"Tanabe, R. and Fukunaga, A., Success-history based parameter adaptation for differential evolution, IEEE Congress on Evolutionary Computation, Cancun, Mexico, 2013, IEEE, 2013, pp. 71\u201378. \u00a0https:\/\/doi.org\/10.1109\/CEC.2013.6557555","DOI":"10.1109\/CEC.2013.6557555"},{"key":"7414_CR47","doi-asserted-by":"publisher","unstructured":"Viktorin, A., Senkerik, R., Pluhacek, M., Kadavy, T., and Zamuda, A., Distance based parameter adaptation for success-history based differential evolution, Swarm and Evolutionary Computation, vol. 50, 2019. https:\/\/doi.org\/10.1016\/j.swevo.2018.10.013","DOI":"10.1016\/j.swevo.2018.10.013"},{"key":"7414_CR48","doi-asserted-by":"publisher","unstructured":"Dang, N. and Doerr, C., Hyper-parameter tuning for the (1 + (\u03bb, \u03bb)) GA, Proc. of Genetic and Evolutionary Computation Conference, Prague, 2019, L\u00f3pez-Ib\u00e1\u00f1ez, M., Ed., New York: Association for Computing Machinery, 2019, pp. 889\u2013897. \u00a0https:\/\/doi.org\/10.1145\/3321707.3321725","DOI":"10.1145\/3321707.3321725"},{"key":"7414_CR49","series-title":"Tuning an algorithm using design of experiments","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02538-9_11","volume-title":"Experimental Methods for the Analysis of Optimization Algorithms","author":"E. Ridge","year":"2010","unstructured":"Ridge, E. and Kudenko, D., Tuning an algorithm using design of experiments, in Experimental Methods for the Analysis of Optimization Algorithms, Bartz-Beielstein, T., Chiarandini, M., Paquete, L., and Preuss, M., Eds., Berlin: Springer, 2010, pp. 265\u2013286. \u00a0https:\/\/doi.org\/10.1007\/978-3-642-02538-9_11"},{"key":"7414_CR50","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., C\u00e1ceres, L.P., Birattari, M., and St\u00fctzle, T., The irace package: Iterated racing for automatic algorithm configuration, Oper. Res. Perspect., 2016, vol. 3, pp. 43\u201358. \u00a0https:\/\/doi.org\/10.1016\/j.orp.2016.09.002","journal-title":"Oper. Res. Perspect."},{"key":"7414_CR51","series-title":"Sequential model-based optimization for general algorithm configuration","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization. LION 2011","author":"F. Hutter","year":"2011","unstructured":"Hutter, F. Hoos, H.H., and Leyton-Brown, K., Sequential model-based optimization for general algorithm configuration, in Learning and Intelligent Optimization. LION 2011, Coello Coello, C.A., Ed., Lecture Notes in Computer Science, vol. 6683, Berlin: Springer, 2011, pp. 507\u2013523. \u00a0https:\/\/doi.org\/10.1007\/978-3-642-25566-3_40"},{"key":"7414_CR52","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F. Hutter","year":"2009","unstructured":"Hutter, F. Hoos, H.H., and Leyton-Brown, K., and St\u00fctzle, T., ParamILS: An automatic algorithm configuration framework, J. Artif. Intell. Res., 2009, vol. 36, pp. 267\u2013306. \u00a0https:\/\/doi.org\/10.1613\/jair.2861","journal-title":"J. Artif. Intell. Res."},{"key":"7414_CR53","doi-asserted-by":"publisher","unstructured":"Wegener, I., Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions, in Evolutionary Optimization, Sarker, R., Mohammadian, M., and Yao, X., Eds., International Series in Operations Research & Management Science, vol. 48, Boston: Springer, 2003, pp. 349\u2013369. \u00a0https:\/\/doi.org\/10.1007\/0-306-48041-7_14","DOI":"10.1007\/0-306-48041-7_14"},{"key":"7414_CR54","doi-asserted-by":"publisher","DOI":"10.1142\/7438","volume-title":"Theory of Randomized Search Heuristics: Foundations and Recent Developments","author":"A. Auger","year":"2011","unstructured":"Auger, A. and Doerr, B., Theory of Randomized Search Heuristics: Foundations and Recent Developments, River Edge, N.J.: World Scientific Publishing, 2011."},{"key":"7414_CR55","series-title":"Natural Computing Series","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":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, Doerr, B. and Neumann, F., Eds., Natural Computing Series, Cham: Springer, 2020. \u00a0https:\/\/doi.org\/10.1007\/978-3-030-29414-4"},{"key":"7414_CR56","series-title":"Estimation of the evolution speed for the quasispecies model: Arbitrary alphabet case","doi-asserted-by":"publisher","DOI":"10.1007\/11785231_49","volume-title":"Artificial Intelligence and Soft Computing \u2013 ICAISC 2006","author":"V. Red\u2019ko","year":"2006","unstructured":"Red\u2019ko, V. and Tsoy, Yu., Estimation of the evolution speed for the quasispecies model: Arbitrary alphabet case, in Artificial Intelligence and Soft Computing \u2013 ICAISC 2006, Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., and \u017burada, J.M., Eds., Lecture Notes in Computer Science, vol. 4029, Berlin: Springer, 2006, pp. 460\u2013469. \u00a0https:\/\/doi.org\/10.1007\/11785231_49"},{"key":"7414_CR57","series-title":"Investigation of evolving populations of adaptive agents","doi-asserted-by":"publisher","DOI":"10.1007\/11550822_53","volume-title":"Artificial Neural Networks: Biological Inspirations \u2013 ICANN 2005","author":"V.G. Red\u2019ko","year":"2005","unstructured":"Red\u2019ko, V.G., Mosalov, O.P., and Prokhorov, D.V., Investigation of evolving populations of adaptive agents, in Artificial Neural Networks: Biological Inspirations \u2013 ICANN 2005, Duch, W., Kacprzyk, J., Oja, E., and Zadro\u017cny, S., Eds., Lecture Notes in Computer Science, vol.\u00a03696, Springer, 2005, pp. 337\u2013342. \u00a0https:\/\/doi.org\/10.1007\/11550822_53"},{"key":"7414_CR58","doi-asserted-by":"publisher","first-page":"279","DOI":"10.3233\/INF-1998-9302","volume":"9","author":"A. Antamoshkin","year":"1998","unstructured":"Antamoshkin, A. and Semenkin, E., Local search efficiency when optimizing unimodal pseudoboolean functions, Informatica, 1998, vol. 9, no. 3, pp. 279\u2013296. \u00a0https:\/\/doi.org\/10.3233\/INF-1998-9302","journal-title":"Informatica"},{"key":"7414_CR59","first-page":"432","volume":"26","author":"A.N. Antamoshkin","year":"1990","unstructured":"Antamoshkin, A.N., Saraev, V.N., and Semenkin, E.S., Optimization of unimodal monotone pseudoboolean functions, Kybernetika, 1990, vol. 26, no. 5, pp. 432\u2013442.","journal-title":"Kybernetika"},{"key":"7414_CR60","doi-asserted-by":"publisher","unstructured":"Rodzin, S. and Rodzina, L., Theory of bionic optimization and its application to evolutionary synthesis of digital devices, Proc. of IEEE East-West Design & Test Symp. (EWDTS), Kiev, 2014, IEEE, 2014, pp. 1\u20135. \u00a0https:\/\/doi.org\/10.1109\/EWDTS.2014.7027058","DOI":"10.1109\/EWDTS.2014.7027058"},{"key":"7414_CR61","doi-asserted-by":"publisher","unstructured":"El-Khatib, S., Skobtsov, Yu., Rodzin, S., and Potryasaev, S., Theoretical and experimental evaluation of PSO-K-Means algorithm for MRI images segmentation using drift theorem, in Artificial Intelligence Methods in Intelligent Algorithms. CSOC 2019, Silhavy, R., Ed., Advances in Intelligent Systems and Computing, vol. 985, Cham: Springer, 2019, pp. 316\u2013323. \u00a0https:\/\/doi.org\/10.1007\/978-3-030-19810-7_31","DOI":"10.1007\/978-3-030-19810-7_31"},{"key":"7414_CR62","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.tcs.2008.03.008","volume":"403","author":"P.A. Borisovsky","year":"2008","unstructured":"Borisovsky, P.A. and Eremeev, A.V., Comparing evolutionary algorithms to the (1+1)-EA, Theor. Comput. Sci., 2008, vol. 403, no. 1, pp. 33\u201341. https:\/\/doi.org\/10.1016\/j.tcs.2008.03.008","journal-title":"Theor. Comput. Sci."},{"key":"7414_CR63","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., and Lehre, P.K., Level-based analysis of genetic algorithms and other search processes, IEEE Trans. Evol. Comput., 2018, vol. 22, no. 5, pp. 707\u2013719. \u00a0https:\/\/doi.org\/10.1109\/TEVC.2017.2753538","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7414_CR64","series-title":"On non-elitist evolutionary algorithms optimizing fitness functions with a plateau","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-49988-4_23","volume-title":"Mathematical Optimization Theory and Operations Research. MOTOR 2020","author":"A.V. Eremeev","year":"2020","unstructured":"Eremeev, A.V., On non-elitist evolutionary algorithms optimizing fitness functions with a plateau, in Mathematical Optimization Theory and Operations Research. MOTOR 2020, Kononov, A., Khachay, M., Kalyagin, V., and Pardalos, P., Eds., Lecture Notes in Computer Science, vol. 12095, Cham: Springer, 2020, pp. 329\u2013342. \u00a0https:\/\/doi.org\/10.1007\/978-3-030-49988-4_23"},{"key":"7414_CR65","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1162\/evco_a_00210","volume":"26","author":"A.V. Eremeev","year":"2018","unstructured":"Eremeev, A.V., On proportions of fit individuals in population of mutation-based evolutionary algorithm with tournament selection, Evol. Comput., 2018, vol. 26, no. 2, pp. 269\u2013297. \u00a0https:\/\/doi.org\/10.1162\/evco_a_00210","journal-title":"Evol. Comput."},{"key":"7414_CR66","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2014.11.028","volume":"567","author":"B. Doerr","year":"2015","unstructured":"Doerr, B., Doerr, C., and Ebel, F., From black-box complexity to designing new genetic algorithms, Theor. Comput. Sci., 2015, vol. 567, pp. 87\u2013104. \u00a0https:\/\/doi.org\/10.1016\/j.tcs.2014.11.028","journal-title":"Theor. Comput. Sci."},{"key":"7414_CR67","doi-asserted-by":"publisher","unstructured":"Doerr, B., Doerr, C., and Ebel, F., Lessons from the black-box: Fast crossover-based genetic algorithms, Proc. 15th Ann. Conf. Genetic and Evolutionary Computation Conference, Amsterdam, 2013, Blum, C., Ed., New York: Association for Computing Machinery, 2013, pp. 781\u2013788. \u00a0https:\/\/doi.org\/10.1145\/2463372.2463480","DOI":"10.1145\/2463372.2463480"},{"key":"7414_CR68","doi-asserted-by":"publisher","first-page":"1658","DOI":"10.1007\/s00453-017-0354-9","volume":"80","author":"B. Doerr","year":"2018","unstructured":"Doerr, B. and Doerr, C., Optimal static and self-adjusting parameter choices for the (1 + (\u03bb, \u03bb)) genetic algorithm, Algorithmica, 2018, vol. 80, no. 5, pp. 1658\u20131709. \u00a0https:\/\/doi.org\/10.1007\/s00453-017-0354-9","journal-title":"Algorithmica"},{"key":"7414_CR69","doi-asserted-by":"publisher","unstructured":"Doerr, B. and Doerr, C., Optimal parameter choices through self-adjustment: Applying the 1\/5-th rule in discrete settings, Proc. 2015 Ann. Conf. Genetic and Evolutionary Computation, Madrid, 2015, Silva, S., Ed., New York: Association for Computing Machinery, 2015, pp. 1335\u20131342. \u00a0https:\/\/doi.org\/10.1145\/2739480.2754684","DOI":"10.1145\/2739480.2754684"},{"key":"7414_CR70","doi-asserted-by":"publisher","unstructured":"Antipov, D., Buzdalov, M., and Doerr, B., Fast mutation in crossover-based algorithms, Proc. 2020 Genetic and Evolutionary Computation Conference, Canc\u00fan, Mexico, 2020, New York: Association for Computing Machinery, 2020, pp. 1268\u20131276. \u00a0https:\/\/doi.org\/10.1145\/3377930.3390172","DOI":"10.1145\/3377930.3390172"},{"key":"7414_CR71","doi-asserted-by":"publisher","unstructured":"Goldman, B.W. and Punch, W.F., Parameter-less population pyramid, Proc. 2014 Ann. Conf. on Genetic and Evolutionary Computation, Vancouver, 2014, Igel, C., Ed., New York: Association for Computing Machinery, 2014, pp. 785\u2013792. \u00a0https:\/\/doi.org\/10.1145\/2576768.2598350","DOI":"10.1145\/2576768.2598350"},{"key":"7414_CR72","doi-asserted-by":"publisher","unstructured":"Buzdalov, M. and Doerr, B., Runtime analysis of the (1 + (\u03bb, \u03bb)) genetic algorithm on random satisfiable 3\u2011CNF formulas, Proc. Genetic and Evolutionary Computation Conference, Berlin, 2017, New York: Association for Computing Machinery, 2017, pp. 1343\u20131350. \u00a0https:\/\/doi.org\/10.1145\/3071178.3071297","DOI":"10.1145\/3071178.3071297"},{"key":"7414_CR73","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.eswa.2017.11.047","volume":"96","author":"A.H. Gandomi","year":"2018","unstructured":"Gandomi, A.H. and Goldman, B.W., Parameter-less population pyramid for large-scale tower optimization, Expert Syst. Appl., 2018, vol. 96, pp. 175\u2013184. \u00a0https:\/\/doi.org\/10.1016\/j.eswa.2017.11.047","journal-title":"Expert Syst. Appl."},{"key":"7414_CR74","doi-asserted-by":"publisher","unstructured":"Mironovich, V. and Buzdalov, M., Hard test generation for maximum flow algorithms with the fast crossover-based evolutionary algorithm, Proc. Companion Publication of the 2015 Ann. Conf. on Genetic and Evolutionary Computation, Madrid, 2015, Silva, S. Ed., New York: Association for Computing Machinery, 2015, pp. 1229\u20131232. \u00a0https:\/\/doi.org\/10.1145\/2739482.2768487","DOI":"10.1145\/2739482.2768487"},{"key":"7414_CR75","doi-asserted-by":"publisher","unstructured":"Hevia Fajardo, M.A. and Sudholt, D., On the choice of the parameter control mechanism in the (1 + (\u03bb, \u03bb)) genetic algorithm, Proc. Genetic and Evolutionary Computation Conference, Canc\u00fan, Mexico, 2020, New York: Association for Computing Machinery, 2020, pp. 832\u2013840. \u00a0https:\/\/doi.org\/10.1145\/3377930.3390200","DOI":"10.1145\/3377930.3390200"},{"key":"7414_CR76","doi-asserted-by":"publisher","unstructured":"Bassin, A. and Buzdalov, M., The 1\/5-th rule with rollbacks: On self-adjustment of the population size in the (1 + (\u03bb, \u03bb)) GA, Proc. Genetic and Evolutionary Computation Conference Companion, Prague, 2019, L\u00f3pez-Ib\u00e1\u00f1ez, M., Ed., New York: Association for Computing Machinery, 2019, pp.\u00a0277\u2013278. \u00a0https:\/\/doi.org\/10.1145\/3319619.3322067","DOI":"10.1145\/3319619.3322067"},{"key":"7414_CR77","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, New York: W. H. Freeman & Co., 1979."},{"key":"7414_CR78","unstructured":"Mitchell, D., Selman, B., and Levesque, H., Hard and easy distributions of SAT problems, Proc. AAAI Conference on Artificial Intelligence, 1992, pp. 459\u2013465."},{"key":"7414_CR79","series-title":"Runtime analysis of evolutionary algorithms on randomly constructed high-density satisfiable 3-CNF formulas","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10762-2_93","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII. PPSN 2014","author":"A.M. Sutton","year":"2014","unstructured":"Sutton, A.M. and Neumann, F., Runtime analysis of evolutionary algorithms on randomly constructed high-density satisfiable 3-CNF formulas,  Parallel Problem Solving from Nature \u2013 PPSN XIII. PPSN 2014, Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., and Smith, J., Eds., Lecture Notes in Computer Science, vol. 8672, Cham: Springer, 2014, pp. 942\u2013951. \u00a0https:\/\/doi.org\/10.1007\/978-3-319-10762-2_93"},{"key":"7414_CR80","doi-asserted-by":"publisher","unstructured":"B. Doerr, F. Neumann, and A. M. Sutton, Improved runtime bounds for the (1+1) EA on random 3-CNF formulas based on fitness-distance correlation, Proc. 2015 Ann. Conf. on Genetic and Evolutionary Computation, Madrid, 2015, Silva, S., Ed., New York: Association for Computing Machinery, 2015, pp. 1415\u20131422. \u00a0https:\/\/doi.org\/10.1145\/2739480.2754659","DOI":"10.1145\/2739480.2754659"},{"key":"7414_CR81","doi-asserted-by":"publisher","unstructured":"Doerr, B. and Doerr, C., A tight runtime analysis of the (1 + (\u03bb, \u03bb)) genetic algorithm on OneMax, Proc. 2015 Ann. Conf. on Genetic and Evolutionary Computation, Madrid, 2015, New York: Association for Computing Machinery, 2015, pp. 1423\u20131430. \u00a0https:\/\/doi.org\/10.1145\/2739480.2754683","DOI":"10.1145\/2739480.2754683"},{"key":"7414_CR82","unstructured":"Pinto, E.C. and Doerr, C., Towards a more practice-aware runtime analysis of evolutionary algorithms, 2018. arXiv:1812.00493 [cs.NE]"},{"key":"7414_CR83","series-title":"A simple proof for the usefulness of crossover in black-box optimization","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99259-4_3","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV. PPSN 2018","author":"E.C. Pinto","year":"2018","unstructured":"Pinto, E.C. and Doerr, C., A simple proof for the usefulness of crossover in black-box optimization,  Parallel Problem Solving from Nature \u2013 PPSN XV. PPSN 2018, Auger, A., Fonseca, C., Louren\u00e7o, N., Machado, P., Paquete, L., and Whitley, D., Eds., Lecture Notes in Computer Science, vol. 11102, Cham: Springer: 2018, pp.\u00a029\u201341. \u00a0https:\/\/doi.org\/10.1007\/978-3-319-99259-4_3"},{"key":"7414_CR84","doi-asserted-by":"publisher","unstructured":"Doerr, B., Optimal parameter settings for the (1 + (\u03bb, \u03bb)) genetic algorithm, Proc. Genetic and Evolutionary Computation Conference, Denver, Colo., 2016, Friedrich, T., Ed., New York: Association for Computing Machinery, 2016, pp. 1107\u20131114. \u00a0https:\/\/doi.org\/10.1145\/2908812.2908885","DOI":"10.1145\/2908812.2908885"}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411621070208.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411621070208","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411621070208.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:01:33Z","timestamp":1773612093000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411621070208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":84,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["7414"],"URL":"https:\/\/doi.org\/10.3103\/s0146411621070208","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12]]},"assertion":[{"value":"22 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}