{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T05:54:40Z","timestamp":1770270880048,"version":"3.49.0"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T00:00:00Z","timestamp":1770163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T00:00:00Z","timestamp":1770163200000},"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":["J Supercomput"],"DOI":"10.1007\/s11227-026-08258-2","type":"journal-article","created":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T15:53:29Z","timestamp":1770220409000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A swarm intelligence-based hybrid metaheuristic with tabu search for the quadratic assignment problem"],"prefix":"10.1007","volume":"82","author":[{"given":"Karuna","family":"Panwar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kanchan","family":"Rajwar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kusum","family":"Deep","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sung-Bae","family":"Cho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,4]]},"reference":[{"key":"8258_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans TC, Beckmann M (1957) Assignment problems and the location of economic activities. Econometrica 25:53\u201376","journal-title":"Econometrica"},{"key":"8258_CR2","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1016\/j.eswa.2014.08.011","volume":"42","author":"U Benlic","year":"2015","unstructured":"Benlic U, Hao J-K (2015) Memetic search for the quadratic assignment problem. Expert Syst Appl 42:584\u2013595","journal-title":"Expert Syst Appl"},{"key":"8258_CR3","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.asoc.2018.08.047","volume":"73","author":"M Abdel-Basset","year":"2018","unstructured":"Abdel-Basset M, Manogaran G, El-Shahat D, Mirjalili S (2018) Integrating the whale algorithm with tabu search for quadratic assignment problem: a new approach for locating hospital departments. Appl Soft Comput 73:530\u2013546","journal-title":"Appl Soft Comput"},{"key":"8258_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.ins.2020.06.036","volume":"539","author":"H Zhang","year":"2020","unstructured":"Zhang H, Liu F, Zhou Y, Zhang Z (2020) A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem. Inf Sci 539:347\u2013374","journal-title":"Inf Sci"},{"key":"8258_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105961","volume":"148","author":"SM Venske","year":"2022","unstructured":"Venske SM, Almeida CP, L\u00fcders R, Delgado MR (2022) Selection hyper-heuristics for the multi and many-objective quadratic assignment problem. Comput Oper Res 148:105961","journal-title":"Comput Oper Res"},{"key":"8258_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109220","volume":"179","author":"H Wang","year":"2023","unstructured":"Wang H, Alidaee B (2023) A new hybrid-heuristic for large-scale combinatorial optimization: a case of quadratic assignment problem. Comput Ind Eng 179:109220","journal-title":"Comput Ind Eng"},{"key":"8258_CR7","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1016\/j.ejor.2020.11.035","volume":"292","author":"A Silva","year":"2021","unstructured":"Silva A, Coelho LC, Darvish M (2021) Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search. Eur J Oper Res 292:1066\u20131084","journal-title":"Eur J Oper Res"},{"key":"8258_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jobe.2021.102952","volume":"44","author":"C Cubukcuoglu","year":"2021","unstructured":"Cubukcuoglu C, Nourian P, Tasgetiren MF, Sariyildiz IS, Azadi S (2021) Hospital layout design renovation as a quadratic assignment problem with geodesic distances. J Build Eng 44:102952","journal-title":"J Build Eng"},{"key":"8258_CR9","first-page":"221","volume":"18","author":"J Fu","year":"2022","unstructured":"Fu J, Huang X, Tong L (2022) Urban layout optimization in a city network under an extended quadratic assignment problem framework. Transp Transp Sci 18:221\u2013247","journal-title":"Transp Transp Sci"},{"key":"8258_CR10","doi-asserted-by":"crossref","unstructured":"Moftah ME, Ghoneimy M (2024) Solving hospital layout problem as quadratic assignment problem by marine predators algorithm, In: 2024 international mobile, intelligent, and ubiquitous computing conference (MIUCC), IEEE, pp 137\u2013142","DOI":"10.1109\/MIUCC62295.2024.10783568"},{"key":"8258_CR11","doi-asserted-by":"crossref","unstructured":"Rajwar K, Deep K, Das S (2023) An exhaustive review of the metaheuristic algorithms for search and optimization: taxonomy, applications, and open challenges. Artif Intell Rev 1\u201371","DOI":"10.1007\/s10462-023-10470-y"},{"key":"8258_CR12","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1007\/s12597-015-0208-7","volume":"52","author":"ZH Ahmed","year":"2015","unstructured":"Ahmed ZH (2015) A multi-parent genetic algorithm for the quadratic assignment problem. Opsearch 52:714\u2013732","journal-title":"Opsearch"},{"key":"8258_CR13","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.eswa.2015.09.032","volume":"44","author":"F Hafiz","year":"2016","unstructured":"Hafiz F, Abdennour A (2016) Particle swarm algorithm variants for the quadratic assignment problems-a probabilistic learning approach. Expert Syst Appl 44:413\u2013431","journal-title":"Expert Syst Appl"},{"key":"8258_CR14","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1049\/cje.2017.06.004","volume":"27","author":"X Xia","year":"2018","unstructured":"Xia X, Zhou Y (2018) Performance analysis of aco on the quadratic assignment problem. Chin J Electron 27:26\u201334","journal-title":"Chin J Electron"},{"key":"8258_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106070","volume":"137","author":"S Samanta","year":"2019","unstructured":"Samanta S, Philip D, Chakraborty S (2019) A quick convergent artificial bee colony algorithm for solving quadratic assignment problems. Computers & Industrial Engineering 137:106070","journal-title":"Computers & Industrial Engineering"},{"key":"8258_CR16","doi-asserted-by":"publisher","first-page":"2713","DOI":"10.1007\/s00521-023-09202-8","volume":"36","author":"Y Liu","year":"2024","unstructured":"Liu Y, As\u2019 arry A, Hassan MK, Hairuddin AA, Mohamad H (2024) Review of the grey wolf optimization algorithm: variants and applications. Neural Comput Appl 36:2713\u20132735","journal-title":"Neural Comput Appl"},{"key":"8258_CR17","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.compbiolchem.2018.11.017","volume":"78","author":"X Zhao","year":"2019","unstructured":"Zhao X, Zhang X, Cai Z, Tian X, Wang X, Huang Y, Chen H, Hu L (2019) Chaos enhanced grey wolf optimization wrapped elm for diagnosis of paraquat-poisoned patients. Comput Biol Chem 78:481\u2013490","journal-title":"Comput Biol Chem"},{"key":"8258_CR18","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.engappai.2017.05.003","volume":"63","author":"M Wang","year":"2017","unstructured":"Wang M, Chen H, Li H, Cai Z, Zhao X, Tong C, Li J, Xu X (2017) Grey wolf optimization evolving kernel extreme learning machine: Application to bankruptcy prediction. Eng Appl Artif Intell 63:54\u201368","journal-title":"Eng Appl Artif Intell"},{"key":"8258_CR19","doi-asserted-by":"publisher","first-page":"2651","DOI":"10.1007\/s10462-018-9634-2","volume":"52","author":"N Hatta","year":"2019","unstructured":"Hatta N, Zain AM, Sallehuddin R, Shayfull Z, Yusoff Y (2019) Recent studies on optimisation method of grey wolf optimiser (gwo): a review (2014\u20132017). Artif Intell Rev 52:2651\u20132683","journal-title":"Artif Intell Rev"},{"key":"8258_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105645","volume":"83","author":"K Luo","year":"2019","unstructured":"Luo K, Zhao Q (2019) A binary grey wolf optimizer for the multidimensional knapsack problem. Appl Soft Comput 83:105645","journal-title":"Appl Soft Comput"},{"key":"8258_CR21","doi-asserted-by":"crossref","unstructured":"Diastivena D, Wahyuningsih S, Satyananda D (2021) Grey wolf optimizer algorithm for solving the multi depot vehicle routing problem and its implementation. In: Journal of Physics: Conference Series, vol 1872, p 012001","DOI":"10.1088\/1742-6596\/1872\/1\/012001"},{"key":"8258_CR22","doi-asserted-by":"crossref","unstructured":"Korayem L, Khorsid M, Kassem S (2015) Using grey wolf algorithm to solve the capacitated vehicle routing problem. In: IOP Conference Series: Materials Science and Engineering, vol 83, p 012014","DOI":"10.1088\/1757-899X\/83\/1\/012014"},{"key":"8258_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110583","volume":"146","author":"M Banaie-Dezfouli","year":"2023","unstructured":"Banaie-Dezfouli M, Nadimi-Shahraki MH, Beheshti Z (2023) BE-GWO: binary extremum-based grey wolf optimizer for discrete optimization problems. Appl Soft Comput 146:110583","journal-title":"Appl Soft Comput"},{"key":"8258_CR24","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.jocs.2015.03.011","volume":"8","author":"G Komaki","year":"2015","unstructured":"Komaki G, Kayvanfar V (2015) Grey wolf optimizer algorithm for the two-stage assembly flow shop scheduling problem with release time. J Comput Sci 8:109\u2013120","journal-title":"J Comput Sci"},{"key":"8258_CR25","doi-asserted-by":"publisher","first-page":"115559","DOI":"10.1109\/ACCESS.2020.3004380","volume":"8","author":"P Wang","year":"2020","unstructured":"Wang P, Rao Y, Luo Q (2020) An effective discrete grey wolf optimization algorithm for solving the packing problem. IEEE Access 8:115559\u2013115571","journal-title":"IEEE Access"},{"key":"8258_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2021.101454","volume":"55","author":"K Panwar","year":"2021","unstructured":"Panwar K, Deep K (2021) Transformation operators based grey wolf optimizer for travelling salesman problem. J Comput Sci 55:101454","journal-title":"J Comput Sci"},{"key":"8258_CR27","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10723-024-09761-7","volume":"22","author":"S Kosari","year":"2024","unstructured":"Kosari S, Shirvani MH, Khaledian N, Javaheri D (2024) A hybrid discrete grey wolf optimization algorithm imbalance-ness aware for solving two-dimensional bin-packing problems. J Grid Comput 22:49","journal-title":"J Grid Comput"},{"key":"8258_CR28","doi-asserted-by":"publisher","DOI":"10.22266\/ijies2023.1031.53","author":"AA Hussein","year":"2023","unstructured":"Hussein AA, Yassen ET, Rashid AN (2023) Grey wolf optimizer for green vehicle routing problem. Int J Intell Eng Syst. https:\/\/doi.org\/10.22266\/ijies2023.1031.53","journal-title":"Int J Intell Eng Syst"},{"key":"8258_CR29","doi-asserted-by":"publisher","first-page":"3659","DOI":"10.1109\/TASE.2021.3129439","volume":"19","author":"C Lin","year":"2022","unstructured":"Lin C, Cao Z, Zhou M (2022) Learning-based grey wolf optimizer for stochastic flexible job shop scheduling. IEEE Trans Autom Sci Eng 19:3659\u20133671","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"8258_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.108060","volume":"114","author":"Q Luo","year":"2022","unstructured":"Luo Q, Rao Y, Peng D (2022) GA and GWO algorithm for the special bin packing problem encountered in field of aircraft arrangement. Appl Soft Comput 114:108060","journal-title":"Appl Soft Comput"},{"key":"8258_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105746","volume":"195","author":"P Hu","year":"2020","unstructured":"Hu P, Pan J-S, Chu S-C (2020) Improved binary grey wolf optimizer and its application for feature selection. Knowl-Based Syst 195:105746","journal-title":"Knowl-Based Syst"},{"key":"8258_CR32","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.asoc.2018.11.047","volume":"76","author":"Q Tu","year":"2019","unstructured":"Tu Q, Chen X, Liu X (2019) Multi-strategy ensemble grey wolf optimizer and its application to feature selection. Appl Soft Comput 76:16\u201330","journal-title":"Appl Soft Comput"},{"key":"8258_CR33","doi-asserted-by":"publisher","first-page":"22991","DOI":"10.1109\/ACCESS.2023.3304889","volume":"12","author":"SN Makhadmeh","year":"2023","unstructured":"Makhadmeh SN, Al-Betar MA, Doush IA, Awadallah MA, Kassaymeh S, Mirjalili S, Zitar RA (2023) Recent advances in grey wolf optimizer, its versions and applications. IEEE Access 12:22991\u201323028","journal-title":"IEEE Access"},{"key":"8258_CR34","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10115-019-01358-x","volume":"62","author":"I Aljarah","year":"2020","unstructured":"Aljarah I, Mafarja M, Heidari AA, Faris H, Mirjalili S (2020) Clustering analysis using a novel locality-informed grey wolf-inspired clustering approach. Knowl Inf Syst 62:507\u2013539","journal-title":"Knowl Inf Syst"},{"key":"8258_CR35","doi-asserted-by":"crossref","unstructured":"Rahul P, Singh A (2022) Hybridization of Tabu search and grey wolf optimizer for improved workflow scheduling and optimization of resources in edge computing. In: 2022 second international conference on advances in electrical, computing, communication and sustainable technologies (ICAECT), IEEE, pp 1\u20137","DOI":"10.1109\/ICAECT54875.2022.9808002"},{"key":"8258_CR36","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0306166","volume":"19","author":"H Zhang","year":"2024","unstructured":"Zhang H, Yan J, Wang L (2024) Hybrid Tabu-grey wolf optimizer algorithm for enhancing fresh cold-chain logistics distribution. PLoS ONE 19:e0306166","journal-title":"PLoS ONE"},{"key":"8258_CR37","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","volume":"2","author":"J Skorin-Kapov","year":"1990","unstructured":"Skorin-Kapov J (1990) Tabu search applied to the quadratic assignment problem. ORSA J Comput 2:33\u201345","journal-title":"ORSA J Comput"},{"key":"8258_CR38","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"\u00c9 Taillard","year":"1991","unstructured":"Taillard \u00c9 (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17:443\u2013455","journal-title":"Parallel Comput"},{"key":"8258_CR39","volume-title":"The quadratic assignment problem: theory and algorithms","author":"E Cela","year":"2013","unstructured":"Cela E (2013) The quadratic assignment problem: theory and algorithms, vol 1. Springer, Berlin"},{"key":"8258_CR40","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0305-0548(93)E0020-T","volume":"22","author":"DM Tate","year":"1995","unstructured":"Tate DM, Smith AE (1995) A genetic approach to the quadratic assignment problem. Comput Oper Res 22:73\u201383","journal-title":"Comput Oper Res"},{"key":"8258_CR41","unstructured":"Misevi\u010dius A, Kilda B (2005) Comparison of crossover operators for the quadratic assignment problem. Inf Technol Control 34(2):109\u2013119"},{"key":"8258_CR42","first-page":"763","volume":"73","author":"Z Ahmed","year":"2005","unstructured":"Ahmed Z (2005) A simple genetic algorithm using sequential constructive crossover for the quadratic assignment problem. NISCAIR-CSIR India 73:763\u2013766","journal-title":"NISCAIR-CSIR India"},{"key":"8258_CR43","doi-asserted-by":"publisher","first-page":"108","DOI":"10.3390\/e23010108","volume":"23","author":"A Misevi\u010dius","year":"2021","unstructured":"Misevi\u010dius A, Veren\u0117 D (2021) A hybrid genetic-hierarchical algorithm for the quadratic assignment problem. Entropy 23:108","journal-title":"Entropy"},{"key":"8258_CR44","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.cie.2015.03.001","volume":"85","author":"T Dokeroglu","year":"2015","unstructured":"Dokeroglu T (2015) Hybrid teaching\u2013learning-based optimization algorithms for the quadratic assignment problem. Comput Ind Eng 85:86\u2013101","journal-title":"Comput Ind Eng"},{"key":"8258_CR45","first-page":"221","volume":"18","author":"ME Riffi","year":"2017","unstructured":"Riffi ME, Saji Y, Barkatou M (2017) Incorporating a modified uniform crossover and 2-exchange neighbourhood mechanism in a discrete bat algorithm to solve the quadratic assignment problem. Egypt Inf J 18:221\u2013232","journal-title":"Egypt Inf J"},{"key":"8258_CR46","first-page":"901","volume":"33","author":"M Abdel-Baset","year":"2017","unstructured":"Abdel-Baset M, Wu H, Zhou Y, Abdel-Fatah L (2017) Elite opposition-flower pollination algorithm for quadratic assignment problem. J Intell Fuzzy Syst 33:901\u2013911","journal-title":"J Intell Fuzzy Syst"},{"key":"8258_CR47","doi-asserted-by":"publisher","first-page":"12531","DOI":"10.1007\/s00521-023-08387-2","volume":"35","author":"T Dokeroglu","year":"2023","unstructured":"Dokeroglu T, Ozdemir YS (2023) A new robust Harris hawk optimization algorithm for large quadratic assignment problems. Neural Comput Appl 35:12531\u201312544","journal-title":"Neural Comput Appl"},{"key":"8258_CR48","first-page":"491","volume":"9","author":"T Pradeepmon","year":"2018","unstructured":"Pradeepmon T, Sridharan R, Panicker V (2018) Development of modified discrete particle swarm optimization algorithm for quadratic assignment problems. Int J Ind Eng Comput 9:491\u2013508","journal-title":"Int J Ind Eng Comput"},{"key":"8258_CR49","first-page":"673","volume":"22","author":"H K\u0131l\u0131\u00e7","year":"2019","unstructured":"K\u0131l\u0131\u00e7 H, Y\u00fczge\u00e7 U (2019) Tournament selection based antlion optimization algorithm for solving quadratic assignment problem. Eng Sci Technol Int J 22:673\u2013691","journal-title":"Eng Sci Technol Int J"},{"key":"8258_CR50","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1016\/j.ejor.2007.06.061","volume":"195","author":"T James","year":"2009","unstructured":"James T, Rego C, Glover F (2009) A cooperative parallel Tabu search algorithm for the quadratic assignment problem. Eur J Oper Res 195:810\u2013826","journal-title":"Eur J Oper Res"},{"key":"8258_CR51","doi-asserted-by":"crossref","unstructured":"Ismail M, Rashwan O (2023) A hierarchical data-driven parallel memetic algorithm for the quadratic assignment problem, Available at SSRN 4517038","DOI":"10.2139\/ssrn.4517038"},{"key":"8258_CR52","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.engappai.2014.12.011","volume":"39","author":"U Tosun","year":"2015","unstructured":"Tosun U (2015) On the performance of parallel hybrid algorithms for the solution of the quadratic assignment problem. Eng Appl Artif Intell 39:267\u2013278","journal-title":"Eng Appl Artif Intell"},{"key":"8258_CR53","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.engappai.2016.02.004","volume":"52","author":"T Dokeroglu","year":"2016","unstructured":"Dokeroglu T, Cosar A (2016) A novel multistart hyper-heuristic algorithm on the grid for the quadratic assignment problem. Eng Appl Artif Intell 52:10\u201325","journal-title":"Eng Appl Artif Intell"},{"key":"8258_CR54","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.asoc.2019.01.001","volume":"76","author":"T Dokeroglu","year":"2019","unstructured":"Dokeroglu T, Sevinc E, Cosar A (2019) Artificial bee colony optimization for the quadratic assignment problem. Appl Soft Comput 76:595\u2013606","journal-title":"Appl Soft Comput"},{"key":"8258_CR55","first-page":"843","volume":"21","author":"E Sonuc","year":"2018","unstructured":"Sonuc E, Sen B, Bayir S (2018) A cooperative GPU-based parallel multistart simulated annealing algorithm for quadratic assignment problem. Eng Sci Technol Int J 21:843\u2013849","journal-title":"Eng Sci Technol Int J"},{"key":"8258_CR56","doi-asserted-by":"crossref","unstructured":"Sasmito A (2024) Adaptive chaotic rat swarm optimizer for the quadratic assignment problem. In: AIP Conference Proceedings, vol 3201, AIP Publishing","DOI":"10.1063\/5.0230596"},{"key":"8258_CR57","doi-asserted-by":"publisher","first-page":"3726","DOI":"10.3390\/math12233726","volume":"12","author":"A Misevi\u010dius","year":"2024","unstructured":"Misevi\u010dius A, Andrejevas A, Ostreika A, Veren\u0117 D, \u017dekien\u0117 G (2024) An improved hybrid genetic-hierarchical algorithm for the quadratic assignment problem. Mathematics 12:3726","journal-title":"Mathematics"},{"key":"8258_CR58","doi-asserted-by":"crossref","unstructured":"Abdulsattar R, Abass IT (2024) Tabu search algorithm for solving quadratic assignment problem. In: AIP Conference Proceedings. AIP Publishing, vol 3097","DOI":"10.1063\/5.0209862"},{"key":"8258_CR59","doi-asserted-by":"crossref","unstructured":"Soto D, Soto W (2023) A multi-agent based algorithm for quadratic assignment problem. In: 2023 IEEE Latin American Conference on Computational Intelligence (LA-CCI), IEEE, pp 1\u20136","DOI":"10.1109\/LA-CCI58595.2023.10409417"},{"key":"8258_CR60","doi-asserted-by":"publisher","first-page":"17","DOI":"10.21608\/esju.2023.215434.1014","volume":"67","author":"EM Oun","year":"2023","unstructured":"Oun EM, Roshdy H (2023) Improved crow search algorithm for solving quadratic assignment problem. Egypt Stat J 67:17\u201328","journal-title":"Egypt Stat J"},{"key":"8258_CR61","first-page":"529","volume":"21","author":"T Mzili","year":"2023","unstructured":"Mzili T, Mzili I, Riffi ME, Pamucar D, Simic V, Kurdi M (2023) A novel discrete rat swarm optimization algorithm for the quadratic assignment problem, Facta Universitatis, Series. Mech Eng 21:529\u2013552","journal-title":"Mech Eng"},{"key":"8258_CR62","doi-asserted-by":"crossref","unstructured":"Jamil N, Abdul-Rahman S, Benjamin AM (2023) Modified sine cosine algorithm for solving quadratic assignment problem. In: AIP Conference Proceedings. AIP Publishing, vol 2896","DOI":"10.1063\/5.0179438"},{"key":"8258_CR63","doi-asserted-by":"publisher","DOI":"10.14569\/IJACSA.2022.0130568","author":"H Alfaifi","year":"2022","unstructured":"Alfaifi H, Daadaa Y (2022) Parallel improved genetic algorithm for the quadratic assignment problem. Int J Adv Comput Sci Appl. https:\/\/doi.org\/10.14569\/IJACSA.2022.0130568","journal-title":"Int J Adv Comput Sci Appl"},{"key":"8258_CR64","doi-asserted-by":"publisher","first-page":"1663","DOI":"10.1007\/s12351-020-00549-7","volume":"21","author":"MA Bald\u00e9","year":"2021","unstructured":"Bald\u00e9 MA, Gueye S, Ndiaye BM (2021) A greedy evolutionary hybridization algorithm for the optimal network and quadratic assignment problem. Oper Res Int J 21:1663\u20131690","journal-title":"Oper Res Int J"},{"key":"8258_CR65","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1644015.1644033","volume":"6","author":"R Hassin","year":"2009","unstructured":"Hassin R, Levin A, Sviridenko M (2009) Approximating the minimum quadratic assignment problems. ACM Trans Algorithms (TALG) 6:1\u201310","journal-title":"ACM Trans Algorithms (TALG)"},{"key":"8258_CR66","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361","journal-title":"Adv Eng Softw"},{"key":"8258_CR67","unstructured":"Said GAE-NA, Mahmoud AM, El-Horbaty E-SM (2014) A comparative study of meta-heuristic algorithms for solving quadratic assignment problem. arXiv preprint arXiv:1407.4863"},{"key":"8258_CR68","doi-asserted-by":"crossref","unstructured":"Chmiel W, Kad\u0142uczka P, Kwiecie\u0144 J, Filipowicz B (2017) A comparison of nature inspired algorithms for the quadratic assignment problem. Bulletin of the Polish Academy of Sciences. Technical Sciences 65","DOI":"10.1515\/bpasts-2017-0056"},{"key":"8258_CR69","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/5803893","author":"WL Lim","year":"2016","unstructured":"Lim WL, Wibowo A, Desa MI, Haron H (2016) A biogeography-based optimization algorithm hybridized with Tabu search for the quadratic assignment problem. Comput Intell Neurosci. https:\/\/doi.org\/10.1155\/2016\/5803893","journal-title":"Comput Intell Neurosci"},{"key":"8258_CR70","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/S0305-0548(99)00067-2","volume":"27","author":"RK Ahuja","year":"2000","unstructured":"Ahuja RK, Orlin JB, Tiwari A (2000) A greedy genetic algorithm for the quadratic assignment problem. Comput Oper Res 27:917\u2013934","journal-title":"Comput Oper Res"},{"key":"8258_CR71","first-page":"2843","volume":"11","author":"G C\u00e1rdenas","year":"2017","unstructured":"C\u00e1rdenas G, Poveda Ch R, Garc\u00eda H (2017) A solution for the quadratic assignment problem (QAP) through a parallel genetic algorithm based grid on GPU. Appl Math Sci 11:2843\u20132854","journal-title":"Appl Math Sci"},{"key":"8258_CR72","doi-asserted-by":"publisher","first-page":"235","DOI":"10.3934\/jimo.2018041","volume":"15","author":"KM Ng","year":"2019","unstructured":"Ng KM, Tran TH (2019) A parallel water flow algorithm with local search for solving the quadratic assignment problem. J Ind Manag Optim 15:235","journal-title":"J Ind Manag Optim"},{"key":"8258_CR73","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.rcim.2007.01.004","volume":"24","author":"A Ramkumar","year":"2008","unstructured":"Ramkumar A, Ponnambalam S, Jawahar N, Suresh R (2008) Iterated fast local search algorithm for solving quadratic assignment problems. Robot Comput Integr Manuf 24:392\u2013401","journal-title":"Robot Comput Integr Manuf"},{"key":"8258_CR74","doi-asserted-by":"publisher","first-page":"1423743","DOI":"10.1080\/23311916.2018.1423743","volume":"5","author":"ZH Ahmed","year":"2018","unstructured":"Ahmed ZH (2018) A hybrid algorithm combining lexisearch and genetic algorithms for the quadratic assignment problem. Cogent Eng 5:1423743","journal-title":"Cogent Eng"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08258-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08258-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08258-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T17:02:36Z","timestamp":1770224556000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08258-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,4]]},"references-count":74,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2026,2]]}},"alternative-id":["8258"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08258-2","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,4]]},"assertion":[{"value":"2 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2026","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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"126"}}