{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,19]],"date-time":"2026-08-19T17:50:36Z","timestamp":1787161836503,"version":"build-2736575974"},"reference-count":33,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T00:00:00Z","timestamp":1642377600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>In the past two decades, metaheuristic optimisation algorithms (MOAs) have been increasingly popular, particularly in logistic, science, and engineering problems. The fundamental characteristics of such algorithms are that they are dependent on a parameter or a strategy. Some online and offline strategies are employed in order to obtain optimal configurations of the algorithms. Adaptive operator selection is one of them, and it determines whether or not to update a strategy from the strategy pool during the search process. In the field of machine learning, Reinforcement Learning (RL) refers to goal-oriented algorithms, which learn from the environment how to achieve a goal. On MOAs, reinforcement learning has been utilised to control the operator selection process. However, existing research fails to show that learned information may be transferred from one problem-solving procedure to another. The primary goal of the proposed research is to determine the impact of transfer learning on RL and MOAs. As a test problem, a set union knapsack problem with 30 separate benchmark problem instances is used. The results are statistically compared in depth. The learning process, according to the findings, improved the convergence speed while significantly reducing the CPU time.<\/jats:p>","DOI":"10.3390\/a15010024","type":"journal-article","created":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T08:20:42Z","timestamp":1642407642000},"page":"24","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Transfer Learning for Operator Selection: A Reinforcement Learning Approach"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6891-5851","authenticated-orcid":false,"given":"Rafet","family":"Durgut","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Bandirma Onyedi Eylul University, Bandirma 10200, Turkey"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4890-5648","authenticated-orcid":false,"given":"Mehmet Emin","family":"Aydin","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Creative Technologies, UWE Bristol, Bristol BS16 1QY, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5430-450X","authenticated-orcid":false,"given":"Abdur","family":"Rakib","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Creative Technologies, UWE Bristol, Bristol BS16 1QY, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2022,1,17]]},"reference":[{"key":"ref_1","unstructured":"Davis, L. (1989, January 4\u20137). Adapting operator probabilities in genetic algorithms. Proceedings of the Third International Conference on Genetic Algorithms, San Francisco, CA, USA."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/BF00116878","article-title":"Probability matching, the magnitude of reinforcement, and classifier system bidding","volume":"5","author":"Goldberg","year":"1990","journal-title":"Mach. Learn."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"107054","DOI":"10.1016\/j.asoc.2020.107054","article-title":"Adaptive binary artificial bee colony algorithm","volume":"101","author":"Durgut","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.ins.2021.10.025","article-title":"Adaptive operator selection with reinforcement learning","volume":"581","author":"Durgut","year":"2021","journal-title":"Inf. Sci."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Tan, C., Sun, F., Kong, T., Zhang, W., Yang, C., and Liu, C. (2018, January 4\u20137). A survey on deep transfer learning. Proceedings of the International Conference on Artificial Neural Networks, Rhodes, Greece.","DOI":"10.1007\/978-3-030-01424-7_27"},{"key":"ref_6","first-page":"108","article-title":"A comparative study of Artificial Bee Colony algorithm","volume":"214","author":"Karaboga","year":"2009","journal-title":"Appl. Math. Comput."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MCI.2006.329691","article-title":"Ant colony optimization","volume":"1","author":"Dorigo","year":"2006","journal-title":"IEEE Comput. Intell. Mag."},{"key":"ref_8","unstructured":"Kennedy, J., and Eberhart, R. (December, January 27). Particle swarm optimization. Proceedings of the ICNN\u201995-International Conference on Neural Networks, Perth, WA, Australia."},{"key":"ref_9","unstructured":"Sutton, R.S., and Barto, A.G. (2018). Reinforcement Learning, Second Edition: An Introduction: An Introduction, The MIT Press."},{"key":"ref_10","unstructured":"Sigaud, O., and Buffet, O. (2010). Markov Decision Processes in Artificial Intelligence, Wiley-IEEE Press."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/MSP.2017.2743240","article-title":"Deep reinforcement learning: A brief survey","volume":"34","author":"Arulkumaran","year":"2017","journal-title":"IEEE Signal Process. Mag."},{"key":"ref_12","unstructured":"Simon, D. (2013). Evolutionary Optimization Algorithms, John Wiley & Sons, Inc."},{"key":"ref_13","unstructured":"Verheul, J. (2020). The Influence of Using Adaptive Operator Selection in a Multiobjective Evolutionary Algorithm Based on Decomposition. [Master\u2019s Thesis, Utrecht University]."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1109\/TEVC.2013.2239648","article-title":"Adaptive Operator Selection With Bandits for a Multiobjective Evolutionary Algorithm Based on Decomposition","volume":"18","author":"Li","year":"2014","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Olivas, E.S., Guerrero, J.D.M., Martinez-Sober, M., Magdalena-Benedito, J.R., and L\u00f3pez, A.J.S. (2010). Transfer Learning. Handbook of Research on Machine Learning Applications and Trends: Algorithms, Methods, and Techniques, IGI Global. Chapter 11.","DOI":"10.4018\/978-1-60566-766-9"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1109\/TKDE.2009.191","article-title":"A Survey on Transfer Learning","volume":"22","author":"Pan","year":"2010","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.ins.2015.12.022","article-title":"Adaptive composite operator selection and parameter control for multiobjective evolutionary algorithm","volume":"339","author":"Lin","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","article-title":"MOEA\/D: A Multiobjective Evolutionary Algorithm Based on Decomposition","volume":"11","author":"Zhang","year":"2007","journal-title":"Trans. Evol. Comput."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Bischl, B., Mersmann, O., Trautmann, H., and Preu\u00df, M. (2012, January 7\u201311). Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, Philadelphia, PA, USA.","DOI":"10.1145\/2330163.2330209"},{"key":"ref_20","unstructured":"Hansen, N., Auger, A., Finck, S., and Ros, R. (2009). Real-Parameter Black-Box Optimization Benchmarking 2009: Experimental Setup, INRIA. Research Report RR-6828."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.ins.2017.08.028","article-title":"Landscape-based adaptive operator selection mechanism for differential evolution","volume":"418","author":"Sallam","year":"2017","journal-title":"Inf. Sci."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Handoko, S.D., Nguyen, D.T., Yuan, Z., and Lau, H.C. (2014). Reinforcement Learning for Adaptive Operator Selection in Memetic Search Applied to Quadratic Assignment Problem. GECCO Comp\u2019 14, Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation, Vancouver, BC, Canada, 12\u201316 July 2014, Association for Computing Machinery.","DOI":"10.1145\/2598394.2598451"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1467","DOI":"10.1051\/ro\/2019080","article-title":"A variable neighborhood search algorithm with reinforcement learning for a real-life periodic vehicle routing problem with time windows and open routes","volume":"54","author":"Chen","year":"2020","journal-title":"RAIRO-Oper. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0921-8890(00)00087-7","article-title":"Dynamic job-shop scheduling using reinforcement learning agents","volume":"33","author":"Aydin","year":"2000","journal-title":"Robot. Auton. Syst."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"2307","DOI":"10.3906\/elk-1203-104","article-title":"XOR-based artificial bee colony algorithm for binary optimization","volume":"21","author":"Kiran","year":"2013","journal-title":"Turk. J. Electr. Eng. Comput. Sci."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1631\/FITEE.2000239","article-title":"Improved binary artificial bee colony algorithm","volume":"22","author":"Durgut","year":"2021","journal-title":"Front. Inf. Technol. Electron. Eng."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.asoc.2011.08.038","article-title":"DisABC: A new artificial bee colony algorithm for binary optimization","volume":"12","author":"Kashan","year":"2012","journal-title":"Appl. Soft Comput."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1002\/1520-6750(199410)41:6<833::AID-NAV3220410611>3.0.CO;2-Q","article-title":"Note: On the set-union knapsack problem","volume":"41","author":"Goldschmidt","year":"1994","journal-title":"Naval Res. Logist. (NRL)"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1883","DOI":"10.1007\/s00500-019-04021-3","article-title":"Solving the set-union knapsack problem by a novel hybrid Jaya algorithm","volume":"24","author":"Wu","year":"2020","journal-title":"Soft Comput."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.future.2017.05.044","article-title":"A novel binary artificial bee colony algorithm for the set-union knapsack problem","volume":"78","author":"He","year":"2018","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1016\/j.future.2018.08.002","article-title":"A swarm intelligence-based algorithm for the set-union knapsack problem","volume":"93","author":"Ozsoydan","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.ins.2014.10.060","article-title":"A novel binary artificial bee colony algorithm based on genetic operators","volume":"297","author":"Ozturk","year":"2015","journal-title":"Inf. Sci."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Engelbrecht, A.P., and Pampara, G. (2007, January 25\u201328). Binary differential evolution strategies. Proceedings of the 2007 IEEE Congress on Evolutionary Computation, Singapore.","DOI":"10.1109\/CEC.2007.4424711"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/1\/24\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:02:19Z","timestamp":1760133739000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/1\/24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,17]]},"references-count":33,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,1]]}},"alternative-id":["a15010024"],"URL":"https:\/\/doi.org\/10.3390\/a15010024","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints202112.0337.v1","asserted-by":"object"}]},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,17]]}}}