{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T18:31:31Z","timestamp":1773253891328,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T00:00:00Z","timestamp":1646265600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T00:00:00Z","timestamp":1646265600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s00521-022-07058-y","type":"journal-article","created":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T11:07:26Z","timestamp":1646305646000},"page":"11063-11082","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["BinGSO: galactic swarm optimization powered by binary artificial algae algorithm for solving uncapacitated facility location problems"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5668-5078","authenticated-orcid":false,"given":"Ersin","family":"Kaya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,3]]},"reference":[{"key":"7058_CR1","unstructured":"Islam M (2020) Optimization of the critical production process in a textile factory using AHP. Department of Mechanical and Production Engineering, Islamic University of Technology"},{"key":"7058_CR2","doi-asserted-by":"crossref","unstructured":"Kotary J et al (2021). End-to-end constrained optimization learning: a survey. arXiv preprint arXiv: https:\/\/arxiv.org\/abs\/2103.16378","DOI":"10.24963\/ijcai.2021\/610"},{"key":"7058_CR3","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/B978-0-12-405163-8.00007-7","volume-title":"Swarm intelligence and bio-inspired computation","author":"J Krause","year":"2013","unstructured":"Krause J et al (2013) A survey of swarm algorithms applied to discrete optimization problems. Swarm intelligence and bio-inspired computation. Elsevier, pp 169\u2013191"},{"key":"7058_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-021-10042-y","author":"Z-H Zhan","year":"2021","unstructured":"Zhan Z-H et al (2021) A survey on evolutionary computation for complex continuous optimization. Artif Intell Rev. https:\/\/doi.org\/10.1007\/s10462-021-10042-y","journal-title":"Artif Intell Rev"},{"key":"7058_CR5","unstructured":"Christensen HI et al (2016) Multidimensional bin packing and other related problems: a survey"},{"issue":"1","key":"7058_CR6","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/nav.3800220110","volume":"22","author":"HM Salkin","year":"1975","unstructured":"Salkin HM, De Kluyver CA (1975) The knapsack problem: a survey. Nav Res Logist Q 22(1):127\u2013144","journal-title":"Nav Res Logist Q"},{"issue":"1","key":"7058_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10479-019-03385-x","volume":"292","author":"D C Turkoglu","year":"2020","unstructured":"Turkoglu D C, Genevois M E (2020) A comparative survey of service facility location problems. Ann Oper Res 292(1):399\u2013468. https:\/\/doi.org\/10.1007\/s10479-019-03385-x","journal-title":"Ann Oper Res"},{"issue":"12","key":"7058_CR8","doi-asserted-by":"crossref","first-page":"5337","DOI":"10.1016\/j.eswa.2015.02.015","volume":"42","author":"XY Kong","year":"2015","unstructured":"Kong XY et al (2015) A simplified binary harmony search algorithm for large scale 0\u20131 knapsack problems. Expert Syst Appl 42(12):5337\u20135355","journal-title":"Expert Syst Appl"},{"issue":"6","key":"7058_CR9","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1080\/0305215X.2019.1624740","volume":"52","author":"AG Hussien","year":"2020","unstructured":"Hussien AG et al (2020) New binary whale optimization algorithm for discrete optimization problems. Eng Optim 52(6):945\u2013959","journal-title":"Eng Optim"},{"key":"7058_CR10","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1016\/j.neucom.2014.07.030","volume":"149","author":"Y Chen","year":"2015","unstructured":"Chen Y, Xie WC, Zou XF (2015) A binary differential evolution algorithm learning from explored solutions. Neurocomputing 149:1038\u20131047","journal-title":"Neurocomputing"},{"key":"7058_CR11","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.ins.2014.12.016","volume":"299","author":"Z Beheshti","year":"2015","unstructured":"Beheshti Z, Shamsuddin SM, Hasan S (2015) Memetic binary particle swarm optimization for discrete optimization problems. Inf Sci 299:58\u201384","journal-title":"Inf Sci"},{"key":"7058_CR12","doi-asserted-by":"publisher","first-page":"106560","DOI":"10.1016\/j.knosys.2020.106560","volume":"211","author":"G Dhiman","year":"2021","unstructured":"Dhiman G, Oliva D, Kaur A, Singh K K, Vimal S, Sharma A, Cengiz K (2021) BEPO: a novel binary emperor penguin optimizer for automatic feature selection. Knowl Based Syst 211:106560. https:\/\/doi.org\/10.1016\/j.knosys.2020.106560","journal-title":"Knowl Based Syst"},{"key":"7058_CR13","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.knosys.2017.03.032","volume":"130","author":"F Jiang","year":"2017","unstructured":"Jiang F et al (2017) A new binary hybrid particle swarm optimization with wavelet mutation. Knowl-Based Syst 130:90\u2013101","journal-title":"Knowl-Based Syst"},{"key":"7058_CR14","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.knosys.2013.04.003","volume":"48","author":"L Wang","year":"2013","unstructured":"Wang L, Zheng XL, Wang SY (2013) A novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem. Knowl-Based Syst 48:17\u201323","journal-title":"Knowl-Based Syst"},{"key":"7058_CR15","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.ins.2014.10.060","volume":"297","author":"C Ozturk","year":"2015","unstructured":"Ozturk C, Hancer E, Karaboga D (2015) A novel binary artificial bee colony algorithm based on genetic operators. Inf Sci 297:154\u2013170","journal-title":"Inf Sci"},{"key":"7058_CR16","doi-asserted-by":"publisher","first-page":"105586","DOI":"10.1016\/j.knosys.2020.105586","volume":"194","author":"\u0130 G\u00f6lc\u00fck","year":"2020","unstructured":"G\u00f6lc\u00fck \u0130, Ozsoydan F B (2020) Evolutionary and adaptive inheritance enhanced grey wolf Optimization algorithm for binary domains. Knowl-Based Syst 194:105586. https:\/\/doi.org\/10.1016\/j.knosys.2020.105586","journal-title":"Knowl-Based Syst"},{"key":"7058_CR17","doi-asserted-by":"publisher","first-page":"105645","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":"7058_CR18","doi-asserted-by":"crossref","unstructured":"Kaya E, Kiran MS (2017) An improved binary artificial bee colony algorithm. In: 2017 15th international conference on ict and knowledge engineering (Ict&Ke) pp 29\u201334","DOI":"10.1109\/ICTKE.2017.8259617"},{"key":"7058_CR19","doi-asserted-by":"crossref","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"},{"issue":"17","key":"7058_CR20","doi-asserted-by":"crossref","first-page":"12953","DOI":"10.1007\/s00500-020-04718-w","volume":"24","author":"E Bas","year":"2020","unstructured":"Bas E, Ulker E (2020) A binary social spider algorithm for continuous optimization task. Soft Comput 24(17):12953\u201312979","journal-title":"Soft Comput"},{"key":"7058_CR21","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"},{"key":"7058_CR22","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.engappai.2015.01.002","volume":"40","author":"H Nezamabadi-pour","year":"2015","unstructured":"Nezamabadi-pour H (2015) A quantum-inspired gravitational search algorithm for binary encoded optimization problems. Eng Appl Artif Intell 40:62\u201375","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"7058_CR23","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/S0377-2217(02)00504-0","volume":"150","author":"D Ghosh","year":"2003","unstructured":"Ghosh D (2003) Neighborhood search heuristics for the uncapacitated facility location problem. Eur J Oper Res 150(1):150\u2013162","journal-title":"Eur J Oper Res"},{"issue":"2","key":"7058_CR24","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0166-218X(87)90024-2","volume":"18","author":"HH Yanasse","year":"1987","unstructured":"Yanasse HH, Soma NY (1987) A new enumeration scheme for the knapsack-problem. Discret Appl Math 18(2):235\u2013245","journal-title":"Discret Appl Math"},{"issue":"10","key":"7058_CR25","doi-asserted-by":"crossref","first-page":"2329","DOI":"10.1093\/ietisy\/e88-d.10.2329","volume":"88","author":"RJW James","year":"2005","unstructured":"James RJW, Nakagawa Y (2005) Enumeration methods for repeatedly solving multidimensional knapsack sub-problems. IEICE Trans Inf Syst 88(10):2329\u20132340","journal-title":"IEICE Trans Inf Syst"},{"key":"7058_CR26","doi-asserted-by":"crossref","unstructured":"Lalami ME, El-Baz D (2012) GPU implementation of the branch and bound method for knapsack problems. In: 2012 IEEE 26th International parallel and distributed processing symposium workshops and phd forum. pp 1769\u20131777","DOI":"10.1109\/IPDPSW.2012.219"},{"issue":"5","key":"7058_CR27","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/ecj.10180","volume":"94","author":"H Tohyama","year":"2011","unstructured":"Tohyama H, Ida K, Matsueda J (2011) A genetic algorithm for the uncapacitated facility location problem. Electron Commun Jpn 94(5):47\u201354","journal-title":"Electron Commun Jpn"},{"key":"7058_CR28","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. Smc '97 conference proceedings. In: 1997 IEEE international conference on systems, man, and cybernetics. 1\u20135: 4104\u20134108","DOI":"10.1109\/ICSMC.1997.637339"},{"issue":"9","key":"7058_CR29","doi-asserted-by":"crossref","first-page":"2590","DOI":"10.1016\/j.cor.2005.07.006","volume":"33","author":"P Greistorfer","year":"2006","unstructured":"Greistorfer P, Rego C (2006) A simple filter-and-fan approach to the facility location problem. Comput Oper Res 33(9):2590\u20132601","journal-title":"Comput Oper Res"},{"key":"7058_CR30","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":"7","key":"7058_CR31","doi-asserted-by":"crossref","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(7):1233\u20131247","journal-title":"Int J Mach Learn Cybern"},{"key":"7058_CR32","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":"6","key":"7058_CR33","doi-asserted-by":"crossref","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(6):761\u2013779","journal-title":"Comput Oper Res"},{"key":"7058_CR34","first-page":"220","volume":"135","author":"A Forestiero","year":"2005","unstructured":"Forestiero A, Mastroianni C, Spezzano G (2005) A Multi-agent approach for the construction of a peer-to-peer information system in grids. Self-Organization Auton Inform 135:220\u2013236","journal-title":"Self-Organization Auton Inform"},{"issue":"2","key":"7058_CR35","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10723-007-9062-z","volume":"6","author":"A Forestiero","year":"2008","unstructured":"Forestiero A, Mastroianni C, Spezzano G (2008) Building a peer-to-peer information system in grids via self-organizing agents. J Grid Comput 6(2):125\u2013140","journal-title":"J Grid Comput"},{"issue":"6","key":"7058_CR36","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1016\/j.comnet.2009.10.024","volume":"54","author":"F Dressler","year":"2010","unstructured":"Dressler F, Akan OB (2010) A survey on bio-inspired networking. Comput Netw 54(6):881\u2013900","journal-title":"Comput Netw"},{"issue":"7","key":"7058_CR37","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1002\/1527-2648(20020717)4:7<461::AID-ADEM461>3.0.CO;2-K","volume":"4","author":"E Dujardin","year":"2002","unstructured":"Dujardin E, Mann S (2002) Bio-inspired materials chemistry. Adv Eng Mater 4(7):461\u2013474","journal-title":"Adv Eng Mater"},{"key":"7058_CR38","unstructured":"Eberhart RC, Shi YH (2001) Particle swarm optimization: developments, applications and resources. In: Proceedings of the 2001 congress on evolutionary computation.1, 2: 81\u201386"},{"issue":"4","key":"7058_CR39","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"issue":"1","key":"7058_CR40","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8(1):687\u2013697","journal-title":"Appl Soft Comput"},{"key":"7058_CR41","doi-asserted-by":"crossref","unstructured":"Yang X-S (2009) Firefly algorithms for multimodal optimization. In: International symposium on stochastic algorithms. Springer","DOI":"10.1007\/978-3-642-04944-6_14"},{"key":"7058_CR42","doi-asserted-by":"crossref","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":"7058_CR43","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/j.asoc.2016.02.027","volume":"43","author":"XD Zhang","year":"2016","unstructured":"Zhang XD et al (2016) Binary artificial algae algorithm for multidimensional knapsack problems. Appl Soft Comput 43:583\u2013595","journal-title":"Appl Soft Comput"},{"issue":"3","key":"7058_CR44","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1109\/TSMCA.2009.2012436","volume":"39","author":"J Chen","year":"2009","unstructured":"Chen J et al (2009) Optimal contraction theorem for exploration-exploitation tradeoff in search and optimization. IEEE Trans Syst Man Cybern Part A-Syst Hum 39(3):680\u2013691","journal-title":"IEEE Trans Syst Man Cybern Part A-Syst Hum"},{"key":"7058_CR45","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1016\/j.asoc.2015.10.034","volume":"38","author":"V Muthiah-Nakarajan","year":"2016","unstructured":"Muthiah-Nakarajan V, Noel MM (2016) Galactic swarm optimization: a new global optimization metaheuristic inspired by galactic motion. Appl Soft Comput 38:771\u2013787","journal-title":"Appl Soft Comput"},{"issue":"9","key":"7058_CR46","doi-asserted-by":"crossref","first-page":"2401","DOI":"10.1007\/s13042-018-0878-6","volume":"10","author":"E Kaya","year":"2019","unstructured":"Kaya E, Uymaz SA, Kocer B (2019) Boosting galactic swarm optimization with ABC. Int J Mach Learn Cybern 10(9):2401\u20132419","journal-title":"Int J Mach Learn Cybern"},{"key":"7058_CR47","doi-asserted-by":"crossref","first-page":"74991","DOI":"10.1109\/ACCESS.2020.2988717","volume":"8","author":"BM Nguyen","year":"2020","unstructured":"Nguyen BM et al (2020) Hybridization of galactic swarm and evolution whale optimization for global search problem. IEEE Access 8:74991\u201375010","journal-title":"IEEE Access"},{"key":"7058_CR48","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: 1995 IEEE International conference on neural networks proceedings. 1\u20136: 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"11","key":"7058_CR49","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":"1","key":"7058_CR50","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"JH Holland","year":"1992","unstructured":"Holland JH (1992) Genetic Algorithms. Sci Am 267(1):66\u201372","journal-title":"Sci Am"},{"issue":"6","key":"7058_CR51","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biom Bull 1(6):80\u201383","journal-title":"Biom Bull"},{"issue":"1","key":"7058_CR52","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1214\/aoms\/1177731944","volume":"11","author":"M Friedman","year":"1940","unstructured":"Friedman M (1940) A comparison of alternative tests of significance for the problem of $m$ rankings. Ann Math Statist 11(1):86\u201392","journal-title":"Ann Math Statist"},{"issue":"4","key":"7058_CR53","doi-asserted-by":"crossref","first-page":"8049","DOI":"10.1016\/j.eswa.2008.10.047","volume":"36","author":"XH Yuan","year":"2009","unstructured":"Yuan XH et al (2009) An improved binary particle swarm optimization for unit commitment problem. Expert Syst Appl 36(4):8049\u20138055","journal-title":"Expert Syst Appl"},{"issue":"1","key":"7058_CR54","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.asoc.2011.08.038","volume":"12","author":"MH Kashan","year":"2012","unstructured":"Kashan MH, Nahavandi N, Kashan AH (2012) DisABC: a new artificial bee colony algorithm for binary optimization. Appl Soft Comput 12(1):342\u2013352","journal-title":"Appl Soft Comput"},{"key":"7058_CR55","doi-asserted-by":"crossref","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","journal-title":"Appl Soft Comput"},{"issue":"2","key":"7058_CR56","doi-asserted-by":"crossref","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(2):481\u2013513","journal-title":"Comput Optim Appl"},{"key":"7058_CR57","doi-asserted-by":"crossref","unstructured":"Engelbrecht AP, Pampara G (2007) Binary differential evolution strategies. In: 2007 IEEE congress on evolutionary computation. 1\u201310: 1942\u20131947","DOI":"10.1109\/CEC.2007.4424711"},{"issue":"4","key":"7058_CR58","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"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07058-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-07058-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07058-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T09:18:32Z","timestamp":1656148712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-07058-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,3]]},"references-count":58,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["7058"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-07058-y","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,3]]},"assertion":[{"value":"3 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2022","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 author of the article have no relationship (either financial or personal) with any people or organizations that can affect or bias the paper\u2019s contents.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}