{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T01:56:29Z","timestamp":1775008589388,"version":"3.50.1"},"reference-count":95,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T00:00:00Z","timestamp":1700524800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T00:00:00Z","timestamp":1700524800000},"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 & Applic"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s00521-023-09190-9","type":"journal-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T16:02:45Z","timestamp":1700582565000},"page":"2573-2595","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["MBVS: a modified binary vortex search algorithm for solving uncapacitated facility location problem"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7459-3035","authenticated-orcid":false,"given":"Murat","family":"Aslan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Pavone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"9190_CR1","doi-asserted-by":"crossref","unstructured":"Norton RD, Hazell PB (1986) Mathematical programming for economic analysis in agriculture. Macmillan New York, NY, USA","DOI":"10.2307\/2531573"},{"key":"9190_CR2","doi-asserted-by":"crossref","unstructured":"Akan T, Agahian S, Dehkharghani R (2022) BinBRO: binary battle royale optimizer algorithm. Expert Syst Appl 116599","DOI":"10.1016\/j.eswa.2022.116599"},{"key":"9190_CR3","doi-asserted-by":"publisher","first-page":"1659","DOI":"10.1007\/s00521-013-1402-2","volume":"24","author":"A Ouaarab","year":"2014","unstructured":"Ouaarab A, Ahiod B, Yang X-S (2014) Discrete cuckoo search algorithm for the travelling salesman problem. Neural Comput Appl 24:1659\u20131669","journal-title":"Neural Comput Appl"},{"key":"9190_CR4","doi-asserted-by":"publisher","first-page":"107275","DOI":"10.1016\/j.asoc.2021.107275","volume":"105","author":"M Gunduz","year":"2021","unstructured":"Gunduz M, Aslan M (2021) DJAYA: a discrete Jaya algorithm for solving traveling salesman problem. Appl Soft Comput 105:107275","journal-title":"Appl Soft Comput"},{"key":"9190_CR5","doi-asserted-by":"publisher","first-page":"2111","DOI":"10.1016\/j.cor.2011.10.016","volume":"39","author":"VC Li","year":"2012","unstructured":"Li VC, Liang Y-C, Chang H-F (2012) Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method. Comput Oper Res 39:2111\u20132121","journal-title":"Comput Oper Res"},{"key":"9190_CR6","doi-asserted-by":"publisher","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 82:105576","journal-title":"Appl Soft Comput"},{"key":"9190_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0377-2217(98)00039-3","volume":"114","author":"K Holmberg","year":"1999","unstructured":"Holmberg K (1999) Exact solution methods for uncapacitated location problems with convex transportation costs. Eur J Oper Res 114:127\u2013140","journal-title":"Eur J Oper Res"},{"key":"9190_CR8","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0360-8352(86)90085-9","volume":"11","author":"R Radharamanan","year":"1986","unstructured":"Radharamanan R, Choi L (1986) A branch and bound algorithm for the travelling salesman and the transportation routing problems. Comput Ind Eng 11:236\u2013240","journal-title":"Comput Ind Eng"},{"key":"9190_CR9","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0377-2217(85)90151-1","volume":"21","author":"B Fleischmann","year":"1985","unstructured":"Fleischmann B (1985) A cutting plane procedure for the travelling salesman problem on road networks. Eur J Oper Res 21:307\u2013317","journal-title":"Eur J Oper Res"},{"key":"9190_CR10","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1057\/jors.1980.188","volume":"31","author":"G Laporte","year":"1980","unstructured":"Laporte G, Nobert Y (1980) A cutting planes algorithm for the m-salesmen problem. J Oper Res Soc 31:1017\u20131023","journal-title":"J Oper Res Soc"},{"key":"9190_CR11","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1287\/mnsc.48.4.550.208","volume":"48","author":"D Bertsimas","year":"2002","unstructured":"Bertsimas D, Demir R (2002) An approximate dynamic programming approach to multidimensional knapsack problems. Manag Sci 48:550\u2013565","journal-title":"Manag Sci"},{"key":"9190_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.ejor.2006.02.058","volume":"186","author":"S Balev","year":"2008","unstructured":"Balev S, Yanev N, Fr\u00e9ville A, Andonov R (2008) A dynamic programming based reduction procedure for the multidimensional 0\u20131 knapsack problem European. J Oper Res 186:63\u201376","journal-title":"J Oper Res"},{"key":"9190_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. OR Spectrum 12:79\u201388","journal-title":"OR Spectrum"},{"key":"9190_CR14","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MW, Vance PH (1998) Branch-and-price: column generation for solving huge integer programs. Oper Res 46:316\u2013329","journal-title":"Oper Res"},{"key":"9190_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","volume":"6","author":"M Padberg","year":"1987","unstructured":"Padberg M, Rinaldi G (1987) Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Oper Res Lett 6:1\u20137","journal-title":"Oper Res Lett"},{"key":"9190_CR16","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.dam.2003.09.013","volume":"145","author":"H Hern\u00e1ndez-P\u00e9rez","year":"2004","unstructured":"Hern\u00e1ndez-P\u00e9rez H, Salazar-Gonz\u00e1lez J-J (2004) A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discrete Appl Math 145:126\u2013139","journal-title":"Discrete Appl Math"},{"key":"9190_CR17","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.ins.2016.05.037","volume":"367","author":"A Banitalebi","year":"2016","unstructured":"Banitalebi A, Aziz MIA, Aziz ZA (2016) A self-adaptive binary differential evolution algorithm for large scale binary optimization problems. Inf Sci 367:487\u2013511","journal-title":"Inf Sci"},{"key":"9190_CR18","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S Guha","year":"1999","unstructured":"Guha S, Khuller S (1999) Greedy strikes back: improved facility location algorithms. J Algorithms 31:228\u2013248","journal-title":"J Algorithms"},{"key":"9190_CR19","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1287\/opre.43.4.661","volume":"43","author":"PC Jones","year":"1995","unstructured":"Jones PC, Lowe TJ, Muller G, Xu N, Ye Y, Zydiak JL (1995) Specially structured uncapacitated facility location problems. Oper Res 43:661\u2013669","journal-title":"Oper Res"},{"key":"9190_CR20","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.asoc.2015.04.020","volume":"33","author":"S Mahmoudi","year":"2015","unstructured":"Mahmoudi S, Lotfi S (2015) Modified cuckoo optimization algorithm (MCOA) to solve graph coloring problem. Appl Soft Comput 33:48\u201364","journal-title":"Appl Soft Comput"},{"key":"9190_CR21","doi-asserted-by":"publisher","first-page":"2535","DOI":"10.1016\/j.eswa.2013.10.001","volume":"41","author":"J Luo","year":"2014","unstructured":"Luo J, Chen M-R (2014) Improved shuffled frog leaping algorithm and its multi-phase model for multi-depot vehicle routing problem. Expert Syst Appl 41:2535\u20132545","journal-title":"Expert Syst Appl"},{"key":"9190_CR22","doi-asserted-by":"publisher","first-page":"8167","DOI":"10.1007\/s00500-017-2760-y","volume":"22","author":"A Hatamlou","year":"2018","unstructured":"Hatamlou A (2018) Solving travelling salesman problem using black hole algorithm. Soft Comput 22:8167\u20138175","journal-title":"Soft Comput"},{"key":"9190_CR23","doi-asserted-by":"publisher","first-page":"6686","DOI":"10.1016\/j.eswa.2015.04.055","volume":"42","author":"MS Kiran","year":"2015","unstructured":"Kiran MS (2015) TSA: tree-seed algorithm for continuous optimization. Expert Syst Appl 42:6686\u20136698","journal-title":"Expert Syst Appl"},{"key":"9190_CR24","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.asoc.2015.03.003","volume":"31","author":"SA Uymaz","year":"2015","unstructured":"Uymaz SA, Tezel G, Yel E (2015) Artificial algae algorithm (AAA) for nonlinear global optimization. Appl Soft Comput 31:153\u2013171","journal-title":"Appl Soft Comput"},{"key":"9190_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103541","volume":"90","author":"S Kaur","year":"2020","unstructured":"Kaur S, Awasthi LK, Sangal A, Dhiman G (2020) Tunicate Swarm Algorithm: a new bio-inspired based metaheuristic paradigm for global optimization. Eng Appl Artif Intell 90:103541","journal-title":"Eng Appl Artif Intell"},{"key":"9190_CR26","first-page":"19","volume":"7","author":"R Rao","year":"2016","unstructured":"Rao R (2016) Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int J Ind Eng Comput 7:19\u201334","journal-title":"Int J Ind Eng Comput"},{"key":"9190_CR27","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.future.2020.03.055","volume":"111","author":"S Li","year":"2020","unstructured":"Li S, Chen H, Wang M, Heidari AA, Mirjalili S (2020) Slime mould algorithm: a new method for stochastic optimization. Future Gener Comput Syst 111:300\u2013323","journal-title":"Future Gener Comput Syst"},{"key":"9190_CR28","doi-asserted-by":"publisher","first-page":"6374","DOI":"10.1016\/j.eswa.2013.05.041","volume":"40","author":"E Cuevas","year":"2013","unstructured":"Cuevas E, Cienfuegos M, Zald\u00edvar D, P\u00e9rez-Cisneros M (2013) A swarm optimization algorithm inspired in the behavior of the social-spider. Expert Syst Appl 40:6374\u20136384","journal-title":"Expert Syst Appl"},{"key":"9190_CR29","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":"9190_CR30","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ins.2014.08.053","volume":"293","author":"B Do\u011fan","year":"2015","unstructured":"Do\u011fan B, \u00d6lmez T (2015) A new metaheuristic for numerical function optimization: vortex Search algorithm. Inf Sci 293:125\u2013145","journal-title":"Inf Sci"},{"key":"9190_CR31","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.advengsoft.2015.01.010","volume":"83","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili S (2015) The ant lion optimizer. Adv Eng Softw 83:80\u201398","journal-title":"Adv Eng Softw"},{"key":"9190_CR32","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.advengsoft.2017.07.002","volume":"114","author":"S Mirjalili","year":"2017","unstructured":"Mirjalili S, Gandomi AH, Mirjalili SZ, Saremi S, Faris H, Mirjalili SM (2017) Salp Swarm Algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Softw 114:163\u2013191","journal-title":"Adv Eng Softw"},{"key":"9190_CR33","doi-asserted-by":"crossref","unstructured":"Yang X-S (2010) A new metaheuristic bat-inspired algorithm. In: Nature inspired cooperative strategies for optimization (NICSO 2010). Springer, pp 65\u201374","DOI":"10.1007\/978-3-642-12538-6_6"},{"key":"9190_CR34","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","journal-title":"Comput Struct"},{"key":"9190_CR35","unstructured":"Gould N (2006) An introduction to algorithms for continuous optimization. Oxford University Computing Laboratory Notes"},{"key":"9190_CR36","doi-asserted-by":"crossref","unstructured":"Aslan M, Baykan NA (2016) A performance comparison of graph coloring algorithms. Int J Intell Syst Appl Eng 1\u20137","DOI":"10.18201\/ijisae.273053"},{"key":"9190_CR37","doi-asserted-by":"crossref","unstructured":"Consoli P, Pavone M (2013) O-BEE-COL: optimal BEEs for COLoring graphs. In: Artificial Evolution: 11th international conference, evolution artificielle, EA 2013, Bordeaux, France, October 21\u201323, 2013. Revised Selected Papers 11, 2014. Springer, pp 243\u2013255","DOI":"10.1007\/978-3-319-11683-9_19"},{"key":"9190_CR38","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1016\/j.neucom.2015.08.041","volume":"173","author":"X Zhou","year":"2016","unstructured":"Zhou X, Gao DY, Yang C, Gui W (2016) Discrete state transition algorithm for unconstrained integer optimization problems. Neurocomputing 173:864\u2013874","journal-title":"Neurocomputing"},{"key":"9190_CR39","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.asoc.2015.01.068","volume":"30","author":"M Mahi","year":"2015","unstructured":"Mahi M, Baykan \u00d6K, Kodaz H (2015) A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem. Appl Soft Comput 30:484\u2013490","journal-title":"Appl Soft Comput"},{"key":"9190_CR40","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.asoc.2015.10.043","volume":"38","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Chen X, Zhou G (2016) An improved monkey algorithm for a 0\u20131 knapsack problem. Appl Soft Comput 38:817\u2013830","journal-title":"Appl Soft Comput"},{"key":"9190_CR41","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1080\/18756891.2016.1256577","volume":"9","author":"Y Feng","year":"2016","unstructured":"Feng Y, Wang G-G, Gao X-Z (2016) A novel hybrid cuckoo search algorithm with global harmony search for 0\u20131 knapsack problems. Int J Comput Intell Syst 9:1174\u20131190","journal-title":"Int J Comput Intell Syst"},{"key":"9190_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2014\/573731","volume":"2014","author":"W-l Xiang","year":"2014","unstructured":"Xiang W-l, An M-q, Li Y-z, He R-c, Zhang J-f (2014) A novel discrete global-best harmony search algorithm for solving 0\u20131 knapsack problems. Discrete Dyn Nat Soc 2014:1\u201312","journal-title":"Discrete Dyn Nat Soc"},{"key":"9190_CR43","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s13042-017-0731-3","volume":"10","author":"M Abdel-Basset","year":"2019","unstructured":"Abdel-Basset M, El-Shahat D, Sangaiah AK (2019) A modified nature inspired meta-heuristic whale optimization algorithm for solving 0\u20131 knapsack problem. Int J Mach Learn Cybern 10:495\u2013514","journal-title":"Int J Mach Learn Cybern"},{"key":"9190_CR44","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.asoc.2016.02.027","volume":"43","author":"X Zhang","year":"2016","unstructured":"Zhang X, Wu C, Li J, Wang X, Yang Z, Lee J-M, Jung K-H (2016) Binary artificial algae algorithm for multidimensional knapsack problems. Appl Soft Comput 43:583\u2013595","journal-title":"Appl Soft Comput"},{"key":"9190_CR45","doi-asserted-by":"publisher","first-page":"5337","DOI":"10.1016\/j.eswa.2015.02.015","volume":"42","author":"X Kong","year":"2015","unstructured":"Kong X, Gao L, Ouyang H, Li S (2015) A simplified binary harmony search algorithm for large scale 0\u20131 knapsack problems. Expert Syst Appl 42:5337\u20135355","journal-title":"Expert Syst Appl"},{"key":"9190_CR46","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1080\/1055678021000090033","volume":"17","author":"P Festa","year":"2002","unstructured":"Festa P, Pardalos PM, Resende MG, Ribeiro CC (2002) Randomized heuristics for the MAX-CUT problem. Optim Methods Softw 17:1033\u20131058","journal-title":"Optim Methods Softw"},{"key":"9190_CR47","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10732-011-9189-8","volume":"19","author":"GA Kochenberger","year":"2013","unstructured":"Kochenberger GA, Hao J-K, L\u00fc Z, Wang H, Glover F (2013) Solving large scale max cut problems via tabu search. J Heurist 19:565\u2013571","journal-title":"J Heurist"},{"key":"9190_CR48","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1287\/ijoc.1080.0275","volume":"21","author":"R Mart\u00ed","year":"2009","unstructured":"Mart\u00ed R, Duarte A, Laguna M (2009) Advanced scatter search for the max-cut problem. INFORMS J Comput 21:26\u201338","journal-title":"INFORMS J Comput"},{"key":"9190_CR49","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.renene.2017.12.087","volume":"121","author":"M Be\u015fkirli","year":"2018","unstructured":"Be\u015fkirli M, Ko\u00e7 \u0130, Hakl\u0131 H, Kodaz H (2018) A new optimization algorithm for solving wind turbine placement problem: binary artificial algae algorithm. Renew Energy 121:301\u2013308","journal-title":"Renew Energy"},{"key":"9190_CR50","doi-asserted-by":"crossref","unstructured":"Aslan M, Gunduz M, Kiran MS (2020) A Jaya-based approach to wind turbine placement problem. Energy Sources Part A: Recov Util Enviro Effects 1\u201320","DOI":"10.1080\/15567036.2020.1805528"},{"key":"9190_CR51","first-page":"56","volume":"26","author":"M Be\u015fkirli","year":"2019","unstructured":"Be\u015fkirli M, Koc I, Kodaz H (2019) Optimal placement of wind turbines using novel binary invasive weed optimization. Tehni\u010dki vjesnik 26:56\u201363","journal-title":"Tehni\u010dki vjesnik"},{"key":"9190_CR52","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1016\/j.neucom.2014.07.030","volume":"149","author":"Y Chen","year":"2015","unstructured":"Chen Y, Xie W, Zou X (2015) A binary differential evolution algorithm learning from explored solutions. Neurocomputing 149:1038\u20131047","journal-title":"Neurocomputing"},{"key":"9190_CR53","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","journal-title":"Expert Syst Appl"},{"key":"9190_CR54","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","journal-title":"Comput Ind Eng"},{"key":"9190_CR55","doi-asserted-by":"crossref","unstructured":"Korkmaz S, Babalik A, Kiran MS (2017) An artificial algae algorithm for solving binary optimization problems. Int J Mach Learn Cybern 1\u201315","DOI":"10.1007\/s13042-017-0772-7"},{"key":"9190_CR56","doi-asserted-by":"crossref","unstructured":"Cinar AC, Kiran MS (2017) Similarity and logic gate-based tree-seed algorithms for binary optimization. Comput Ind Eng","DOI":"10.1016\/j.cie.2017.12.009"},{"key":"9190_CR57","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":"9190_CR58","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.asoc.2015.07.023","volume":"36","author":"E Hancer","year":"2015","unstructured":"Hancer E, Xue B, Karaboga D, Zhang M (2015) A binary ABC algorithm based on advanced similarity scheme for feature selection. Appl Soft Comput 36:334\u2013348. https:\/\/doi.org\/10.1016\/j.asoc.2015.07.023","journal-title":"Appl Soft Comput"},{"key":"9190_CR59","doi-asserted-by":"publisher","first-page":"2307","DOI":"10.3906\/elk-1203-104","volume":"21","author":"MS Kiran","year":"2013","unstructured":"Kiran MS, Gunduz M (2013) XOR-based artificial bee colony algorithm for binary optimization. Turk J Electr Eng Comput Sci 21:2307\u20132328","journal-title":"Turk J Electr Eng Comput Sci"},{"key":"9190_CR60","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10589-012-9521-8","volume":"55","author":"MH Kashan","year":"2013","unstructured":"Kashan MH, Kashan AH, Nahavandi N (2013) A novel differential evolution algorithm for binary optimization. Comput Optim Appl 55:481\u2013513","journal-title":"Comput Optim Appl"},{"key":"9190_CR61","doi-asserted-by":"crossref","unstructured":"Sevkli M, Guner A (2006) A continuous particle swarm optimization algorithm for uncapacitated facility location problem. Ant Colony Optim Swarm Intell 316\u2013323","DOI":"10.1007\/11839088_28"},{"key":"9190_CR62","doi-asserted-by":"publisher","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":"9190_CR63","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113185","volume":"146","author":"B Emine","year":"2020","unstructured":"Emine B, \u00dclker E (2020) An efficient binary social spider algorithm for feature selection problem. Expert Syst Appl 146:113185","journal-title":"Expert Syst Appl"},{"key":"9190_CR64","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.neucom.2015.06.083","volume":"172","author":"E Emary","year":"2016","unstructured":"Emary E, Zawbaa HM, Hassanien AE (2016) Binary grey wolf optimization approaches for feature selection. Neurocomputing 172:371\u2013381","journal-title":"Neurocomputing"},{"key":"9190_CR65","first-page":"496","volume":"34","author":"L-Y Qiao","year":"2006","unstructured":"Qiao L-Y, Peng X-Y, Peng Y (2006) BPSO-SVM wrapper for feature subset selection. Acta Electonica Sin 34:496","journal-title":"Acta Electonica Sin"},{"key":"9190_CR66","doi-asserted-by":"publisher","first-page":"3954","DOI":"10.1109\/TSMC.2019.2956121","volume":"51","author":"S Gao","year":"2019","unstructured":"Gao S, Yu Y, Wang Y, Wang J, Cheng J, Zhou M (2019) Chaotic local search-based differential evolution algorithms for optimization. MIEEE Trans Syst Man Cybern Syst 51:3954\u20133967","journal-title":"MIEEE Trans Syst Man Cybern Syst"},{"key":"9190_CR67","unstructured":"Hristakeva M, Shrestha D (2004) Solving the 0\u20131 knapsack problem with genetic algorithms. In: Midwest instruction and computing symposium"},{"key":"9190_CR68","unstructured":"Holland J (1975) Adaption in natural and artificial systems. Ann Arbor MI: The University of Michigan Press"},{"key":"9190_CR69","doi-asserted-by":"crossref","unstructured":"Crawford B, Soto R, Astorga G, Garc\u00eda J, Castro C, Paredes F (2017) Putting continuous metaheuristics to work in binary search spaces. Complexity","DOI":"10.1155\/2017\/8404231"},{"key":"9190_CR70","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.09.002","volume":"9","author":"S Mirjalili","year":"2013","unstructured":"Mirjalili S, Lewis A (2013) S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization. Swarm Evol Comput 9:1\u201314. https:\/\/doi.org\/10.1016\/j.swevo.2012.09.002","journal-title":"Swarm Evol Comput"},{"key":"9190_CR71","doi-asserted-by":"crossref","unstructured":"Kashan MH, Nahavandi N, Kashan AH (2011) DisABC: a new articial bee colony algorithm for binary optimization. Appl Soft Comput","DOI":"10.1016\/j.asoc.2011.08.038"},{"key":"9190_CR72","unstructured":"Cornu\u00e9jols G, Nemhauser G, Wolsey L (1983) The uncapicitated facility location problem. Cornell University Operations Research and Industrial Engineering"},{"key":"9190_CR73","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703405754","volume":"33","author":"FA Chudak","year":"2003","unstructured":"Chudak FA, Shmoys DB (2003) Improved approximation algorithms for the uncapacitated facility location problem. SIAM J Comput 33:1\u201325","journal-title":"SIAM J Comput"},{"key":"9190_CR74","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1111\/j.1475-3995.1998.tb00111.x","volume":"5","author":"A Klose","year":"1998","unstructured":"Klose A (1998) A branch and bound algorithm for an uncapacitated facility location problem with a side constraint. Int Trans Oper Res 5:155\u2013168","journal-title":"Int Trans Oper Res"},{"key":"9190_CR75","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1016\/S0305-0548(02)00049-7","volume":"30","author":"B Goldengorin","year":"2003","unstructured":"Goldengorin B, Ghosh D, Sierksma G (2003) Branch and peg algorithms for the simple plant location problem. Comput Oper Res 30:967\u2013981","journal-title":"Comput Oper Res"},{"key":"9190_CR76","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:91\u2013103","journal-title":"Ann Oper Res"},{"key":"9190_CR77","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","journal-title":"J Heuristics"},{"key":"9190_CR78","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/S0305-0548(01)00021-1","volume":"29","author":"JH Jaramillo","year":"2002","unstructured":"Jaramillo JH, Bhadury J, Batta R (2002) On the use of genetic algorithms to solve location problems. Comput Oper Res 29:761\u2013779","journal-title":"Comput Oper Res"},{"key":"9190_CR79","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1016\/j.cor.2003.09.008","volume":"32","author":"H Topcuoglu","year":"2005","unstructured":"Topcuoglu H, Corut F, Ermis M, Yilmaz G (2005) Solving the uncapacitated hub location problem using genetic algorithms. Comput Oper Res 32:967\u2013984","journal-title":"Comput Oper Res"},{"key":"9190_CR80","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: IEEE international conference on systems, man, and cybernetics, computational cybernetics and simulation. IEEE, pp 4104\u20134108","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"9190_CR81","doi-asserted-by":"crossref","unstructured":"Babao\u011flu \u0130 (2016) Utilization of bat algorithm for solving uncapacitated facility location problem. In: Intelligent and evolutionary systems. Springer, pp 199\u2013208","DOI":"10.1007\/978-3-319-27000-5_16"},{"key":"9190_CR82","doi-asserted-by":"publisher","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":"9190_CR83","unstructured":"Azad M, Kalam A, Rocha AMA, Fernandes EMdG (2013) A simplified binary artificial fish swarm algorithm for uncapacitated facility location problems. In: World congress on engineering 2013, WCE 2013, 2013. Newswood Limited Publisher, pp 31\u201336"},{"key":"9190_CR84","doi-asserted-by":"crossref","unstructured":"Hakli H (2020) BinEHO: a new binary variant based on elephant herding optimization algorithm. Neural Comput Appl 32:16971\u201316991","DOI":"10.1007\/s00521-020-04917-4"},{"key":"9190_CR85","doi-asserted-by":"crossref","unstructured":"Gharehchopogh FS, Maleki I, Dizaji ZA (2021) Chaotic vortex search algorithm: metaheuristic algorithm for feature selection. Evol Intell 1\u201332","DOI":"10.1007\/s12065-021-00590-1"},{"key":"9190_CR86","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1016\/j.aeue.2015.05.005","volume":"69","author":"B Do\u011fan","year":"2015","unstructured":"Do\u011fan B, \u00d6lmez T (2015) Vortex search algorithm for the analog active filter component selection problem. AEU Int J Electron Commun 69:1243\u20131253","journal-title":"AEU Int J Electron Commun"},{"key":"9190_CR87","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.ins.2017.03.026","volume":"402","author":"A \u00d6zk\u0131\u015f","year":"2017","unstructured":"\u00d6zk\u0131\u015f A, Babal\u0131k A (2017) A novel metaheuristic for multi-objective optimization problems: the multi-objective vortex search algorithm. Inf Sci 402:124\u2013148","journal-title":"Inf Sci"},{"key":"9190_CR88","doi-asserted-by":"crossref","unstructured":"Montoya O, Garrido V, Grisales-Nore\u00f1a L (2021) Optimal power dispatch of dispersed sources in direct-current networks with nonlinear loads. In: Journal of Physics: Conference Series, 2021. vol 1. IOP Publishing, p 012009","DOI":"10.1088\/1742-6596\/2135\/1\/012009"},{"key":"9190_CR89","doi-asserted-by":"publisher","first-page":"418","DOI":"10.3390\/fluids6110418","volume":"6","author":"D Ramirez-Brewer","year":"2021","unstructured":"Ramirez-Brewer D, Montoya OD, Useche Vivero J, Garc\u00eda-Zapateiro L (2021) Characterization and modeling of the viscoelastic behavior of hydrocolloid-based films using classical and fractional rheological models. Fluids 6:418","journal-title":"Fluids"},{"key":"9190_CR90","doi-asserted-by":"publisher","first-page":"1833","DOI":"10.1016\/j.renene.2019.08.046","volume":"146","author":"A Fathy","year":"2020","unstructured":"Fathy A, Abd Elaziz M, Alharbi AG (2020) A novel approach based on hybrid vortex search algorithm and differential evolution for identifying the optimal parameters of PEM fuel cell. Renew Energy 146:1833\u20131845","journal-title":"Renew Energy"},{"key":"9190_CR91","doi-asserted-by":"crossref","unstructured":"Wang C, Liu P, Zhang T, Sun J (2018) The adaptive vortex search algorithm of optimal path planning for forest fire rescue UAV. In: 2018 IEEE 3rd advanced information technology, electronic and automation control conference (IAEAC). IEEE, pp 400\u2013403","DOI":"10.1109\/IAEAC.2018.8577733"},{"key":"9190_CR92","doi-asserted-by":"publisher","first-page":"2050155","DOI":"10.1142\/S0218126620501558","volume":"29","author":"S Yadav","year":"2020","unstructured":"Yadav S, Yadav R, Kumar A, Kumar M (2020) Design of optimal two-dimensional FIR filters with quadrantally symmetric properties using vortex search algorithm. J Circuits Syst Comput 29:2050155","journal-title":"J Circuits Syst Comput"},{"key":"9190_CR93","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1016\/j.asoc.2010.07.019","volume":"11","author":"D Zou","year":"2011","unstructured":"Zou D, Gao L, Li S, Wu J (2011) Solving 0\u20131 knapsack problem by a novel global harmony search algorithm. Appl Soft Comput 11:1556\u20131564","journal-title":"Appl Soft Comput"},{"key":"9190_CR94","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.2307\/2582903","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) Or-library\u2014distributing test problems by electronic mail. J Oper Res Soc 41:1069\u20131072. https:\/\/doi.org\/10.2307\/2582903","journal-title":"J Oper Res Soc"},{"key":"9190_CR95","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.amc.2014.10.072","volume":"251","author":"E Monabbati","year":"2015","unstructured":"Monabbati E, Kakhki HT (2015) On a class of subadditive duals for the uncapacitated facility location problem. Appl Math Comput 251:118\u2013131. https:\/\/doi.org\/10.1016\/j.amc.2014.10.072","journal-title":"Appl Math Comput"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-09190-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-09190-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-09190-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,19]],"date-time":"2024-01-19T17:13:53Z","timestamp":1705684433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-09190-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,21]]},"references-count":95,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["9190"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-09190-9","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,21]]},"assertion":[{"value":"19 April 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":"21 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":"There are no conflicts of interest declared by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}