{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T22:58:27Z","timestamp":1773269907469,"version":"3.50.1"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T00:00:00Z","timestamp":1773187200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T00:00:00Z","timestamp":1773187200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100010877","name":"Shenzhen Science and Technology Innovation Commission","doi-asserted-by":"crossref","award":["KCXFZ20211020163402004"],"award-info":[{"award-number":["KCXFZ20211020163402004"]}],"id":[{"id":"10.13039\/501100010877","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-026-08408-6","type":"journal-article","created":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T07:33:17Z","timestamp":1773214397000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A discrete crow search algorithm for solving the uncapacitated facility location problem"],"prefix":"10.1007","volume":"82","author":[{"given":"Le","family":"Xu","sequence":"first","affiliation":[]},{"given":"Yong","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Jiang","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,11]]},"reference":[{"key":"8408_CR1","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.eswa.2017.04.023","volume":"83","author":"M Abd El Aziz","year":"2017","unstructured":"Abd El Aziz M, Ewees AA, Hassanien AE (2017) Whale optimization algorithm and moth-flame optimization for multilevel thresholding image segmentation. Expert Syst Appl 83:242\u2013256. https:\/\/doi.org\/10.1016\/j.eswa.2017.04.023","journal-title":"Expert Syst Appl"},{"issue":"19","key":"8408_CR2","doi-asserted-by":"publisher","first-page":"3466","DOI":"10.3390\/math10193466","volume":"10","author":"M Abdel-Basset","year":"2022","unstructured":"Abdel-Basset M, Mohamed R, Sallam KM, Chakrabortty RK (2022) Light spectrum optimizer: a novel physics-inspired metaheuristic optimization algorithm. Mathematics 10(19):3466. https:\/\/doi.org\/10.3390\/math10193466","journal-title":"Mathematics"},{"key":"8408_CR3","doi-asserted-by":"publisher","unstructured":"Akan T, Agahian S, Dehkharghani R (2022) Binbro: binary battle royale optimizer algorithm [source code]. https:\/\/doi.org\/10.1016\/j.eswa.2022.116599","DOI":"10.1016\/j.eswa.2022.116599"},{"issue":"6","key":"8408_CR4","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1287\/mnsc.23.6.585","volume":"23","author":"U Akinc","year":"1977","unstructured":"Akinc U, Khumawala BM (1977) An efficient branch and bound algorithm for the capacitated warehouse location problem. Manage Sci 23(6):585\u2013594. https:\/\/doi.org\/10.1287\/mnsc.23.6.585","journal-title":"Manage Sci"},{"issue":"1","key":"8408_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/A:1018956213524","volume":"86","author":"KS Al-Sultan","year":"1999","unstructured":"Al-Sultan KS, Al-Fawzan MA (1999) A tabu search approach to the uncapacitated facility location problem. Ann Oper Res 86(1):91\u2013103. https:\/\/doi.org\/10.1023\/A:1018956213524","journal-title":"Ann Oper Res"},{"key":"8408_CR6","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.eswa.2018.02.018","volume":"102","author":"M Allaoui","year":"2018","unstructured":"Allaoui M, Ahiod B, El Yafrani M (2018) A hybrid crow search algorithm for solving the dna fragment assembly problem. Expert Syst Appl 102:44\u201356","journal-title":"Expert Syst Appl"},{"key":"8408_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.compstruc.2016.03.001","volume":"169","author":"A Askarzadeh","year":"2016","unstructured":"Askarzadeh A (2016) A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm. Comput Struct 169:1\u201312. https:\/\/doi.org\/10.1016\/j.compstruc.2016.03.001","journal-title":"Comput Struct"},{"key":"8408_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105576","volume":"82","author":"M Aslan","year":"2019","unstructured":"Aslan M, Gunduz M, Kiran MS (2019) Jayax: Jaya algorithm with xor operator for binary optimization. Appl Soft Comput 82:105576. https:\/\/doi.org\/10.1016\/j.asoc.2019.105576","journal-title":"Appl Soft Comput"},{"key":"8408_CR9","doi-asserted-by":"publisher","unstructured":"Atta S, Mahapatra PRS, Mukhopadhyay A (2018) Solving uncapacitated facility location problem using monkey algorithm. In: Intelligent Engineering Informatics: Proceedings of the 6th International Conference on FICTA. Springer, pp 71\u201378. https:\/\/doi.org\/10.1007\/978-981-10-7566-7_8","DOI":"10.1007\/978-981-10-7566-7_8"},{"key":"8408_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121243","volume":"235","author":"O Avalos","year":"2024","unstructured":"Avalos O, Haro EH, Camarena O, D\u00edaz P (2024) Improved crow search algorithm for optimal flexible manufacturing process planning. Expert Syst Appl 235:121243. https:\/\/doi.org\/10.1016\/j.eswa.2023.121243","journal-title":"Expert Syst Appl"},{"key":"8408_CR11","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1023\/B:HEUR.0000026896.44360.f9","volume":"10","author":"ME Aydin","year":"2004","unstructured":"Aydin ME, Fogarty TC (2004) A distributed evolutionary simulated annealing algorithm for combinatorial optimisation problems. J Heuristics 10:269\u2013292. https:\/\/doi.org\/10.1023\/B:HEUR.0000026896.44360.f9","journal-title":"J Heuristics"},{"key":"8408_CR12","volume":"65","author":"A Babalik","year":"2025","unstructured":"Babalik A, Babadag A (2025) A binary grasshopper optimization algorithm for solving uncapacitated facility location problem. Eng Sci Technol Int J 65:102031","journal-title":"Eng Sci Technol Int J"},{"issue":"2","key":"8408_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01784983","volume":"12","author":"J Barcelo","year":"1990","unstructured":"Barcelo J, Hallefjord \u00c5, Fernandez E, J\u00f6rnsten K (1990) Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing. Operations Res Spektrum 12(2):79\u201388. https:\/\/doi.org\/10.1007\/BF01784983","journal-title":"Operations Res Spektrum"},{"key":"8408_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113618","volume":"161","author":"E Ba\u015f","year":"2020","unstructured":"Ba\u015f E, \u00dclker E (2020) A binary social spider algorithm for uncapacitated facility location problem. Expert Syst Appl 161:113618. https:\/\/doi.org\/10.1016\/j.eswa.2020.113618","journal-title":"Expert Syst Appl"},{"issue":"11","key":"8408_CR15","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) Or-library: distributing test problems by electronic mail. J Operational Res Soc 41(11):1069\u20131072. https:\/\/doi.org\/10.1057\/jors.1990.166","journal-title":"J Operational Res Soc"},{"key":"8408_CR16","doi-asserted-by":"publisher","first-page":"526","DOI":"10.3390\/biomimetics10080526","volume":"10","author":"A Be\u015fkirli","year":"2025","unstructured":"Be\u015fkirli A (2025) A transfer function-based binary version of improved pied kingfisher optimizer for solving the uncapacitated facility location problem. Biomimetics 10:526","journal-title":"Biomimetics"},{"key":"8408_CR17","doi-asserted-by":"publisher","first-page":"3737","DOI":"10.1109\/TITS.2018.2878442","volume":"20","author":"R Cheng","year":"2018","unstructured":"Cheng R, Song Y, Chen D, Ma X (2018) Intelligent positioning approach for high speed trains based on ant colony optimization and machine learning algorithms. IEEE Trans Intell Transp Syst 20:3737\u20133746","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"8408_CR18","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1016\/j.cie.2017.12.009","volume":"115","author":"AC Cinar","year":"2018","unstructured":"Cinar AC, Kiran MS (2018) Similarity and logic gate-based tree-seed algorithms for binary optimization. Comput Ind Eng 115:631\u2013646. https:\/\/doi.org\/10.1016\/j.cie.2017.12.009","journal-title":"Comput Ind Eng"},{"key":"8408_CR19","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/bf01585746","volume":"46","author":"AR Conn","year":"1990","unstructured":"Conn AR, Cornuejols G (1990) A projection method for the uncapacitated facility location problem. Math Program 46:273\u2013298. https:\/\/doi.org\/10.1007\/bf01585746","journal-title":"Math Program"},{"issue":"4","key":"8408_CR20","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1016\/j.cie.2010.09.012","volume":"59","author":"T Cura","year":"2010","unstructured":"Cura T (2010) A parallel local search approach to solving the uncapacitated warehouse location problem. Comput Ind Eng 59(4):1000\u20131009. https:\/\/doi.org\/10.1016\/j.cie.2010.09.012","journal-title":"Comput Ind Eng"},{"key":"8408_CR21","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.cor.2014.09.003","volume":"62","author":"H Damgacioglu","year":"2015","unstructured":"Damgacioglu H, Dinler D, Ozdemirel NE, Iyigun C (2015) A genetic algorithm for the uncapacitated single allocation planar hub location problem. Comput Operations Res 62:224\u2013236. https:\/\/doi.org\/10.1016\/j.cor.2014.09.003","journal-title":"Comput Operations Res"},{"issue":"2\u20134","key":"8408_CR22","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/s0045-7825(99)00389-8","volume":"186","author":"K Deb","year":"2000","unstructured":"Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186(2\u20134):311\u2013338. https:\/\/doi.org\/10.1016\/s0045-7825(99)00389-8","journal-title":"Comput Methods Appl Mech Eng"},{"issue":"3","key":"8408_CR23","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1287\/opre.14.3.361","volume":"14","author":"M Efroymson","year":"1966","unstructured":"Efroymson M, Ray T (1966) A branch-bound algorithm for plant location. Oper Res 14(3):361\u2013368. https:\/\/doi.org\/10.1287\/opre.14.3.361","journal-title":"Oper Res"},{"key":"8408_CR24","doi-asserted-by":"publisher","unstructured":"Engelbrecht AP, Pampara G (2007) Binary differential evolution strategies. In: 2007 IEEE Congress on Evolutionary Computation. IEEE, pp 1942\u20131947. https:\/\/doi.org\/10.1109\/CEC.2007.4424711","DOI":"10.1109\/CEC.2007.4424711"},{"issue":"1","key":"8408_CR25","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/bf02097805","volume":"18","author":"RD Galv\u00e3o","year":"1989","unstructured":"Galv\u00e3o RD, Raggi LA (1989) A method for solving to optimality uncapacitated location problems. Ann Oper Res 18(1):225\u2013244. https:\/\/doi.org\/10.1007\/bf02097805","journal-title":"Ann Oper Res"},{"key":"8408_CR26","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1016\/j.swevo.2018.08.006","volume":"44","author":"J Garc\u00eda","year":"2019","unstructured":"Garc\u00eda J, Crawford B, Soto R, Astorga G (2019) A clustering algorithm applied to the binarization of swarm intelligence continuous metaheuristics. Swarm Evol Comput 44:646\u2013664. https:\/\/doi.org\/10.1016\/j.swevo.2018.08.006","journal-title":"Swarm Evol Comput"},{"issue":"35","key":"8408_CR27","doi-asserted-by":"publisher","first-page":"24603","DOI":"10.1007\/s00521-023-08207-7","volume":"35","author":"J Geng","year":"2023","unstructured":"Geng J, Sun X, Wang H, Bu X, Liu D, Li F, Zhao Z (2023) A modified adaptive sparrow search algorithm based on chaotic reverse learning and spiral search for global optimization. Neural Comput Appl 35(35):24603\u201324620. https:\/\/doi.org\/10.1007\/s00521-023-08207-7","journal-title":"Neural Comput Appl"},{"key":"8408_CR28","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s11067-011-9162-y","volume":"12","author":"A Ghaderi","year":"2012","unstructured":"Ghaderi A, Jabalameli MS, Barzinpour F, Rahmaniani R (2012) An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem. Netw Spat Econ 12:421\u2013439. https:\/\/doi.org\/10.1007\/s11067-011-9162-y","journal-title":"Netw Spat Econ"},{"key":"8408_CR29","first-page":"653","volume":"29","author":"F Glover","year":"2000","unstructured":"Glover F, Laguna M, Mart\u00ed R (2000) Fundamentals of scatter search and path relinking. Control Cybern 29:653\u2013684","journal-title":"Control Cybern"},{"key":"8408_CR30","doi-asserted-by":"publisher","first-page":"16971","DOI":"10.1007\/s00521-020-04917-4","volume":"32","author":"H Hakli","year":"2020","unstructured":"Hakli H (2020) Bineho: a new binary variant based on elephant herding optimization algorithm. Neural Comput Appl 32:16971\u201316991. https:\/\/doi.org\/10.1007\/s00521-020-04917-4","journal-title":"Neural Comput Appl"},{"key":"8408_CR31","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1016\/j.cie.2019.06.060","volume":"135","author":"H Hakli","year":"2019","unstructured":"Hakli H, Ortacay Z (2019) An improved scatter search algorithm for the uncapacitated facility location problem. Comput Ind Eng 135:855\u2013867. https:\/\/doi.org\/10.1016\/j.cie.2019.06.060","journal-title":"Comput Ind Eng"},{"key":"8408_CR32","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/s40328-020-00321-5","volume":"55","author":"A Haryono","year":"2020","unstructured":"Haryono A, Sungkono AR, Santosa BJ, Widodo A, Ramadhany B (2020) Model parameter estimation and its uncertainty for 2-d inclined sheet structure in self-potential data using crow search algorithm. Acta Geod Geoph 55:691\u2013715","journal-title":"Acta Geod Geoph"},{"key":"8408_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.07.045","volume":"219","author":"Y He","year":"2021","unstructured":"He Y, Wang X (2021) Group theory-based optimization algorithm for solving knapsack problems. Knowl-Based Syst 219:104445. https:\/\/doi.org\/10.1016\/j.knosys.2018.07.045","journal-title":"Knowl-Based Syst"},{"issue":"9","key":"8408_CR34","doi-asserted-by":"publisher","first-page":"1476","DOI":"10.1360\/crad20070905","volume":"44","author":"Y He","year":"2007","unstructured":"He Y, Wang X, Kou Y (2007) A binary differential evolution algorithm with hybrid encoding. J Comput Res Dev 44(9):1476\u20131484. https:\/\/doi.org\/10.1360\/crad20070905","journal-title":"J Comput Res Dev"},{"key":"8408_CR35","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1007\/s10489-016-0806-y","volume":"45","author":"KE Heraguemi","year":"2016","unstructured":"Heraguemi KE, Kamel N, Drias H (2016) Multi-swarm bat algorithm for association rule mining using multiple cooperative strategies. Appl Intell 45:1021\u20131033","journal-title":"Appl Intell"},{"key":"8408_CR36","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10589-012-9521-8","volume":"55","author":"A Husseinzadeh Kashan","year":"2013","unstructured":"Husseinzadeh Kashan A, Kashan A, Nahavandi N (2013) A novel differential evolution algorithm for binary optimization. Comput Optim Appl 55:481\u2013513. https:\/\/doi.org\/10.1007\/s10589-012-9521-8","journal-title":"Comput Optim Appl"},{"key":"8408_CR37","doi-asserted-by":"publisher","first-page":"9955","DOI":"10.3390\/app15189955","volume":"15","author":"A Ihsan","year":"2025","unstructured":"Ihsan A, Sag T (2025) Binary puma optimizer: a novel approach for solving 0\u20131 knapsack problems and the uncapacitated facility location problem. Appl Sci 15:9955","journal-title":"Appl Sci"},{"issue":"2","key":"8408_CR38","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K Jain","year":"2001","unstructured":"Jain K, Vazirani VV (2001) Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. J ACM (JACM) 48(2):274\u2013296. https:\/\/doi.org\/10.1145\/375827.375845","journal-title":"J ACM (JACM)"},{"issue":"13","key":"8408_CR39","doi-asserted-by":"publisher","first-page":"11063","DOI":"10.1007\/s00521-022-07058-y","volume":"34","author":"E Kaya","year":"2022","unstructured":"Kaya E (2022) Bingso: galactic swarm optimization powered by binary artificial algae algorithm for solving uncapacitated facility location problems. Neural Comput Appl 34(13):11063\u201311082. https:\/\/doi.org\/10.1007\/s00521-022-07058-y","journal-title":"Neural Comput Appl"},{"key":"8408_CR40","doi-asserted-by":"publisher","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN\u201995-International Conference on Neural Networks, Vol 4. IEEE, pp 1942\u20131948. https:\/\/doi.org\/10.1109\/ICNN.1995.488968","DOI":"10.1109\/ICNN.1995.488968"},{"key":"8408_CR41","doi-asserted-by":"publisher","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, Vol 5. IEEE, pp 4104\u20134108. https:\/\/doi.org\/10.1109\/ICSMC.1997.637339","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"8408_CR42","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.asoc.2015.04.007","volume":"33","author":"MS Kiran","year":"2015","unstructured":"Kiran MS (2015) The continuous artificial bee colony algorithm for binary optimization. Appl Soft Comput 33:15\u201323. https:\/\/doi.org\/10.1016\/j.asoc.2015.04.007","journal-title":"Appl Soft Comput"},{"key":"8408_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114817","volume":"175","author":"MS Kiran","year":"2021","unstructured":"Kiran MS (2021) A binary artificial bee colony algorithm and its performance assessment. Expert Syst Appl 175:114817. https:\/\/doi.org\/10.1016\/j.eswa.2021.114817","journal-title":"Expert Syst Appl"},{"issue":"8","key":"8408_CR44","doi-asserted-by":"publisher","first-page":"2307","DOI":"10.3906\/elk-1203-104","volume":"21","author":"MS Kiran","year":"2013","unstructured":"Kiran MS, G\u00fcnd\u00fcz M (2013) Xor-based artificial bee colony algorithm for binary optimization. Turk J Electr Eng Comput Sci 21(8):2307\u20132328. https:\/\/doi.org\/10.3906\/elk-1203-104","journal-title":"Turk J Electr Eng Comput Sci"},{"key":"8408_CR45","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1007\/s13042-017-0772-7","volume":"9","author":"S Korkmaz","year":"2018","unstructured":"Korkmaz S, Babalik A, Kiran MS (2018) An artificial algae algorithm for solving binary optimization problems. Int J Mach Learn Cybern 9:1233\u20131247. https:\/\/doi.org\/10.1007\/s13042-017-0772-7","journal-title":"Int J Mach Learn Cybern"},{"key":"8408_CR46","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.asoc.2018.01.001","volume":"64","author":"S Korkmaz","year":"2018","unstructured":"Korkmaz S, Kiran MS (2018) An artificial algae algorithm with stigmergic behavior for binary optimization. Appl Soft Comput 64:627\u2013640. https:\/\/doi.org\/10.1016\/j.asoc.2018.01.001","journal-title":"Appl Soft Comput"},{"issue":"1","key":"8408_CR47","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1051\/ro:2001107","volume":"35","author":"J Kratica","year":"2001","unstructured":"Kratica J, To\u0161ic D, Filipovi\u0107 V, Ljubi\u0107 I (2001) Solving the simple plant location problem by genetic algorithm. RAIRO-Operations Res 35(1):127\u2013142. https:\/\/doi.org\/10.1051\/ro:2001107","journal-title":"RAIRO-Operations Res"},{"issue":"4","key":"8408_CR48","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1287\/mnsc.9.4.643","volume":"9","author":"AA Kuehn","year":"1963","unstructured":"Kuehn AA, Hamburger MJ (1963) A heuristic program for locating warehouses. Manage Sci 9(4):643\u2013666. https:\/\/doi.org\/10.1287\/mnsc.9.4.643","journal-title":"Manage Sci"},{"key":"8408_CR49","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/j.procs.2020.03.420","volume":"167","author":"S Laabadi","year":"2020","unstructured":"Laabadi S, Naimi M, El Amri H, Achchab B (2020) A binary crow search algorithm for solving two-dimensional bin packing problem with fixed orientation. Procedia Comput Sci 167:809\u2013818","journal-title":"Procedia Comput Sci"},{"key":"8408_CR50","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. https:\/\/doi.org\/10.1016\/j.asoc.2019.105645","journal-title":"Appl Soft Comput"},{"key":"8408_CR51","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.knosys.2018.08.003","volume":"161","author":"M Mafarja","year":"2018","unstructured":"Mafarja M, Aljarah I, Heidari AA, Faris H, Fournier-Viger P, Li X, Mirjalili S (2018) Binary dragonfly optimization for feature selection using time-varying transfer functions. Knowl-Based Syst 161:185\u2013204. https:\/\/doi.org\/10.1016\/j.knosys.2018.08.003","journal-title":"Knowl-Based Syst"},{"key":"8408_CR52","doi-asserted-by":"publisher","unstructured":"Mafarja M, Eleyan D, Abdullah S, Mirjalili S (2017) S-shaped vs. v-shaped transfer functions for ant lion optimization algorithm in feature selection problem. In Proceedings of the international conference on future networks and distributed systems, pp 1\u20137. https:\/\/doi.org\/10.1145\/3102304.3102325","DOI":"10.1145\/3102304.3102325"},{"key":"8408_CR53","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.knosys.2019.01.006","volume":"168","author":"Z Meng","year":"2019","unstructured":"Meng Z, Pan J-S, Tseng K-K (2019) Pade: an enhanced differential evolution algorithm with novel control parameter adaptation schemes for numerical optimization. Knowl-Based Syst 168:80\u201399. https:\/\/doi.org\/10.1016\/j.knosys.2019.01.006","journal-title":"Knowl-Based Syst"},{"key":"8408_CR54","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1016\/s0377-2217(03)00247-9","volume":"157","author":"L Michel","year":"2004","unstructured":"Michel L, Van Hentenryck P (2004) A simple tabu search for warehouse location. Eur J Oper Res 157:576\u2013591. https:\/\/doi.org\/10.1016\/s0377-2217(03)00247-9","journal-title":"Eur J Oper Res"},{"key":"8408_CR55","doi-asserted-by":"publisher","first-page":"5617","DOI":"10.1007\/s10489-024-05441-x","volume":"54","author":"D Peidro Pay\u00e1","year":"2024","unstructured":"Peidro Pay\u00e1 D, Martin XA, Panadero J, Juan AA (2024) Solving the uncapacitated facility location problem under uncertainty: a hybrid tabu search with path-relinking simheuristic approach. Appl Intell 54:5617\u20135638","journal-title":"Appl Intell"},{"issue":"10","key":"8408_CR56","doi-asserted-by":"publisher","first-page":"5901","DOI":"10.1007\/s00521-019-04067-2","volume":"32","author":"K Prasanna Kumar","year":"2020","unstructured":"Prasanna Kumar K, Kousalya K (2020) Amelioration of task scheduling in cloud computing using crow search algorithm. Neural Comput Appl 32(10):5901\u20135907. https:\/\/doi.org\/10.1007\/s00521-019-04067-2","journal-title":"Neural Comput Appl"},{"key":"8408_CR57","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31306-0","volume-title":"Differential evolution: a practical approach to global optimization","author":"K Price","year":"2006","unstructured":"Price K, Storn RM, Lampinen JA (2006) Differential evolution: a practical approach to global optimization. Springer Science & Business Media, Berlin. https:\/\/doi.org\/10.1007\/3-540-31306-0"},{"key":"8408_CR58","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2025.112968","volume":"174","author":"T Sag","year":"2025","unstructured":"Sag T, Ihsan A (2025) Efficiency analysis of binary metaheuristic optimization algorithms for uncapacitated facility location problems. Appl Soft Comput 174:112968","journal-title":"Appl Soft Comput"},{"key":"8408_CR59","doi-asserted-by":"publisher","unstructured":"Schrage L (2009) Implicit representation of variable upper bounds in linear programming. In Computational Practice in Mathematical Programming. Springer, pp 118\u2013132. https:\/\/doi.org\/10.1007\/bf01588948","DOI":"10.1007\/bf01588948"},{"issue":"21","key":"8408_CR60","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(21):14669\u201314685. https:\/\/doi.org\/10.1007\/s00521-021-06107-2","journal-title":"Neural Comput Appl"},{"key":"8408_CR61","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.119956","volume":"224","author":"E Sonu\u00e7","year":"2023","unstructured":"Sonu\u00e7 E, \u00d6zcan E (2023) An adaptive parallel evolutionary algorithm for solving the uncapacitated facility location problem. Expert Syst Appl 224:119956. https:\/\/doi.org\/10.1016\/j.eswa.2023.119956","journal-title":"Expert Syst Appl"},{"key":"8408_CR62","doi-asserted-by":"publisher","DOI":"10.1016\/j.jobe.2024.111725","volume":"100","author":"H Sun","year":"2025","unstructured":"Sun H, Zhu K, Zhang W, Ke Z, Hu H, Wu K, Zhang T (2025) Emergency path planning based on improved ant colony algorithm. J Build Eng 100:111725","journal-title":"J Build Eng"},{"key":"8408_CR63","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.eswa.2018.08.027","volume":"114","author":"Y Sun","year":"2018","unstructured":"Sun Y, Wang X, Chen Y, Liu Z (2018) A modified whale optimization algorithm for large-scale global optimization problems. Expert Syst Appl 114:563\u2013577. https:\/\/doi.org\/10.1016\/j.eswa.2018.08.027","journal-title":"Expert Syst Appl"},{"key":"8408_CR64","unstructured":"Syswerda G et al (1989) Uniform crossover in genetic algorithms. In ICGA Vol 3. pp 2\u20139. https:\/\/doi.org\/10.5555\/645512.657265"},{"issue":"4","key":"8408_CR65","doi-asserted-by":"publisher","first-page":"3201","DOI":"10.3233\/jifs-169263","volume":"32","author":"K Tsuya","year":"2017","unstructured":"Tsuya K, Takaya M, Yamamura A (2017) Application of the firefly algorithm to the uncapacitated facility location problem. J Intell Fuzzy Syst 32(4):3201\u20133208. https:\/\/doi.org\/10.3233\/jifs-169263","journal-title":"J Intell Fuzzy Syst"},{"key":"8408_CR66","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105522","volume":"97","author":"P Upadhyay","year":"2020","unstructured":"Upadhyay P, Chhabra JK (2020) Kapur\u2019s entropy based optima multilevel image segmentation using crow search algorithm. Appl Soft Comput 97:105522. https:\/\/doi.org\/10.1016\/j.asoc.2019.105522","journal-title":"Appl Soft Comput"},{"key":"8408_CR67","doi-asserted-by":"crossref","unstructured":"Wang C, Fan D, Liu Y, Ren S, Wang J (2025) Dual-resource flexible job shop scheduling considering worker proficiency differences. Comput Operations Res, p 107216","DOI":"10.1016\/j.cor.2025.107216"},{"key":"8408_CR68","doi-asserted-by":"crossref","unstructured":"Wang S-S, Liu H-L, Li Y-M, Gao F, Qin S-J, Wen Q-Y (2024) Variational quantum algorithm-preserving feasible space for solving the uncapacitated facility location problem. Adv Quantum Technol, p 2400201","DOI":"10.1002\/qute.202400201"},{"issue":"1","key":"8408_CR69","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.jcde.2015.06.003","volume":"3","author":"M Yazdani","year":"2016","unstructured":"Yazdani M, Jolai F (2016) Lion optimization algorithm (loa): a nature-inspired metaheuristic algorithm. J Comput Des Eng 3(1):24\u201336. https:\/\/doi.org\/10.1016\/j.jcde.2015.06.003","journal-title":"J Comput Des Eng"},{"key":"8408_CR70","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118978","volume":"213","author":"F Zhang","year":"2023","unstructured":"Zhang F, He Y, Ouyang H, Li W (2023) A fast and efficient discrete evolutionary algorithm for the uncapacitated facility location problem. Expert Syst Appl 213:118978. https:\/\/doi.org\/10.1016\/j.eswa.2022.118978","journal-title":"Expert Syst Appl"},{"key":"8408_CR71","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.swevo.2019.04.002","volume":"48","author":"Y Zhong","year":"2019","unstructured":"Zhong Y, Wang L, Lin M, Zhang H (2019) Discrete pigeon-inspired optimization algorithm with metropolis acceptance criterion for large-scale traveling salesman problem. Swarm Evol Comput 48:134\u2013144. https:\/\/doi.org\/10.1016\/j.swevo.2019.04.002","journal-title":"Swarm Evol Comput"},{"key":"8408_CR72","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101567","volume":"87","author":"F Zhu","year":"2024","unstructured":"Zhu F, Shuai Z, Lu Y, Su H, Yu R, Li X, Zhao Q, Shuai J (2024) obabc: a one-dimensional binary artificial bee colony algorithm for binary optimization. Swarm Evol Comput 87:101567","journal-title":"Swarm Evol Comput"},{"issue":"14","key":"8408_CR73","doi-asserted-by":"publisher","first-page":"9541","DOI":"10.1016\/j.ijhydene.2020.12.107","volume":"46","author":"Y Zhu","year":"2021","unstructured":"Zhu Y, Yousefi N (2021) Optimal parameter identification of pemfc stacks using adaptive sparrow search algorithm. Int J Hydrogen Energy 46(14):9541\u20139552. https:\/\/doi.org\/10.1016\/j.ijhydene.2020.12.107","journal-title":"Int J Hydrogen Energy"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08408-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08408-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08408-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T07:33:19Z","timestamp":1773214399000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08408-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,11]]},"references-count":73,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2026,3]]}},"alternative-id":["8408"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08408-6","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,11]]},"assertion":[{"value":"15 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 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 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"}}],"article-number":"239"}}