{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T10:19:48Z","timestamp":1779272388058,"version":"3.51.4"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"21","license":[{"start":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T00:00:00Z","timestamp":1748908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T00:00:00Z","timestamp":1748908800000},"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"],"award-info":[{"award-number":["No. 52375268"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 52342505"],"award-info":[{"award-number":["No. 52342505"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72401239"],"award-info":[{"award-number":["72401239"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013139","name":"Humanities and Social Science Fund of Ministry of Education of China","doi-asserted-by":"publisher","award":["No. 23YJA630139"],"award-info":[{"award-number":["No. 23YJA630139"]}],"id":[{"id":"10.13039\/501100013139","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018542","name":"Natural Science Foundation of Sichuan Province","doi-asserted-by":"publisher","award":["No. 2024NSFSC1048"],"award-info":[{"award-number":["No. 2024NSFSC1048"]}],"id":[{"id":"10.13039\/501100018542","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018542","name":"Natural Science Foundation of Sichuan Province","doi-asserted-by":"publisher","award":["No. 2025ZNSFSC0425"],"award-info":[{"award-number":["No. 2025ZNSFSC0425"]}],"id":[{"id":"10.13039\/501100018542","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003787","name":"Natural Science Foundation of Hebei Province","doi-asserted-by":"publisher","award":["E2024105031"],"award-info":[{"award-number":["E2024105031"]}],"id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s00521-025-11370-8","type":"journal-article","created":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T13:11:33Z","timestamp":1748956293000},"page":"16575-16598","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A genetic-based hyper-heuristic optimisation method to solve the constrained multi-row facility layout problem"],"prefix":"10.1007","volume":"37","author":[{"given":"Zongxing","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8781-3618","authenticated-orcid":false,"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":"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,6,3]]},"reference":[{"key":"11370_CR1","doi-asserted-by":"publisher","first-page":"13075","DOI":"10.1007\/s00521-021-06002-w","volume":"33","author":"P Pirozmand","year":"2021","unstructured":"Pirozmand P, Hosseinabadi AAR, Farrokhzad M et al (2021) Multi-objective hybrid genetic algorithm for task scheduling problem in cloud computing. Neural Comput Appl 33:13075\u201313088. https:\/\/doi.org\/10.1007\/s00521-021-06002-w","journal-title":"Neural Comput Appl"},{"key":"11370_CR2","doi-asserted-by":"publisher","first-page":"21349","DOI":"10.1007\/s00521-023-08215-7","volume":"35","author":"B Wang","year":"2023","unstructured":"Wang B, Liao X (2023) A trusted routing mechanism for multi-attribute chain energy optimization for industrial internet of things. Neural Comput Appl 35:21349\u201321359. https:\/\/doi.org\/10.1007\/s00521-023-08215-7","journal-title":"Neural Comput Appl"},{"key":"11370_CR3","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":"11370_CR4","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1007\/s10845-020-01693-9","volume":"33","author":"J Liu","year":"2022","unstructured":"Liu J, Zhang Z, Chen F et al (2022) A novel hybrid immune clonal selection algorithm for the constrained corridor allocation problem. J Intell Manuf 33:953\u2013972. https:\/\/doi.org\/10.1007\/s10845-020-01693-9","journal-title":"J Intell Manuf"},{"key":"11370_CR5","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":"11370_CR6","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":"11370_CR7","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.jmsy.2023.06.013","volume":"69","author":"D Ji","year":"2023","unstructured":"Ji D, Zhang Z, Liang W et al (2023) Mathematical formulation and a novel two-stage algorithm for double-row layout problem with fixed loading and unloading points. J Manuf Syst 69:242\u2013254. https:\/\/doi.org\/10.1016\/j.jmsy.2023.06.013","journal-title":"J Manuf Syst"},{"key":"11370_CR8","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":"11370_CR9","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":"11370_CR10","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1108\/IMDS-10-2014-0296","volume":"115","author":"T-K Wang","year":"2015","unstructured":"Wang T-K, Yang T, Yang C-Y, Chan FTS (2015) Lean principles and simulation optimization for emergency department layout design. Ind Manag Data Syst 115:678\u2013699. https:\/\/doi.org\/10.1108\/IMDS-10-2014-0296","journal-title":"Ind Manag Data Syst"},{"key":"11370_CR11","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":"11370_CR12","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s11590-011-0426-8","volume":"7","author":"ARS Amaral","year":"2013","unstructured":"Amaral ARS (2013) Optimal solutions for the double row layout problem. Optim Lett 7:407\u2013413. https:\/\/doi.org\/10.1007\/s11590-011-0426-8","journal-title":"Optim Lett"},{"key":"11370_CR13","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.ejor.2018.04.008","volume":"270","author":"MF Anjos","year":"2018","unstructured":"Anjos MF, Fischer A, Hungerl\u00e4nder P (2018) Improved exact approaches for row layout problems with departments of equal length. Eur J Oper Res 270:514\u2013529. https:\/\/doi.org\/10.1016\/j.ejor.2018.04.008","journal-title":"Eur J Oper Res"},{"key":"11370_CR14","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1016\/j.ejor.2020.04.010","volume":"286","author":"M Dahlbeck","year":"2020","unstructured":"Dahlbeck M, Fischer A, Fischer F (2020) Decorous combinatorial lower bounds for row layout problems. Eur J Oper Res 286:929\u2013944. https:\/\/doi.org\/10.1016\/j.ejor.2020.04.010","journal-title":"Eur J Oper Res"},{"key":"11370_CR15","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":"11370_CR16","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":"11370_CR17","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":"11370_CR18","doi-asserted-by":"publisher","first-page":"17397","DOI":"10.1007\/s00521-020-05110-3","volume":"32","author":"A Bashab","year":"2020","unstructured":"Bashab A, Ibrahim AO, AbedElgabar EE et al (2020) A systematic mapping study on solving university timetabling problems using meta-heuristic algorithms. Neural Comput Appl 32:17397\u201317432. https:\/\/doi.org\/10.1007\/s00521-020-05110-3","journal-title":"Neural Comput Appl"},{"key":"11370_CR19","doi-asserted-by":"publisher","first-page":"14669","DOI":"10.1007\/s00521-021-06107-2","volume":"33","author":"E Sonu\u00e7","year":"2021","unstructured":"Sonu\u00e7 E (2021) Binary crow search algorithm for the uncapacitated facility location problem. Neural Comput Appl 33:14669\u201314685. https:\/\/doi.org\/10.1007\/s00521-021-06107-2","journal-title":"Neural Comput Appl"},{"key":"11370_CR20","doi-asserted-by":"publisher","first-page":"16951","DOI":"10.1007\/s00521-021-06289-9","volume":"33","author":"M Tanha","year":"2021","unstructured":"Tanha M, Hosseini Shirvani M, Rahmani AM (2021) A hybrid meta-heuristic task scheduling algorithm based on genetic and thermodynamic simulated annealing algorithms in cloud computing environments. Neural Comput Appl 33:16951\u201316984. https:\/\/doi.org\/10.1007\/s00521-021-06289-9","journal-title":"Neural Comput Appl"},{"issue":"1","key":"11370_CR21","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 Operat Res 176(1):177\u2013192","journal-title":"Eur J Operat Res"},{"key":"11370_CR22","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.cor.2017.09.011","volume":"93","author":"M. Pour S, Drake JH, Burke EK,","year":"2018","unstructured":"M. Pour S, Drake JH, Burke EK, (2018) A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways. Comput Oper Res 93:15\u201326. https:\/\/doi.org\/10.1016\/j.cor.2017.09.011","journal-title":"Comput Oper Res"},{"key":"11370_CR23","doi-asserted-by":"publisher","first-page":"23125","DOI":"10.1007\/s00521-023-08897-z","volume":"35","author":"B Zhou","year":"2023","unstructured":"Zhou B, Lei Y (2023) The pickup and delivery hybrid-operations of AGV conflict-free scheduling problem with time constraint among multi-FMCs. Neural Comput Appl 35:23125\u201323151. https:\/\/doi.org\/10.1007\/s00521-023-08897-z","journal-title":"Neural Comput Appl"},{"key":"11370_CR24","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":"11370_CR25","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":"11370_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105221","volume":"130","author":"A Kheiri","year":"2021","unstructured":"Kheiri A, Gretsista A, Keedwell E et al (2021) A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem. Comput Oper Res 130:105221. https:\/\/doi.org\/10.1016\/j.cor.2021.105221","journal-title":"Comput Oper Res"},{"key":"11370_CR27","doi-asserted-by":"publisher","first-page":"3563","DOI":"10.1080\/00207540601178557","volume":"46","author":"SP Singh","year":"2008","unstructured":"Singh SP, Sharma RRK (2008) Two-level modified simulated annealing based approach for solving facility layout problem. Int J Prod Res 46:3563\u20133582. https:\/\/doi.org\/10.1080\/00207540601178557","journal-title":"Int J Prod Res"},{"key":"11370_CR28","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":"11370_CR29","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":"11370_CR30","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1016\/j.cie.2011.12.033","volume":"62","author":"A Sadrzadeh","year":"2012","unstructured":"Sadrzadeh A (2012) A genetic algorithm with the heuristic procedure to solve the multi-line layout problem. Comput Ind Eng 62:1055\u20131064. https:\/\/doi.org\/10.1016\/j.cie.2011.12.033","journal-title":"Comput Ind Eng"},{"key":"11370_CR31","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.asoc.2017.09.003","volume":"61","author":"S Safarzadeh","year":"2017","unstructured":"Safarzadeh S, Koosha H (2017) Solving an extended multi-row facility layout problem with fuzzy clearances using GA. Appl Soft Comput 61:819\u2013831. https:\/\/doi.org\/10.1016\/j.asoc.2017.09.003","journal-title":"Appl Soft Comput"},{"key":"11370_CR32","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":"11370_CR33","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":"11370_CR34","doi-asserted-by":"publisher","first-page":"1937","DOI":"10.1080\/00207543.2012.721571","volume":"51","author":"PA Brunese","year":"2013","unstructured":"Brunese PA, Tanchoco JMA (2013) On implied within-building constraints for machine layout. Int J Prod Res 51:1937\u20131952. https:\/\/doi.org\/10.1080\/00207543.2012.721571","journal-title":"Int J Prod Res"},{"key":"11370_CR35","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.cie.2016.10.016","volume":"102","author":"J Chae","year":"2016","unstructured":"Chae J, Regan AC (2016) Layout design problems with heterogeneous area constraints. Comput Ind Eng 102:198\u2013207. https:\/\/doi.org\/10.1016\/j.cie.2016.10.016","journal-title":"Comput Ind Eng"},{"key":"11370_CR36","doi-asserted-by":"publisher","first-page":"2309","DOI":"10.1080\/00207543.2020.1730465","volume":"59","author":"S Liu","year":"2021","unstructured":"Liu S, Zhang Z, Guan C et al (2021) An improved fireworks algorithm for the constrained single-row facility layout problem. Int J Prod Res 59:2309\u20132327. https:\/\/doi.org\/10.1080\/00207543.2020.1730465","journal-title":"Int J Prod Res"},{"key":"11370_CR37","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":"11370_CR38","doi-asserted-by":"publisher","first-page":"1882","DOI":"10.1080\/00207543.2022.2051090","volume":"61","author":"K Maier","year":"2023","unstructured":"Maier K, Taferner V (2023) Solving the constrained single-row facility layout problem with integer linear programming. Int J Prod Res 61:1882\u20131897. https:\/\/doi.org\/10.1080\/00207543.2022.2051090","journal-title":"Int J Prod Res"},{"key":"11370_CR39","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ejor.2014.03.046","volume":"238","author":"JA Soria-Alcaraz","year":"2014","unstructured":"Soria-Alcaraz JA, Ochoa G, Swan J et al (2014) Effective learning hyper-heuristics for the course timetabling problem. Eur J Oper Res 238:77\u201386. https:\/\/doi.org\/10.1016\/j.ejor.2014.03.046","journal-title":"Eur J Oper Res"},{"key":"11370_CR40","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1007\/s00521-020-05016-0","volume":"33","author":"S Naz","year":"2021","unstructured":"Naz S, Majeed H, Khan FA (2021) Memory augmented hyper-heuristic framework to solve multi-disciplinary problems inspired by cognitive problem solving skills. Neural Comput Appl 33:1367\u20131378. https:\/\/doi.org\/10.1007\/s00521-020-05016-0","journal-title":"Neural Comput Appl"},{"key":"11370_CR41","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"},{"key":"11370_CR42","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2019.07.073","volume":"285","author":"JH Drake","year":"2020","unstructured":"Drake JH, Kheiri A, \u00d6zcan E, Burke EK (2020) Recent advances in selection hyper-heuristics. Eur J Oper Res 285:405\u2013428. https:\/\/doi.org\/10.1016\/j.ejor.2019.07.073","journal-title":"Eur J Oper Res"},{"key":"11370_CR43","doi-asserted-by":"crossref","unstructured":"Cowling P, Kendall G, Soubeiga E (2001) A Parameter-Free Hyperheuristic for Scheduling a Sales Summit. MIC\u20192001 - 4th Metaheuristics Int Conf","DOI":"10.1007\/3-540-44629-X_11"},{"key":"11370_CR44","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.advengsoft.2014.03.003","volume":"73","author":"J Thomas","year":"2014","unstructured":"Thomas J, Chaudhari NS (2014) Design of efficient packing system using genetic algorithm based on hyper heuristic approach. Adv Eng Softw 73:45\u201352. https:\/\/doi.org\/10.1016\/j.advengsoft.2014.03.003","journal-title":"Adv Eng Softw"},{"key":"11370_CR45","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1109\/IHMSC.2015.13","volume-title":"2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics","author":"J Yan","year":"2015","unstructured":"Yan J, Wu X (2015) A Genetic Based Hyper-Heuristic Algorithm for the Job Shop Scheduling Problem. 2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics. IEEE, Hangzhou, China, pp 161\u2013164"},{"key":"11370_CR46","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10710-017-9301-4","volume":"19","author":"JC Gomez","year":"2018","unstructured":"Gomez JC, Terashima-Mar\u00edn H (2018) Evolutionary hyper-heuristics for tackling bi-objective 2D bin packing problems. Genet Program Evolvable Mach 19:151\u2013181. https:\/\/doi.org\/10.1007\/s10710-017-9301-4","journal-title":"Genet Program Evolvable Mach"},{"key":"11370_CR47","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1016\/j.procs.2019.09.307","volume":"159","author":"SZ Ahmed Bacha","year":"2019","unstructured":"Ahmed Bacha SZ, Belahdji MW, Benatchba K, Tayeb FB-S (2019) A new hyper-heuristic to generate effective instance GA for the permutation flow shop problem. Procedia Comput Sci 159:1365\u20131374. https:\/\/doi.org\/10.1016\/j.procs.2019.09.307","journal-title":"Procedia Comput Sci"},{"key":"11370_CR48","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/TEVC.2019.2906581","volume":"24","author":"E Kieffer","year":"2020","unstructured":"Kieffer E, Danoy G, Brust MR et al (2020) Tackling large-scale and combinatorial Bi-level problems with a genetic programming hyper-heuristic. IEEE Trans Evol Comput 24:44\u201356. https:\/\/doi.org\/10.1109\/TEVC.2019.2906581","journal-title":"IEEE Trans Evol Comput"},{"key":"11370_CR49","doi-asserted-by":"publisher","first-page":"2415","DOI":"10.1109\/SSCI47803.2020.9308239","volume-title":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","author":"JGC Costa","year":"2020","unstructured":"Costa JGC, Mei Y, Zhang M (2020) Adaptive Search Space through Evolutionary Hyper-Heuristics for the Large-Scale Vehicle Routing Problem. 2020 IEEE Symposium Series on Computational Intelligence (SSCI). IEEE, Canberra, ACT, Australia, pp 2415\u20132422"},{"key":"11370_CR50","doi-asserted-by":"publisher","first-page":"1366","DOI":"10.1109\/CEC.2019.8790112","volume-title":"2019 IEEE Congress on Evolutionary Computation (CEC)","author":"F Zhang","year":"2019","unstructured":"Zhang F, Mei Y, Zhang M (2019) Evolving Dispatching Rules for Multi-objective Dynamic Flexible Job Shop Scheduling via Genetic Programming Hyper-heuristics. 2019 IEEE Congress on Evolutionary Computation (CEC). IEEE, Wellington, New Zealand, pp 1366\u20131373"},{"key":"11370_CR51","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":"11370_CR52","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1016\/j.cor.2013.02.012","volume":"40","author":"Q Jia","year":"2013","unstructured":"Jia Q, Seo Y (2013) Solving resource-constrained project scheduling problems: Conceptual validation of FLP formulation and efficient permutation-based ABC computation. Comput Oper Res 40:2037\u20132050. https:\/\/doi.org\/10.1016\/j.cor.2013.02.012","journal-title":"Comput Oper Res"},{"key":"11370_CR53","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ejor.2015.02.049","volume":"245","author":"P Hungerl\u00e4nder","year":"2015","unstructured":"Hungerl\u00e4nder P, Anjos MF (2015) A semidefinite optimization-based approach for global optimization of multi-row facility layout. Eur J Oper Res 245:46\u201361. https:\/\/doi.org\/10.1016\/j.ejor.2015.02.049","journal-title":"Eur J Oper Res"},{"key":"11370_CR54","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1007\/s12065-020-00419-3","volume":"14","author":"N Lenin","year":"2021","unstructured":"Lenin N, Siva Kumar M (2021) Harmony search algorithm for simultaneous minimization of bi-objectives in multi-row parallel machine layout problem. Evol Intell 14:1495\u20131522. https:\/\/doi.org\/10.1007\/s12065-020-00419-3","journal-title":"Evol Intell"},{"key":"11370_CR55","doi-asserted-by":"publisher","first-page":"6907","DOI":"10.1007\/s00521-021-06817-7","volume":"34","author":"S Liu","year":"2022","unstructured":"Liu S, Zhang Z, Guan C et al (2022) Mathematical formulation and two-phase optimisation methodology for the constrained double-row layout problem. Neural Comput Appl 34:6907\u20136926. https:\/\/doi.org\/10.1007\/s00521-021-06817-7","journal-title":"Neural Comput Appl"},{"key":"11370_CR56","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":"11370_CR57","doi-asserted-by":"publisher","first-page":"55954","DOI":"10.1109\/ACCESS.2023.3281554","volume":"11","author":"Y Li","year":"2023","unstructured":"Li Y, Li Z (2023) Bi-objective optimization for multi-row facility layout problem integrating automated guided vehicle path. IEEE Access 11:55954\u201355964. https:\/\/doi.org\/10.1109\/ACCESS.2023.3281554","journal-title":"IEEE Access"},{"key":"11370_CR58","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ejor.2015.04.029","volume":"246","author":"JF Gon\u00e7alves","year":"2015","unstructured":"Gon\u00e7alves JF, Resende MGC (2015) A biased random-key genetic algorithm for the unequal area facility layout problem. Eur J Oper Res 246:86\u2013107. https:\/\/doi.org\/10.1016\/j.ejor.2015.04.029","journal-title":"Eur J Oper Res"},{"key":"11370_CR59","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.compind.2004.06.003","volume":"56","author":"M-J Wang","year":"2005","unstructured":"Wang M-J, Hu MH, Ku M-Y (2005) A solution to the unequal area facilities layout problem by genetic algorithm. Comput Ind 56:207\u2013220. https:\/\/doi.org\/10.1016\/j.compind.2004.06.003","journal-title":"Comput Ind"},{"key":"11370_CR60","unstructured":"Ayob M, Kendall G (2003) A monte carlo hyper-heuristic to optimise component placement sequencing for multi head placement machine. Proceedings International Conference of Intelligent Technologies: 133\u2013141."},{"key":"11370_CR61","doi-asserted-by":"publisher","first-page":"1879","DOI":"10.1016\/j.eswa.2009.07.082","volume":"37","author":"C-K Ting","year":"2010","unstructured":"Ting C-K, Su C-H, Lee C-N (2010) Multi-parent extension of partially mapped crossover for combinatorial optimization problems. Expert Syst Appl 37:1879\u20131886. https:\/\/doi.org\/10.1016\/j.eswa.2009.07.082","journal-title":"Expert Syst Appl"},{"key":"11370_CR62","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2022.103252","volume":"173","author":"B Arasteh","year":"2022","unstructured":"Arasteh B, Abdi M, Bouyer A (2022) Program source code comprehension by module clustering using combination of discretized gray wolf and genetic algorithms. Adv Eng Softw 173:103252. https:\/\/doi.org\/10.1016\/j.advengsoft.2022.103252","journal-title":"Adv Eng Softw"},{"key":"11370_CR63","doi-asserted-by":"publisher","first-page":"3283","DOI":"10.1007\/s00521-022-07781-6","volume":"35","author":"B Arasteh","year":"2023","unstructured":"Arasteh B (2023) Clustered design-model generation from a program source code using chaos-based metaheuristic algorithms. Neural Comput Appl 35:3283\u20133305. https:\/\/doi.org\/10.1007\/s00521-022-07781-6","journal-title":"Neural Comput Appl"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-025-11370-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-025-11370-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-025-11370-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T17:25:10Z","timestamp":1757179510000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-025-11370-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,3]]},"references-count":63,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["11370"],"URL":"https:\/\/doi.org\/10.1007\/s00521-025-11370-8","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,3]]},"assertion":[{"value":"18 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 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 that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}