{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T13:37:34Z","timestamp":1778852254392,"version":"3.51.4"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T00:00:00Z","timestamp":1766361600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T00:00:00Z","timestamp":1766361600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.52375268, 52342505, 72401239"],"award-info":[{"award-number":["No.52375268, 52342505, 72401239"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Foundation for Humanities, Social Sciences of Ministry of Education of China","award":["No. 23YJA630139"],"award-info":[{"award-number":["No. 23YJA630139"]}]},{"DOI":"10.13039\/501100003787","name":"Natural Science Foundation of Hebei Province","doi-asserted-by":"publisher","award":["No. E2024105031"],"award-info":[{"award-number":["No. E2024105031"]}],"id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012542","name":"Sichuan Provincial Science and Technology Support Program","doi-asserted-by":"publisher","award":["No. 2025ZNSFSC0425, 2024NSFSC1048, 2024ZHCG0059"],"award-info":[{"award-number":["No. 2025ZNSFSC0425, 2024NSFSC1048, 2024ZHCG0059"]}],"id":[{"id":"10.13039\/100012542","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-08150-5","type":"journal-article","created":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T21:34:18Z","timestamp":1766439258000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning-based hyper-heuristic algorithm for space-free multi-row facility layout problem"],"prefix":"10.1007","volume":"82","author":[{"given":"Zongxing","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeqiang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junqi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,22]]},"reference":[{"key":"8150_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jii.2020.100187","volume":"21","author":"SQD Al-Zubaidi","year":"2021","unstructured":"Al-Zubaidi SQD, Fantoni G, Failli F (2021) Analysis of drivers for solving facility layout problems: a literature review. J Ind Inf Integr 21:100187. https:\/\/doi.org\/10.1016\/j.jii.2020.100187","journal-title":"J Ind Inf Integr"},{"key":"8150_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2017.01.049","volume":"261","author":"MF Anjos","year":"2017","unstructured":"Anjos MF, Vieira MVC (2017) Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions. Eur J Oper Res 261:1\u201316. https:\/\/doi.org\/10.1016\/j.ejor.2017.01.049","journal-title":"Eur J Oper Res"},{"key":"8150_CR3","doi-asserted-by":"publisher","first-page":"2215","DOI":"10.1007\/s00170-013-4820-5","volume":"68","author":"S Emami","year":"2013","unstructured":"Emami S, S. Nookabadi A (2013) Managing a new multi-objective model for the dynamic facility layout problem. Int J Adv Manuf Technol 68:2215\u20132228. https:\/\/doi.org\/10.1007\/s00170-013-4820-5","journal-title":"Int J Adv Manuf Technol"},{"key":"8150_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108118","volume":"168","author":"J Liu","year":"2022","unstructured":"Liu J, Zhang Z, Gong J et al (2022) A novel hybrid clonal selection algorithm for the corridor allocation problem with irregular material handling positions. Comput Ind Eng 168:108118. https:\/\/doi.org\/10.1016\/j.cie.2022.108118","journal-title":"Comput Ind Eng"},{"key":"8150_CR5","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1007\/s00170-015-7290-0","volume":"81","author":"MH Salmani","year":"2015","unstructured":"Salmani MH, Eshghi K, Neghabi H (2015) A bi-objective MIP model for facility layout problem in uncertain environment. Int J Adv Manuf Technol 81:1563\u20131575. https:\/\/doi.org\/10.1007\/s00170-015-7290-0","journal-title":"Int J Adv Manuf Technol"},{"key":"8150_CR6","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1007\/s10845-020-01603-z","volume":"32","author":"M Besbes","year":"2021","unstructured":"Besbes M, Zolghadri M, Costa Affonso R et al (2021) 3D facility layout problem. J Intell Manuf 32:1065\u20131090. https:\/\/doi.org\/10.1007\/s10845-020-01603-z","journal-title":"J Intell Manuf"},{"issue":"9","key":"8150_CR7","doi-asserted-by":"publisher","first-page":"1851","DOI":"10.1007\/s00170-014-6565-1","volume":"77","author":"M Saravanan","year":"2015","unstructured":"Saravanan M, Kumar SG (2015) Design and optimisation of loop layout problems flexible manufacturing system using sheep flock heredity algorithm. Int J Adv Manuf Technol 77(9):1851\u20131866. https:\/\/doi.org\/10.1007\/s00170-014-6565-1","journal-title":"Int J Adv Manuf Technol"},{"key":"8150_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108725","volume":"121","author":"X Wan","year":"2022","unstructured":"Wan X, Zuo X, Zhao X (2022) A differential evolution algorithm combined with linear programming for solving a closed loop facility layout problem. Appl Soft Comput 121:108725. https:\/\/doi.org\/10.1016\/j.asoc.2022.108725","journal-title":"Appl Soft Comput"},{"key":"8150_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110716","volume":"146","author":"Z Wang","year":"2023","unstructured":"Wang Z, Xu C (2023) A thin-provisioned and functionalized memetic algorithm for the single row facility layout problem. Appl Soft Comput 146:110716. https:\/\/doi.org\/10.1016\/j.asoc.2023.110716","journal-title":"Appl Soft Comput"},{"key":"8150_CR10","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1080\/00207543.2020.1847342","volume":"60","author":"X Wan","year":"2022","unstructured":"Wan X, Zuo X, Li X, Zhao X (2022) A hybrid multiobjective GRASP for a multi-row facility layout problem with extra clearances. Int J Prod Res 60:957\u2013976. https:\/\/doi.org\/10.1080\/00207543.2020.1847342","journal-title":"Int J Prod Res"},{"key":"8150_CR11","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1109\/TASE.2018.2866377","volume":"16","author":"X Zuo","year":"2019","unstructured":"Zuo X, Gao S, Zhou M et al (2019) A Three-Stage Approach to a Multirow Parallel Machine Layout Problem. IEEE Trans Autom Sci Eng 16:433\u2013447. https:\/\/doi.org\/10.1109\/TASE.2018.2866377","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"8150_CR12","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1080\/0951192X.2017.1314013","volume":"30","author":"A Tubaileh","year":"2017","unstructured":"Tubaileh A, Siam J (2017) Single and multi-row layout design for flexible manufacturing systems. Int J Comput Integr Manuf 30:1316\u20131330. https:\/\/doi.org\/10.1080\/0951192X.2017.1314013","journal-title":"Int J Comput Integr Manuf"},{"key":"8150_CR13","doi-asserted-by":"publisher","first-page":"3201","DOI":"10.1007\/s12652-018-1037-3","volume":"10","author":"B Hu","year":"2019","unstructured":"Hu B, Yang B (2019) A particle swarm optimization algorithm for multi-row facility layout problem in semiconductor fabrication. J Ambient Intell Humaniz Comput 10:3201\u20133210. https:\/\/doi.org\/10.1007\/s12652-018-1037-3","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"8150_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115184","volume":"182","author":"NR Uribe","year":"2021","unstructured":"Uribe NR, Herr\u00e1n A, Colmenar JM, Duarte A (2021) An improved GRASP method for the multiple row equal facility layout problem. Expert Syst Appl 182:115184. https:\/\/doi.org\/10.1016\/j.eswa.2021.115184","journal-title":"Expert Syst Appl"},{"key":"8150_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.111897","volume":"163","author":"N R. Uribe","year":"2024","unstructured":"R. Uribe N, Herr\u00e1n A, Colmenar JM (2024) A GRASP method for the bi-objective multiple row equal facility layout problem. Appl Soft Comput 163:111897. https:\/\/doi.org\/10.1016\/j.asoc.2024.111897","journal-title":"Appl Soft Comput"},{"key":"8150_CR16","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s12532-019-00162-6","volume":"11","author":"A Fischer","year":"2019","unstructured":"Fischer A, Fischer F, Hungerl\u00e4nder P (2019) New exact approaches to row layout problems. Math Program Comput 11:703\u2013754. https:\/\/doi.org\/10.1007\/s12532-019-00162-6","journal-title":"Math Program Comput"},{"key":"8150_CR17","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.jmsy.2021.08.013","volume":"61","author":"S Liu","year":"2021","unstructured":"Liu S, Zhang Z, Guan C et al (2021) Mathematical formulation and a new metaheuristic for the constrained double-floor corridor allocation problem. J Manuf Syst 61:155\u2013170. https:\/\/doi.org\/10.1016\/j.jmsy.2021.08.013","journal-title":"J Manuf Syst"},{"key":"8150_CR18","doi-asserted-by":"publisher","first-page":"3325","DOI":"10.1016\/j.cor.2012.04.016","volume":"39","author":"ARS Amaral","year":"2012","unstructured":"Amaral ARS (2012) The corridor allocation problem. Comput Oper Res 39:3325\u20133330. https:\/\/doi.org\/10.1016\/j.cor.2012.04.016","journal-title":"Comput Oper Res"},{"key":"8150_CR19","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ejor.2013.07.010","volume":"232","author":"H Ahonen","year":"2014","unstructured":"Ahonen H, De Alvarenga AG, Amaral ARS (2014) Simulated annealing and tabu search approaches for the Corridor Allocation Problem. Eur J Oper Res 232:221\u2013233. https:\/\/doi.org\/10.1016\/j.ejor.2013.07.010","journal-title":"Eur J Oper Res"},{"key":"8150_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.cor.2014.07.008","volume":"52","author":"Z Kalita","year":"2014","unstructured":"Kalita Z, Datta D (2014) Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm. Comput Oper Res 52:123\u2013134. https:\/\/doi.org\/10.1016\/j.cor.2014.07.008","journal-title":"Comput Oper Res"},{"key":"8150_CR21","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00500-019-03925-4","volume":"24","author":"Z Zhang","year":"2020","unstructured":"Zhang Z, Mao L, Guan C et al (2020) An improved scatter search algorithm for the corridor allocation problem considering corridor width. Soft Comput 24:461\u2013481. https:\/\/doi.org\/10.1007\/s00500-019-03925-4","journal-title":"Soft Comput"},{"key":"8150_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2023.101977","volume":"56","author":"J Liu","year":"2023","unstructured":"Liu J, Zhang Z, Liu S et al (2023) Parallel hyper heuristic algorithm based on reinforcement learning for the corridor allocation problem and parallel row ordering problem. Adv Eng Inform 56:101977. https:\/\/doi.org\/10.1016\/j.aei.2023.101977","journal-title":"Adv Eng Inform"},{"key":"8150_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118804","volume":"212","author":"ED Durmaz","year":"2023","unstructured":"Durmaz ED, \u015eahin R (2023) An efficient iterated local search algorithm for the corridor allocation problem. Expert Syst Appl 212:118804. https:\/\/doi.org\/10.1016\/j.eswa.2022.118804","journal-title":"Expert Syst Appl"},{"key":"8150_CR24","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1016\/j.ejor.2021.03.027","volume":"295","author":"A Herr\u00e1n","year":"2021","unstructured":"Herr\u00e1n A, Manuel Colmenar J, Duarte A (2021) An efficient variable neighborhood search for the Space-Free Multi-Row Facility Layout problem. Eur J Oper Res 295:893\u2013907. https:\/\/doi.org\/10.1016\/j.ejor.2021.03.027","journal-title":"Eur J Oper Res"},{"key":"8150_CR25","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.ejor.2024.03.012","volume":"316","author":"S Wu","year":"2024","unstructured":"Wu S, Yang W, Hanafi S et al (2024) Iterated local search with ejection chains for the space-free multi-row facility layout problem. Eur J Oper Res 316:873\u2013886. https:\/\/doi.org\/10.1016\/j.ejor.2024.03.012","journal-title":"Eur J Oper Res"},{"key":"8150_CR26","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-96271-9_3","volume-title":"Simulation Science","author":"U Bracht","year":"2018","unstructured":"Bracht U, Dahlbeck M, Fischer A, Kr\u00fcger T (2018) Combining Simulation and Optimization for Extended Double Row Facility Layout Problems in Factory Planning. In: Baum M, Brenner G, Grabowski J et al (eds) Simulation Science. Springer International Publishing, Cham, pp 39\u201359"},{"key":"8150_CR27","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1287\/opre.24.4.595","volume":"24","author":"AM Geoffrion","year":"1976","unstructured":"Geoffrion AM, Graves GW (1976) Scheduling parallel production lines with changeover costs: practical application of a quadratic assignment\/LP approach. Oper Res 24:595\u2013610. https:\/\/doi.org\/10.1287\/opre.24.4.595","journal-title":"Oper Res"},{"key":"8150_CR28","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-30113-4_12","volume-title":"Software and Compilers for Embedded Systems","author":"B Wess","year":"2004","unstructured":"Wess B, Zeitlhofer T (2004) On the Phase Coupling Problem Between Data Memory Layout Generation and Address Pointer Assignment. In: Schepers H (ed) Software and Compilers for Embedded Systems. Springer, Berlin Heidelberg, Berlin, Heidelberg, pp 152\u2013166"},{"key":"8150_CR29","doi-asserted-by":"publisher","first-page":"1841","DOI":"10.1007\/s00170-015-7715-9","volume":"84","author":"K Mallikarjuna","year":"2016","unstructured":"Mallikarjuna K, Veeranna V, Reddy KH (2016) A new meta-heuristics for optimum design of loop layout in flexible manufacturing system with integrated scheduling. Int J Adv Manuf Technol 84:1841\u20131860. https:\/\/doi.org\/10.1007\/s00170-015-7715-9","journal-title":"Int J Adv Manuf Technol"},{"key":"8150_CR30","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00170-013-5564-y","volume":"72","author":"J Nematian","year":"2014","unstructured":"Nematian J (2014) A robust single row facility layout problem with fuzzy random variables. Int J Adv Manuf Technol 72:255\u2013267. https:\/\/doi.org\/10.1007\/s00170-013-5564-y","journal-title":"Int J Adv Manuf Technol"},{"key":"8150_CR31","doi-asserted-by":"publisher","first-page":"4151","DOI":"10.1007\/s00521-023-09261-x","volume":"36","author":"E Ba\u015f","year":"2024","unstructured":"Ba\u015f E, Yildizdan G (2024) A new binary arithmetic optimization algorithm for uncapacitated facility location problem. Neural Comput Appl 36:4151\u20134177. https:\/\/doi.org\/10.1007\/s00521-023-09261-x","journal-title":"Neural Comput Appl"},{"key":"8150_CR32","doi-asserted-by":"publisher","first-page":"2173","DOI":"10.1007\/s00170-018-2370-6","volume":"98","author":"Z Kalita","year":"2018","unstructured":"Kalita Z, Datta D (2018) A constrained single-row facility layout problem. Int J Adv Manuf Technol 98:2173\u20132184. https:\/\/doi.org\/10.1007\/s00170-018-2370-6","journal-title":"Int J Adv Manuf Technol"},{"key":"8150_CR33","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s11227-024-06799-y","volume":"81","author":"M Shang","year":"2025","unstructured":"Shang M, Tian M, Wang X (2025) GA-DE: an integrated meta-heuristic approach for optimizing feedforward neural networks. J Supercomput 81:339. https:\/\/doi.org\/10.1007\/s11227-024-06799-y","journal-title":"J Supercomput"},{"key":"8150_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.106030","volume":"149","author":"A Muffak","year":"2023","unstructured":"Muffak A, Arslan O (2023) A benders decomposition algorithm for the maximum availability service facility location problem. Comput Oper Res 149:106030. https:\/\/doi.org\/10.1016\/j.cor.2022.106030","journal-title":"Comput Oper Res"},{"key":"8150_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2022.102379","volume":"78","author":"C Guan","year":"2022","unstructured":"Guan C, Zhang Z, Zhu L, Liu S (2022) Mathematical formulation and a hybrid evolution algorithm for solving an extended row facility layout problem of a dynamic manufacturing system. Robot Comput-Integr Manuf 78:102379. https:\/\/doi.org\/10.1016\/j.rcim.2022.102379","journal-title":"Robot Comput-Integr Manuf"},{"key":"8150_CR36","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke EK, Gendreau M, Hyde M et al (2013) Hyper-heuristics: a survey of the state of the art. J Oper Res Soc 64:1695\u20131724. https:\/\/doi.org\/10.1057\/jors.2013.71","journal-title":"J Oper Res Soc"},{"issue":"1","key":"8150_CR37","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"EK Burke","year":"2007","unstructured":"Burke EK, McCollum B, Meisels A, Petrovic S, Qu R (2007) A graph-based hyper-heuristic for educational timetabling problems. Eur J Oper Res 176(1):177\u2013192","journal-title":"Eur J Oper Res"},{"key":"8150_CR38","doi-asserted-by":"publisher","first-page":"27269","DOI":"10.1007\/s10489-023-04983-w","volume":"53","author":"E Chappidi","year":"2023","unstructured":"Chappidi E, Singh A (2023) A hyper-heuristic based approach with naive Bayes classifier for the reliability p-median problem. Appl Intell 53:27269\u201327289. https:\/\/doi.org\/10.1007\/s10489-023-04983-w","journal-title":"Appl Intell"},{"key":"8150_CR39","doi-asserted-by":"publisher","first-page":"6865","DOI":"10.1007\/s10489-024-05532-9","volume":"54","author":"B Cheng","year":"2024","unstructured":"Cheng B, Wang L, Tan Q, Zhou M (2024) A deep reinforcement learning hyper-heuristic to solve order batching problem with mobile robots. Appl Intell 54:6865\u20136887. https:\/\/doi.org\/10.1007\/s10489-024-05532-9","journal-title":"Appl Intell"},{"key":"8150_CR40","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/s11227-024-06771-w","volume":"81","author":"S Xu","year":"2025","unstructured":"Xu S, Huang Z, Bi W, Zhang A (2025) A monte Carlo hyper-heuristic algorithm with low-level heuristics reward prediction for missile path planning. J Supercomput 81:374. https:\/\/doi.org\/10.1007\/s11227-024-06771-w","journal-title":"J Supercomput"},{"key":"8150_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110695","volume":"146","author":"Z-Q Zhang","year":"2023","unstructured":"Zhang Z-Q, Qian B, Hu R, Yang J-B (2023) Q-learning-based hyper-heuristic evolutionary algorithm for the distributed assembly blocking flowshop scheduling problem. Appl Soft Comput 146:110695. https:\/\/doi.org\/10.1016\/j.asoc.2023.110695","journal-title":"Appl Soft Comput"},{"key":"8150_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110815","volume":"147","author":"F Zhao","year":"2023","unstructured":"Zhao F, Liu Y, Zhu N et al (2023) A selection hyper-heuristic algorithm with Q-learning mechanism. Appl Soft Comput 147:110815. https:\/\/doi.org\/10.1016\/j.asoc.2023.110815","journal-title":"Appl Soft Comput"},{"key":"8150_CR43","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10489-024-05995-w","volume":"55","author":"E Chappidi","year":"2025","unstructured":"Chappidi E, Singh A (2025) Solution of reliable p-median problem with at-facility service using multi-start hyper-heuristic approaches. Appl Intell 55:435. https:\/\/doi.org\/10.1007\/s10489-024-05995-w","journal-title":"Appl Intell"},{"key":"8150_CR44","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10479-010-0782-2","volume":"196","author":"EK Burke","year":"2012","unstructured":"Burke EK, Kendall G, M\u0131s\u0131r M, \u00d6zcan E (2012) Monte Carlo hyper-heuristics for examination timetabling. Ann Oper Res 196:73\u201390. https:\/\/doi.org\/10.1007\/s10479-010-0782-2","journal-title":"Ann Oper Res"},{"key":"8150_CR45","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.jmsy.2021.05.012","volume":"60","author":"S Zhang","year":"2021","unstructured":"Zhang S, Xu Y, Zhang W (2021) Multitask-oriented manufacturing service composition in an uncertain environment using a hyper-heuristic algorithm. J Manuf Syst 60:138\u2013151. https:\/\/doi.org\/10.1016\/j.jmsy.2021.05.012","journal-title":"J Manuf Syst"},{"key":"8150_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107099","volume":"225","author":"L Zhu","year":"2021","unstructured":"Zhu L, Lin J, Li Y-Y, Wang Z-J (2021) A decomposition-based multi-objective genetic programming hyper-heuristic approach for the multi-skill resource constrained project scheduling problem. Knowl-Based Syst 225:107099. https:\/\/doi.org\/10.1016\/j.knosys.2021.107099","journal-title":"Knowl-Based Syst"},{"key":"8150_CR47","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.105954","volume":"121","author":"C Shang","year":"2023","unstructured":"Shang C, Ma L, Liu Y (2023) Green location routing problem with flexible multi-compartment for source-separated waste: a Q-learning and multi-strategy-based hyper-heuristic algorithm. Eng Appl Artif Intell 121:105954. https:\/\/doi.org\/10.1016\/j.engappai.2023.105954","journal-title":"Eng Appl Artif Intell"},{"key":"8150_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110628","volume":"146","author":"F Yan","year":"2023","unstructured":"Yan F, Di K (2023) Solving the multi-robot task allocation with functional tasks based on a hyper-heuristic algorithm. Appl Soft Comput 146:110628. https:\/\/doi.org\/10.1016\/j.asoc.2023.110628","journal-title":"Appl Soft Comput"},{"key":"8150_CR49","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/s10489-023-05185-0","volume":"54","author":"W Xia","year":"2024","unstructured":"Xia W, Hongwei G, Mingde Z et al (2024) Stochastic online decisioning hyper-heuristic for high dimensional optimization. Appl Intell 54:544\u2013564. https:\/\/doi.org\/10.1007\/s10489-023-05185-0","journal-title":"Appl Intell"},{"key":"8150_CR50","doi-asserted-by":"publisher","first-page":"12186","DOI":"10.1007\/s11227-024-05909-0","volume":"80","author":"R Zhong","year":"2024","unstructured":"Zhong R, Zhang E, Munetomo M (2024) Evolutionary multi-mode slime mold optimization: a hyper-heuristic algorithm inspired by slime mold foraging behaviors. J Supercomput 80:12186\u201312217. https:\/\/doi.org\/10.1007\/s11227-024-05909-0","journal-title":"J Supercomput"},{"key":"8150_CR51","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/s11227-024-06862-8","volume":"81","author":"R Zhong","year":"2025","unstructured":"Zhong R, Zhang S, Yu J, Munetomo M (2025) HHDE: a hyper-heuristic differential evolution with novel boundary repair technique for complex optimization. J Supercomput 81:696. https:\/\/doi.org\/10.1007\/s11227-024-06862-8","journal-title":"J Supercomput"},{"key":"8150_CR52","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-540-77345-0_25","volume-title":"Practice and Theory of Automated Timetabling VI","author":"B Bilgin","year":"2007","unstructured":"Bilgin B, \u00d6zcan E, Korkmaz EE (2007) An Experimental Study on Hyper-heuristics and Exam Timetabling. In: Burke EK, Rudov\u00e1 H (eds) Practice and Theory of Automated Timetabling VI. Springer, Berlin Heidelberg, Berlin, Heidelberg, pp 394\u2013412"},{"key":"8150_CR53","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ins.2018.01.005","volume":"436","author":"SS Choong","year":"2018","unstructured":"Choong SS, Wong L-P, Lim CP (2018) Automatic design of hyper-heuristic based on reinforcement learning. Inf Sci 436:89\u2013107. https:\/\/doi.org\/10.1016\/j.ins.2018.01.005","journal-title":"Inf Sci"},{"key":"8150_CR54","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1016\/j.ins.2016.09.010","volume":"373","author":"S Asta","year":"2016","unstructured":"Asta S, Karapetyan D, Kheiri A et al (2016) Combining monte-carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem. Inf Sci 373:476\u2013498. https:\/\/doi.org\/10.1016\/j.ins.2016.09.010","journal-title":"Inf Sci"},{"key":"8150_CR55","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-44629-X_11","volume-title":"Practice and Theory of Automated Timetabling III","author":"P Cowling","year":"2001","unstructured":"Cowling P, Kendall G, Soubeiga E (2001) A Hyperheuristic Approach to Scheduling a Sales Summit. In: Burke E, Erben W (eds) Practice and Theory of Automated Timetabling III. Springer, Berlin Heidelberg, Berlin, Heidelberg, pp 176\u2013190"},{"key":"8150_CR56","unstructured":"Ayob M, Kendall G (2003) A Monte Carlo Hyper-Heuristic to Optimise Component Placement Sequencing for Multi Head Placement Machine. Proc Int Conf Intell Technol"},{"key":"8150_CR57","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2022.101700","volume":"53","author":"Z Zhang","year":"2022","unstructured":"Zhang Z, Gong J, Liu J, Chen F (2022) A fast two-stage hybrid meta-heuristic algorithm for robust corridor allocation problem. Adv Eng Inform 53:101700. https:\/\/doi.org\/10.1016\/j.aei.2022.101700","journal-title":"Adv Eng Inform"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-08150-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-08150-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-08150-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T21:34:19Z","timestamp":1766439259000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-08150-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,22]]},"references-count":57,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1]]}},"alternative-id":["8150"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-08150-5","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,22]]},"assertion":[{"value":"24 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2025","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 declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"17"}}