{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T08:43:15Z","timestamp":1766306595923,"version":"3.48.0"},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:00:00Z","timestamp":1759190400000},"content-version":"vor","delay-in-days":272,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1016\/j.procs.2025.09.574","type":"journal-article","created":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T22:13:24Z","timestamp":1762467204000},"page":"4487-4494","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Bandit Recombination: The Preliminary Study of a Novel Genetic Algorithm Operator"],"prefix":"10.1016","volume":"270","author":[{"given":"Arkadiusz","family":"Nowakowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Wieczorek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Str\u0105k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2025.09.574_bib1","doi-asserted-by":"crossref","unstructured":"Bushra Alhijawi and Arafat Awajan. Genetic algorithms: Theory, genetic operators, solutions, and applications. Evolutionary Intelligence, 17(3):1245\u20131256, 2024.","DOI":"10.1007\/s12065-023-00822-6"},{"key":"10.1016\/j.procs.2025.09.574_bib2","doi-asserted-by":"crossref","unstructured":"Jany Belluz, Marco Gaudesi, Giovanni Squillero, and Alberto Tonda. Operator selection using improved dynamic multi-armed bandit. In Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, pages 1311\u20131317, 2015.","DOI":"10.1145\/2739480.2754712"},{"issue":"6973","key":"10.1016\/j.procs.2025.09.574_bib3","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1136\/bmj.310.6973.170","article-title":"Multiple significance tests: the bonferroni method","volume":"310","author":"Bland","year":"1995","journal-title":"Bmj"},{"key":"10.1016\/j.procs.2025.09.574_bib4","unstructured":"Giuseppe Burtini, Jason Loeppky, and Ramon Lawrence. A survey of online experiment design with the stochastic multi-armed bandit. arXiv preprint arXiv:1510.00757, 2015."},{"key":"10.1016\/j.procs.2025.09.574_bib5","doi-asserted-by":"crossref","unstructured":"Paul C Chu and John E Beasley. A genetic algorithm for the generalised assignment problem. Computers & Operations Research, 24(1):17\u201323, 1997.","DOI":"10.1016\/S0305-0548(96)00032-9"},{"issue":"3","key":"10.1016\/j.procs.2025.09.574_bib6","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1037\/0033-2909.114.3.494","article-title":"Dominance statistics: Ordinal analyses to answer ordinal questions","volume":"114","author":"Cliff","year":"1993","journal-title":"Psychological bulletin"},{"key":"10.1016\/j.procs.2025.09.574_bib7","unstructured":"J. Cohen. Statistical Power Analysis for the Behavioral Sciences. Lawrence Erlbaum Associates, 1988."},{"key":"10.1016\/j.procs.2025.09.574_bib8","doi-asserted-by":"crossref","unstructured":"Luis DaCosta, Alvaro Fialho, Marc Schoenauer, and Mich\u00e8le Sebag. Adaptive operator selection with dynamic multi-armed bandits. In Proceedings of the 10th annual conference on Genetic and evolutionary computation, pages 913\u2013920, 2008.","DOI":"10.1145\/1389095.1389272"},{"key":"10.1016\/j.procs.2025.09.574_bib9","doi-asserted-by":"crossref","unstructured":"Agoston E Eiben, P-E Raue, and Zs Ruttkay. Genetic algorithms with multi-parent recombination. In International conference on parallel problem solving from nature, pages 78\u201387. Springer, 1994.","DOI":"10.1007\/3-540-58484-6_252"},{"key":"10.1016\/j.procs.2025.09.574_bib10","doi-asserted-by":"crossref","unstructured":"Michel Gendreau, Jean-Yves Potvin, et al. Handbook of metaheuristics, volume 2. Springer, 2010.","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"10.1016\/j.procs.2025.09.574_bib11","unstructured":"Teofilo F Gonzalez. Handbook of approximation algorithms and metaheuristics. Chapman and Hall\/CRC, 2007."},{"key":"10.1016\/j.procs.2025.09.574_bib12","doi-asserted-by":"crossref","unstructured":"Mark Hauschild and Martin Pelikan. An introduction and survey of estimation of distribution algorithms. Swarm and evolutionary computation, 1(3):111\u2013128, 2011.","DOI":"10.1016\/j.swevo.2011.08.003"},{"key":"10.1016\/j.procs.2025.09.574_bib13","doi-asserted-by":"crossref","unstructured":"Kamolwan Kunanusont, Raluca D Gaina, Jialin Liu, Diego Perez-Liebana, and Simon M Lucas. The n-tuple bandit evolutionary algorithm for automatic game improvement. In 2017 IEEE Congress on Evolutionary Computation (CEC), pages 2201\u20132208. IEEE, 2017.","DOI":"10.1109\/CEC.2017.7969571"},{"key":"10.1016\/j.procs.2025.09.574_bib14","unstructured":"Deniz Preil and Michael Krapp. Genetic multi-armed bandits: a reinforcement learning approach for discrete optimization via simulation. arXiv preprint arXiv:2302.07695, 2023."},{"key":"10.1016\/j.procs.2025.09.574_bib15","unstructured":"Jeanine Romano, Jeffrey D Kromrey, Jesse Coraggio, and Jeff Skowronek. Appropriate statistics for ordinal level data: Should we really be using t-test and cohen\u2019sd for evaluating group differences on the nsse and other surveys. In Annual meeting of the Florida Association of Institutional Research, 2006."},{"issue":"2","key":"10.1016\/j.procs.2025.09.574_bib16","doi-asserted-by":"crossref","first-page":"26","DOI":"10.22237\/jmasm\/1257035100","article-title":"New effect size rules of thumb","volume":"8","author":"Sawilowsky","year":"2009","journal-title":"Journal of modern applied statistical methods"},{"key":"10.1016\/j.procs.2025.09.574_bib17","doi-asserted-by":"crossref","unstructured":"Ta Bao Thang, Huynh Thi Thanh Binh, et al. Multi-armed bandits for many-task evolutionary optimization. In 2021 IEEE Congress on Evolutionary Computation (CEC), pages 1664\u20131671. IEEE, 2021.","DOI":"10.1109\/CEC45853.2021.9504691"},{"key":"10.1016\/j.procs.2025.09.574_bib18","unstructured":"Hui Yuan, Chengzhuo Ni, Huazheng Wang, Xuezhou Zhang, Le Cong, Csaba Szepesv\u00e1ri, and Mengdi Wang. Bandit theory and thompson sampling-guided directed evolution for sequence optimization. Advances in Neural Information Processing Systems, 35:38291\u201338304, 2022."},{"key":"10.1016\/j.procs.2025.09.574_bib19","unstructured":"Rui Zhong, Enzhi Zhang, and Masaharu Munetomo. Accelerating the evolutionary algorithms by gaussian process regression with \u03f5-greedy acquisition function. arXiv e-prints, pages arXiv\u20132210, 2022."}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050925032478?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050925032478?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T08:38:40Z","timestamp":1766306320000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050925032478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":19,"alternative-id":["S1877050925032478"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2025.09.574","relation":{},"ISSN":["1877-0509"],"issn-type":[{"type":"print","value":"1877-0509"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bandit Recombination: The Preliminary Study of a Novel Genetic Algorithm Operator","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2025.09.574","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}