{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T20:59:27Z","timestamp":1775854767595,"version":"3.50.1"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T00:00:00Z","timestamp":1700784000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T00:00:00Z","timestamp":1700784000000},"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":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s00521-023-09200-w","type":"journal-article","created":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T15:02:10Z","timestamp":1700838130000},"page":"2797-2834","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["A new binary coati optimization algorithm for binary optimization problems"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6252-9012","authenticated-orcid":false,"given":"G\u00fclnur","family":"Yildizdan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emine","family":"Bas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,24]]},"reference":[{"issue":"9","key":"9200_CR1","doi-asserted-by":"crossref","first-page":"5477","DOI":"10.1007\/s00521-018-3375-7","volume":"31","author":"M Abdel-Basset","year":"2019","unstructured":"Abdel-Basset M, El-Shahat D, El-Henawy I (2019) Solving 0\u20131 knapsack problem by binary flower pollination algorithm. Neural Comput Appl 31(9):5477\u20135495","journal-title":"Neural Comput Appl"},{"key":"9200_CR2","doi-asserted-by":"crossref","first-page":"106949","DOI":"10.1016\/j.cie.2020.106949","volume":"151","author":"M Abdel-Basset","year":"2021","unstructured":"Abdel-Basset M, Mohamed R, Chakrabortty RK, Ryan M, Mirjalili S (2021) New binary marine predators optimization algorithms for 0\u20131 knapsack problems. Comput Ind Eng 151:106949","journal-title":"Comput Ind Eng"},{"key":"9200_CR3","doi-asserted-by":"crossref","first-page":"106946","DOI":"10.1016\/j.cie.2020.106946","volume":"151","author":"M Abdel-Basset","year":"2021","unstructured":"Abdel-Basset M, Mohamed R, Mirjalili S (2021) A binary equilibrium optimization algorithm for 0\u20131 knapsack problems. Comput Ind Eng 151:106946","journal-title":"Comput Ind Eng"},{"key":"9200_CR4","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/j.aej.2022.12.025","volume":"67","author":"M Abdel-Basset","year":"2023","unstructured":"Abdel-Basset M, Mohamed R, Abouhawwash M, Alshamrani AM, Mohamed AW, Sallam K (2023) Binary light spectrum optimizer for knapsack problems: an improved model. Alex Eng J 67:609\u2013632","journal-title":"Alex Eng J"},{"key":"9200_CR5","doi-asserted-by":"crossref","first-page":"103282","DOI":"10.1016\/j.advengsoft.2022.103282","volume":"174","author":"B Abdollahzadeh","year":"2022","unstructured":"Abdollahzadeh B, Gharehchopogh FS, Khodadadi N, Mirjalili S (2022) Mountain gazelle optimizer: a new nature-inspired metaheuristic algorithm for global optimization problems. Adv Eng Softw 174:103282","journal-title":"Adv Eng Softw"},{"key":"9200_CR6","doi-asserted-by":"crossref","first-page":"3423","DOI":"10.1007\/s00366-021-01470-z","volume":"38","author":"B Abdollahzadeh","year":"2022","unstructured":"Abdollahzadeh B, Barshandeh S, Javadi H et al (2022) An enhanced binary slime mould algorithm for solving the 0\u20131 knapsack problem. Eng Comput 38:3423\u20133444","journal-title":"Eng Comput"},{"key":"9200_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107250","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Yousri D, Elaziz MA, Ewees AA, Al-qaness MA, Gandomi AH (2021) Aquila optimizer: a novel meta-heuristic optimization algorithm. Comput Ind Eng. https:\/\/doi.org\/10.1016\/j.cie.2021.107250","journal-title":"Comput Ind Eng"},{"issue":"1","key":"9200_CR8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10586-020-03075-5","volume":"24","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Diabat A (2021) A novel hybrid antlion optimization algorithm for multi-objective task scheduling problems in cloud computing environments. Cluster Comput 24(1):205\u2013223","journal-title":"Cluster Comput"},{"key":"9200_CR9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s40747-021-00351-8","volume":"8","author":"P Agrawal","year":"2021","unstructured":"Agrawal P, Ganesh T, Mohamed AW (2021) Solving knapsack problems using a binary gaining sharing knowledge-based optimization algorithm. Complex Intell Syst 8:43\u201363","journal-title":"Complex Intell Syst"},{"key":"9200_CR10","doi-asserted-by":"crossref","first-page":"107283","DOI":"10.1016\/j.knosys.2021.107283","volume":"228","author":"S Ahmed","year":"2021","unstructured":"Ahmed S, Ghosh KK, Mirjalili S, Sarkar R (2021) AIEOU: Automata-based improved equilibrium optimizer with U-shaped transfer function for feature selection. Knowl Based Syst 228:107283","journal-title":"Knowl Based Syst"},{"key":"9200_CR11","doi-asserted-by":"crossref","first-page":"105576","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 J 82:105576","journal-title":"Appl Soft Comput J"},{"issue":"1","key":"9200_CR12","first-page":"31","volume":"2204","author":"M Azad","year":"2013","unstructured":"Azad M, Rocha AMA, Fernandes EM (2013) A simplified binary artificial fish swarm algorithm for uncapacitated facility location problems. Lecture Notes Eng Comput Sci 2204(1):31\u201336","journal-title":"Lecture Notes Eng Comput Sci"},{"key":"9200_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-022-10173-w","author":"M Azizi","year":"2022","unstructured":"Azizi M, Talatahari S, Gandomi AH (2022) Fire Hawk optimizer: a novel metaheuristic algorithm. Artif Intell Rev. https:\/\/doi.org\/10.1007\/s10462-022-10173-w","journal-title":"Artif Intell Rev"},{"key":"9200_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10462-022-10173-w","volume":"56","author":"M Azizi","year":"2023","unstructured":"Azizi M, Talatahari S, Gandomi AH (2023) Fire Hawk optimizer: a novel metaheuristic algorithm. Artif Intell Rev 56:287\u2013363. https:\/\/doi.org\/10.1007\/s10462-022-10173-w","journal-title":"Artif Intell Rev"},{"key":"9200_CR15","doi-asserted-by":"crossref","first-page":"113185","DOI":"10.1016\/j.eswa.2020.113185","volume":"146","author":"E Ba\u015f","year":"2020","unstructured":"Ba\u015f E, Ulker E (2020) An efficient binary social spider algorithm for feature selection problem. Expert Syst Appl 146:113185","journal-title":"Expert Syst Appl"},{"key":"9200_CR16","doi-asserted-by":"crossref","first-page":"113618","DOI":"10.1016\/j.eswa.2020.113618","volume":"161","author":"E Ba\u015f","year":"2020","unstructured":"Ba\u015f E, Ulker E (2020) A binary social spider algorithm for uncapacitated facility location problem. Expert Syst Appl 161:113618","journal-title":"Expert Syst Appl"},{"key":"9200_CR17","doi-asserted-by":"crossref","first-page":"105592","DOI":"10.1016\/j.engappai.2022.105592","volume":"118","author":"E Ba\u015f","year":"2023","unstructured":"Ba\u015f E (2023) Binary aquila optimizer for 0\u20131 knapsack problems. Eng Appl Artif Intell 118:105592","journal-title":"Eng Appl Artif Intell"},{"issue":"11","key":"9200_CR18","doi-asserted-by":"crossref","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 Oper Res Soc 41(11):1069\u20131072","journal-title":"J Oper Res Soc"},{"issue":"3","key":"9200_CR19","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/S0377-2217(03)00244-3","volume":"157","author":"A Billionnet","year":"2004","unstructured":"Billionnet A, Soutif E (2004) An exact method based on Lagrangian decomposition for the 0\u20131 quadratic knapsack problem. Eur J Oper Res 157(3):565\u2013575","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9200_CR20","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1287\/ijoc.2016.0742","volume":"29","author":"A Bettinelli","year":"2017","unstructured":"Bettinelli A, Cacchiani V, Malaguti E et al (2017) A branch-andbound algorithm for the knapsack problem with conflict graph. Informs J Comput 29(3):457\u2013473","journal-title":"Informs J Comput"},{"issue":"1","key":"9200_CR21","doi-asserted-by":"crossref","first-page":"011703","DOI":"10.1115\/1.4047437","volume":"143","author":"Y Chen","year":"2021","unstructured":"Chen Y, Yan J, Feng J, Sareh P (2021) Particle swarm optimization-based metaheuristic design generation of non-trivial flat-foldable origami tessellations with degree-4 vertices. J Mech Des 143(1):011703","journal-title":"J Mech Des"},{"issue":"5","key":"9200_CR22","first-page":"1765","volume":"9","author":"Y Chen","year":"2022","unstructured":"Chen Y, Lu C, Yan J, Feng J, Sareh P (2022) Intelligent computational design of scalene-faceted flat-foldable tessellations. J Comput Des Eng 9(5):1765\u20131774","journal-title":"J Comput Des Eng"},{"key":"9200_CR23","doi-asserted-by":"crossref","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","journal-title":"Comput Ind Eng"},{"issue":"4","key":"9200_CR24","doi-asserted-by":"crossref","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","journal-title":"Comput Ind Eng"},{"issue":"4","key":"9200_CR25","doi-asserted-by":"publisher","first-page":"e0266537","DOI":"10.1371\/journal.pone.0266537","volume":"17","author":"BT Dang","year":"2022","unstructured":"Dang BT, Truong TK (2022) Binary salp swarm algorithm for discounted 0\u20131 knapsack problem. PLoS ONE 17(4):e0266537. https:\/\/doi.org\/10.1371\/journal.pone.0266537","journal-title":"PLoS ONE"},{"key":"9200_CR26","doi-asserted-by":"crossref","unstructured":"Daskin M, Snyder L, Berger R (2003) Facility location in supply chain design. In: Logistics systems: design and optimization, pp 39\u201365","DOI":"10.1007\/0-387-24977-X_2"},{"key":"9200_CR27","doi-asserted-by":"crossref","first-page":"110011","DOI":"10.1016\/j.knosys.2022.110011","volume":"259","author":"M Dehghani","year":"2023","unstructured":"Dehghani M, Montazeri Z, Trojovsk\u00e1 E, Trojovsk\u00fd P (2023) Coati optimization algorithm: a new bio-inspired metaheuristic algorithm for solving optimization problems. Knowl Based Syst 259:110011","journal-title":"Knowl Based Syst"},{"key":"9200_CR28","doi-asserted-by":"crossref","first-page":"109080","DOI":"10.1016\/j.cie.2023.109080","volume":"178","author":"B Ervural","year":"2023","unstructured":"Ervural B, Hakli H (2023) A binary reptile search algorithm based on transfer functions with a new stochastic repair method for 0\u20131 knapsack problems. Comput Ind Eng 178:109080","journal-title":"Comput Ind Eng"},{"key":"9200_CR29","doi-asserted-by":"crossref","first-page":"43979","DOI":"10.1109\/ACCESS.2019.2908489","volume":"7","author":"AE Ezugwu","year":"2019","unstructured":"Ezugwu AE et al (2019) A comparative study of meta-heuristic optimization algorithms for 0\u20131 knapsack problem: some initial results. IEEE Access 7:43979\u201344001","journal-title":"IEEE Access"},{"key":"9200_CR30","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.knosys.2018.05.009","volume":"154","author":"H Faris","year":"2018","unstructured":"Faris H, Mafarja MM, Heidari AA, Aljarah I, Al-Zoubi AM, Mirjalili S, Fujita H (2018) An efficient binary salp swarm algorithm with crossover scheme for feature selection problems. Knowl Based Syst 154:43\u201367","journal-title":"Knowl Based Syst"},{"key":"9200_CR31","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the CEC\u20192005 special session on real parameter optimization. J Heuristics 15:617\u2013644","journal-title":"J Heuristics"},{"key":"9200_CR32","doi-asserted-by":"crossref","unstructured":"Geem ZW (2005). Harmony search in water pump switching problem. In: International conference on natural computation. Springer, pp 751\u2013760","DOI":"10.1007\/11539902_92"},{"key":"9200_CR33","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/6502807","author":"SS Guo","year":"2020","unstructured":"Guo SS, Wang J, Guo M (2020) Z-shaped transfer functions for binary particle swarm optimization algorithm. Comput Intell Neurosci. https:\/\/doi.org\/10.1155\/2020\/6502807","journal-title":"Comput Intell Neurosci"},{"key":"9200_CR34","doi-asserted-by":"publisher","first-page":"12761","DOI":"10.1007\/s00500-022-07285-4","volume":"26","author":"SA Harifi","year":"2022","unstructured":"Harifi SA (2022) Binary ancient-inspired giza pyramids construction metaheuristic algorithm for solving 0\u20131 knapsack problem. Soft Comput 26:12761\u201312778. https:\/\/doi.org\/10.1007\/s00500-022-07285-4","journal-title":"Soft Comput"},{"key":"9200_CR35","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.matcom.2021.08.013","volume":"192","author":"FA Hashim","year":"2022","unstructured":"Hashim FA, Houssein EH, Hussain K, Mabrouk MS, Al-Atabany W (2022) Honey Badger algorithm: new metaheuristic algorithm for solving optimization problems. Math Comput Simul 192:84\u2013110. https:\/\/doi.org\/10.1016\/j.matcom.2021.08.013. ISSN 0378-4754","journal-title":"Math Comput Simul"},{"key":"9200_CR36","doi-asserted-by":"crossref","first-page":"101022","DOI":"10.1016\/j.swevo.2021.101022","volume":"69","author":"Y He","year":"2022","unstructured":"He Y, Zhang F, Mirjalili S, Zhang T (2022) Novel binary differential evolution algorithm based on Taper-shaped transfer functions for binary optimization problems. Swarm Evol Comput 69:101022","journal-title":"Swarm Evol Comput"},{"key":"9200_CR37","doi-asserted-by":"crossref","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","journal-title":"Comput Ind Eng"},{"issue":"6","key":"9200_CR38","first-page":"1455","volume":"24","author":"M Karakoyun","year":"2021","unstructured":"Karakoyun M, G\u00fclc\u00fc \u015e, Kodaz H (2021) D-MOSG: Discrete multi-objective shuffled gray wolf optimizer for multi-level image thresholding. Eng Sci Technol Int J 24(6):1455\u20131466","journal-title":"Eng Sci Technol Int J"},{"key":"9200_CR39","doi-asserted-by":"crossref","first-page":"109590","DOI":"10.1016\/j.asoc.2022.109590","volume":"129","author":"M Karakoyun","year":"2022","unstructured":"Karakoyun M, Ozkis A (2022) A binary tree seed algorithm with selection-based local search mechanism for huge-sized optimization problems. Appl Soft Comput 129:109590","journal-title":"Appl Soft Comput"},{"key":"9200_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04067-3","volume-title":"Metaheuristics: outlines, MATLAB codes and examples","author":"A Kaveh","year":"2019","unstructured":"Kaveh A, Bakhshpoori T (2019) Metaheuristics: outlines, MATLAB codes and examples. Springer, New York. https:\/\/doi.org\/10.1007\/978-3-030-04067-3"},{"key":"9200_CR41","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:11063\u201311082. https:\/\/doi.org\/10.1007\/s00521-022-07058-y","journal-title":"Neural Comput Appl"},{"key":"9200_CR42","doi-asserted-by":"crossref","first-page":"114817","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","journal-title":"Expert Syst Appl"},{"issue":"1","key":"9200_CR43","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/(SICI)1520-6750(200002)47:1<57::AID-NAV4>3.0.CO;2-4","volume":"47","author":"K Klamroth","year":"2000","unstructured":"Klamroth K, Wiecek MM (2000) Dynamic programming approaches to the multiple criteria knapsack problem. Nav Res Logist 47(1):57\u201376","journal-title":"Nav Res Logist"},{"key":"9200_CR44","doi-asserted-by":"crossref","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","journal-title":"Appl Soft Comput"},{"issue":"4","key":"9200_CR45","doi-asserted-by":"crossref","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","journal-title":"Manage Sci"},{"issue":"16\u201318","key":"9200_CR46","doi-asserted-by":"crossref","first-page":"1883","DOI":"10.1016\/j.tcs.2009.12.004","volume":"411","author":"X Li","year":"2010","unstructured":"Li X, Liu T (2010) On exponential time lower bound of knapsack under backtracking. Theor Comput Sci 411(16\u201318):1883\u20131888","journal-title":"Theor Comput Sci"},{"issue":"5","key":"9200_CR47","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"R Merkle","year":"1978","unstructured":"Merkle R, Hellman M (1978) Hiding information and signatures in trapdoor knapsacks. IEEE Trans Inf Theory 24(5):525\u2013530","journal-title":"IEEE Trans Inf Theory"},{"key":"9200_CR48","doi-asserted-by":"crossref","unstructured":"Rao, Z., Tung, P. Y., Xie, R., Wei, Y., Zhang, H., Ferrari, A., ... & Raabe, D. (2022). Machine learning\u2013enabled high-entropy alloy discovery.\u00a0Science,\u00a0378(6615), 78\u201385.","DOI":"10.1126\/science.abo4940"},{"key":"9200_CR49","volume-title":"Information technology and mobile communication. AIM 2011. Communications in computer and information science","author":"S Saha","year":"2011","unstructured":"Saha S, Kole A, Dey K (2011) A modified continuous particle swarm optimization algorithm for uncapacitated facility location problem. In: Das VV, Thomas G, Lumban Gaol F (eds) Information technology and mobile communication. AIM 2011. Communications in computer and information science, vol 147. Springer, Berlin"},{"key":"9200_CR50","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1007\/s40996-021-00704-w","volume":"46","author":"D Sedlar","year":"2022","unstructured":"Sedlar D, Lozina Z, Tomac I (2022) Discrete optimization of truss structures using variable neighborhood search. Iran J Sci Technol Trans Civ Eng 46:1249\u20131264. https:\/\/doi.org\/10.1007\/s40996-021-00704-w","journal-title":"Iran J Sci Technol Trans Civ Eng"},{"key":"9200_CR51","doi-asserted-by":"publisher","first-page":"5751","DOI":"10.1007\/s10489-021-02717-4","volume":"52","author":"Z Shu","year":"2022","unstructured":"Shu Z, Ye Z, Zong X et al (2022) A modified hybrid rice optimization algorithm for solving 0\u20131 knapsack problem. Appl Intell 52:5751\u20135769. https:\/\/doi.org\/10.1007\/s10489-021-02717-4","journal-title":"Appl Intell"},{"issue":"3","key":"9200_CR52","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1145\/333623.333627","volume":"30","author":"SS Skiena","year":"1999","unstructured":"Skiena SS (1999) Who is interested in algorithms and why? Lessons from the Stony Brook Algorithm Repository. ACM SIGACT News 30(3):65\u201374","journal-title":"ACM SIGACT News"},{"key":"9200_CR53","doi-asserted-by":"crossref","first-page":"14669","DOI":"10.1007\/s00521-021-06107-2","volume":"33","author":"E Sonuc","year":"2021","unstructured":"Sonuc E (2021) Binary crow search algorithm for the uncapacitated facility location problem. Neural Comput Appl 33:14669\u201314685","journal-title":"Neural Comput Appl"},{"key":"9200_CR54","doi-asserted-by":"crossref","first-page":"119956","DOI":"10.1016\/j.eswa.2023.119956","volume":"224","author":"E Sonuc","year":"2023","unstructured":"Sonuc E, Ozcan E (2023) An adaptive parallel evolutionary algorithm for solving the uncapacitated facility location problem. Expert Syst Appl 224:119956","journal-title":"Expert Syst Appl"},{"key":"9200_CR55","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-022-07761-w","author":"MH Sulaiman","year":"2022","unstructured":"Sulaiman MH, Mustaffa Z, Saari MM et al (2022) Evolutionary mating algorithm. Neural Comput Appl. https:\/\/doi.org\/10.1007\/s00521-022-07761-w","journal-title":"Neural Comput Appl"},{"key":"9200_CR56","doi-asserted-by":"publisher","first-page":"3101","DOI":"10.1007\/s00521-018-3808-3","volume":"32","author":"I Tariq","year":"2020","unstructured":"Tariq I et al (2020) MOGSABAT: a metaheuristic hybrid algorithm for solving multi-objective optimisation problems. Neural Comput Appl 32:3101\u20133115. https:\/\/doi.org\/10.1007\/s00521-018-3808-3","journal-title":"Neural Comput Appl"},{"key":"9200_CR57","doi-asserted-by":"crossref","unstructured":"Yang X-S (2011) Metaheuristic optimization: algorithm analysis and open problems. In: International symposium on experimental algorithms. Springer, pp 21\u201332","DOI":"10.1007\/978-3-642-20662-7_2"},{"key":"9200_CR58","doi-asserted-by":"publisher","DOI":"10.1007\/s11063-023-11171-x","author":"G Yildizdan","year":"2023","unstructured":"Yildizdan G, Ba\u015f E (2023) A novel binary artificial jellyfish search algorithm for solving 0\u20131 knapsack problems. Neural Process Lett. https:\/\/doi.org\/10.1007\/s11063-023-11171-x","journal-title":"Neural Process Lett"},{"key":"9200_CR59","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s13042-022-01703-7","volume":"15","author":"M Xi","year":"2022","unstructured":"Xi M, Song Q, Xu M et al (2022) Binary African vultures optimization algorithm for various optimization problems. Int J Mach Learn Cyber 15:15. https:\/\/doi.org\/10.1007\/s13042-022-01703-7","journal-title":"Int J Mach Learn Cyber"},{"issue":"1","key":"9200_CR60","doi-asserted-by":"crossref","first-page":"118978","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(1):118978","journal-title":"Expert Syst Appl"},{"issue":"2","key":"9200_CR61","first-page":"233","volume":"55","author":"Y Zhou","year":"2021","unstructured":"Zhou Y, Zhao M, Fan M, Wang Y, Wang J (2021) An efficient local search for large-scale set-union knapsack problem. Data Technol Appl 55(2):233\u2013250","journal-title":"Data Technol Appl"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-09200-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-09200-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-09200-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,23]],"date-time":"2024-01-23T07:09:02Z","timestamp":1705993742000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-09200-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,24]]},"references-count":61,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["9200"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-09200-w","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,24]]},"assertion":[{"value":"14 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2023","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"}}]}}