{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T14:36:53Z","timestamp":1768315013383,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T00:00:00Z","timestamp":1752019200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T00:00:00Z","timestamp":1752019200000},"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":["Appl Intell"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10489-025-06687-9","type":"journal-article","created":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T09:47:52Z","timestamp":1752140872000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Runtime analysis of adaptive selection variation operators in evolutionary algorithm with reinforcement learning"],"prefix":"10.1007","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-3232-6183","authenticated-orcid":false,"given":"Yang","family":"Tianyi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhou","family":"Yuren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,9]]},"reference":[{"key":"6687_CR1","doi-asserted-by":"crossref","unstructured":"Zhou Z, Yu Y, Qian C (2019) Evolutionary learning: Advances in theories and algorithms. Springer","DOI":"10.1007\/978-981-13-5956-9"},{"key":"6687_CR2","unstructured":"Sutton RS, Barto AG (2018) Reinforcement learning: An introduction. MIT press"},{"key":"6687_CR3","unstructured":"Khadka S, Tumer K (2018) Evolution-guided policy gradient in reinforcement learning. In: Proceedings of the 32nd international conference on neural information processing systems, pp 1196\u20131208"},{"key":"6687_CR4","doi-asserted-by":"crossref","unstructured":"Bodnar C, Day B, Li\u00f3 P (2020) Proximal distilled evolutionary reinforcement learning. In: Proceedings of the AAAI conference on artificial intelligence, pp 3283\u20133290","DOI":"10.1609\/aaai.v34i04.5728"},{"key":"6687_CR5","unstructured":"Majumdar S, Khadka S, Miret S, Mcaleer S, Tumer K (2020) Evolutionary reinforcement learning for sample-efficient multiagent coordination. In: International conference on machine learning, pp 6651\u20136660"},{"key":"6687_CR6","doi-asserted-by":"crossref","unstructured":"Shala G, Biedenkapp A, Awad N, Adriaensen S, Lindauer M, Hutter F (2020) Learning step-size adaptation in cma-es. In: International conference on parallel problem solving from nature, pp 691\u2013706","DOI":"10.1007\/978-3-030-58112-1_48"},{"issue":"4","key":"6687_CR7","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1109\/TEVC.2021.3060811","volume":"25","author":"J Sun","year":"2021","unstructured":"Sun J, Liu X, B\u00e4ck T, Xu Z (2021) Learning adaptive differential evolution algorithm from optimization experiences by policy gradient. IEEE Trans Evol Comput 25(4):666\u2013680","journal-title":"IEEE Trans Evol Comput"},{"key":"6687_CR8","doi-asserted-by":"publisher","first-page":"0025","DOI":"10.34133\/icomputing.0025","volume":"2","author":"H Bai","year":"2023","unstructured":"Bai H, Cheng R, Jin Y (2023) Evolutionary reinforcement learning: A survey. Intell Comput 2:0025","journal-title":"Intell Comput"},{"key":"6687_CR9","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.swevo.2018.03.011","volume":"44","author":"MM Drugan","year":"2019","unstructured":"Drugan MM (2019) Reinforcement learning versus evolutionary computation: A survey on hybrid algorithms. Swarm Evol Comput 44:228\u2013246","journal-title":"Swarm Evol Comput"},{"key":"6687_CR10","doi-asserted-by":"crossref","unstructured":"Sakurai Y, Takada K, Kawabe T, Tsuruta S (2010) A method to control parameters of evolutionary algorithms by using reinforcement learning. In: the 6th International conference on signal-image technology and internet based systems, pp 74\u201379","DOI":"10.1109\/SITIS.2010.22"},{"key":"6687_CR11","doi-asserted-by":"crossref","unstructured":"Buzdalova A, Kononov V, Buzdalov M (2014) Selecting evolutionary operators using reinforcement learning: initial explorations. In: Proceedings of the genetic and evolutionary computation conference companion, pp 1033\u20131036","DOI":"10.1145\/2598394.2605681"},{"key":"6687_CR12","doi-asserted-by":"crossref","unstructured":"K\u00f6ksal\u00a0Ahmed E, Li Z, Veeravalli B, Ren S (2020) Reinforcement learning-enabled genetic algorithm for school bus scheduling. J Intell Transp Syst 1\u201319","DOI":"10.1080\/15472450.2020.1852082"},{"issue":"6","key":"6687_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3459664","volume":"54","author":"E-G Talbi","year":"2021","unstructured":"Talbi E-G (2021) Machine learning into metaheuristics: A survey and taxonomy. ACM Comput Surv (CSUR) 54(6):1\u201332","journal-title":"ACM Comput Surv (CSUR)"},{"key":"6687_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101517","volume":"86","author":"Y Song","year":"2024","unstructured":"Song Y, Wu Y, Guo Y, Yan R, Suganthan PN, Zhang Y, Pedrycz W, Das S, Mallipeddi R, Ajani OS et al (2024) Reinforcement learning-assisted evolutionary algorithm: A survey and research opportunities. Swarm Evol Comput 86:101517","journal-title":"Swarm Evol Comput"},{"key":"6687_CR15","doi-asserted-by":"crossref","unstructured":"Pei J, Mei Y, Liu J, Zhang M, Yao X (2025) Adaptive operator selection for meta-heuristics: A survey. IEEE Trans Artif Intell","DOI":"10.1109\/TAI.2025.3545792"},{"key":"6687_CR16","doi-asserted-by":"publisher","first-page":"194045","DOI":"10.1109\/ACCESS.2020.3033593","volume":"8","author":"KM Sallam","year":"2020","unstructured":"Sallam KM, Elsayed SM, Chakrabortty RK, Ryan MJ (2020) Evolutionary framework with reinforcement learning-based mutation adaptation. IEEE Access 8:194045\u2013194071","journal-title":"IEEE Access"},{"key":"6687_CR17","doi-asserted-by":"crossref","unstructured":"Buzdalov M, Buzdalova A, Shalyto A (2013) A first step towards the runtime analysis of evolutionary algorithm adjusted with reinforcement learning. In: the 12th international conference on machine learning and applications, pp 203\u2013208","DOI":"10.1109\/ICMLA.2013.42"},{"key":"6687_CR18","doi-asserted-by":"crossref","unstructured":"Neumann F, Witt C (2010) Bioinspired computation in combinatorial optimization - algorithms and their computational complexity. Springer","DOI":"10.1007\/978-3-642-16544-3"},{"key":"6687_CR19","doi-asserted-by":"crossref","unstructured":"Buzdalov M, Buzdalova A (2015) Analysis of q-learning with random exploration for selection of auxiliary objectives in random local search. In: 2015 IEEE congress on evolutionary computation (CEC), pp 1776\u20131783","DOI":"10.1109\/CEC.2015.7257102"},{"key":"6687_CR20","doi-asserted-by":"crossref","unstructured":"Buzdalov M, Buzdalova A (2015) Can onemax help optimizing leadingones using the ea+ rl method? In: 2015 IEEE congress on evolutionary computation (CEC), pp 1762\u20131768","DOI":"10.1109\/CEC.2015.7257100"},{"key":"6687_CR21","doi-asserted-by":"crossref","unstructured":"Buzdalova A, Petrova I, Buzdalov M (2016) Runtime analysis of different approaches to select conflicting auxiliary objectives in the generalized onemax problem. In: 2016 IEEE symposium series on computational intelligence (SSCI), pp 1\u20137","DOI":"10.1109\/SSCI.2016.7850140"},{"key":"6687_CR22","unstructured":"Petrova I, Buzdalova A, Korneev G (2016) Runtime analysis of random local search with reinforcement based selection of non-stationary auxiliary objectives: initial study. In: Proceedings of the 22nd international conference on soft computing MENDEL, pp 95\u2013102"},{"key":"6687_CR23","doi-asserted-by":"crossref","unstructured":"Antipov D, Buzdalova A (2017) Runtime analysis of random local search on jump function with reinforcement based selection of auxiliary objectives. In: 2017 IEEE congress on evolutionary computation (CEC), pp 2169\u20132176","DOI":"10.1109\/CEC.2017.7969567"},{"key":"6687_CR24","doi-asserted-by":"crossref","unstructured":"Antipov D, Buzdalova A, Stankevich A (2018) Runtime analysis of a population-based evolutionary algorithm with auxiliary objectives selected by reinforcement learning. In: Proceedings of the genetic and evolutionary computation conference companion, pp 1886\u20131889","DOI":"10.1145\/3205651.3208231"},{"key":"6687_CR25","doi-asserted-by":"crossref","unstructured":"Guan X, Yang T, Zhao C, Zhou Y (2024) Feedback-based adaptive crossover-rate in evolutionary computation. In: 33rd International joint conference on artificial intelligence, IJCAI 2024. Int Joint Conf Artif Intell Org","DOI":"10.24963\/ijcai.2024\/765"},{"key":"6687_CR26","doi-asserted-by":"crossref","unstructured":"Jansen T (2013) Analyzing evolutionary algorithms: The computer science perspective. Springer","DOI":"10.1007\/978-3-642-17339-4"},{"issue":"3","key":"6687_CR27","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s11009-007-9047-1","volume":"10","author":"WJ Gutjahr","year":"2008","unstructured":"Gutjahr WJ, Sebastiani G (2008) Runtime analysis of ant colony optimization with best-so-far reinforcement. Methodol Comput Appl Probab 10(3):409\u2013433","journal-title":"Methodol Comput Appl Probab"},{"key":"6687_CR28","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ins.2017.10.038","volume":"426","author":"X Xia","year":"2018","unstructured":"Xia X, Zhou Y (2018) On the effectiveness of immune inspired mutation operators in some discrete optimization problems. Inf Sci 426:87\u2013100","journal-title":"Inf Sci"},{"key":"6687_CR29","doi-asserted-by":"crossref","unstructured":"Hevia\u00a0Fajardo MA, Sudholt D (2021) Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter. In: Proceedings of the genetic and evolutionary computation conference, pp 1151\u20131159","DOI":"10.1145\/3449639.3459338"},{"key":"6687_CR30","doi-asserted-by":"crossref","unstructured":"Kaufmann M, Larcher M, Lengler J, Zou X (2024) Onemax is not the easiest function for fitness improvements. Evol Comput 1\u201328","DOI":"10.1162\/evco_a_00348"},{"issue":"19","key":"6687_CR31","doi-asserted-by":"publisher","first-page":"14153","DOI":"10.1007\/s00521-023-08388-1","volume":"35","author":"X Lai","year":"2023","unstructured":"Lai X, Zhou Y (2023) Runtime analysis of some hybrid algorithms. Neural Comput Appl 35(19):14153\u201314167","journal-title":"Neural Comput Appl"},{"key":"6687_CR32","doi-asserted-by":"crossref","unstructured":"Doerr B, Le HP, Makhmara R, Nguyen TD (2017) Fast genetic algorithms. In: Proceedings of the genetic and evolutionary computation conference, pp 777\u2013784","DOI":"10.1145\/3071178.3071301"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06687-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-025-06687-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06687-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T15:57:44Z","timestamp":1758297464000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-025-06687-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,9]]},"references-count":32,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["6687"],"URL":"https:\/\/doi.org\/10.1007\/s10489-025-06687-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,9]]},"assertion":[{"value":"2 June 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"853"}}