{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T23:48:18Z","timestamp":1762040898591,"version":"build-2065373602"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T00:00:00Z","timestamp":1626739200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T00:00:00Z","timestamp":1626739200000},"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":[[2021,12]]},"DOI":"10.1007\/s00521-021-06262-6","type":"journal-article","created":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T03:32:11Z","timestamp":1626751931000},"page":"16675-16696","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Orthogonal Latin squares-based firefly optimization algorithm for industrial quadratic assignment tasks"],"prefix":"10.1007","volume":"33","author":[{"given":"Rizk Masoud","family":"Rizk-Allah","sequence":"first","affiliation":[]},{"given":"Adam","family":"Slowik","sequence":"additional","affiliation":[]},{"given":"Ashraf","family":"Darwish","sequence":"additional","affiliation":[]},{"given":"Aboul Ella","family":"Hassanien","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,20]]},"reference":[{"issue":"3","key":"6262_CR1","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1023\/A:1008743718053","volume":"15","author":"MH Lim","year":"2000","unstructured":"Lim MH, Yuan Y, Omatu S (2000) Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem. Comput Optim Appl 15(3):249\u2013268","journal-title":"Comput Optim Appl"},{"issue":"1\u20132","key":"6262_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10696-015-9214-6","volume":"28","author":"S Helber","year":"2016","unstructured":"Helber S, Bohme D, Oucherif F, Lagershausen S, Kasper S (2016) A hierarchical facility layout planning approach for large and complex hospitals. Flexible Serv Manuf J 28(1\u20132):5\u201329","journal-title":"Flexible Serv Manuf J"},{"issue":"1","key":"6262_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1137\/1003003","volume":"3","author":"L Steinberg","year":"1961","unstructured":"Steinberg L (1961) The backboard wiring problem: a placement algorithm. SIAM Rev 3(1):37\u201350","journal-title":"SIAM Rev"},{"key":"6262_CR4","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0377-2217(00)00029-1","volume":"130","author":"LS Pitsoulis","year":"2001","unstructured":"Pitsoulis LS, Pardalos PM, Hearn DW (2001) Approximate solutions to the turbine balancing problem. Europ J Oper Res 130:147\u2013155","journal-title":"Europ J Oper Res"},{"key":"6262_CR5","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1504\/IJBIC.2014.060598","volume":"6","author":"S Sabba","year":"2014","unstructured":"Sabba S, Chikhi S (2014) A discrete binary version of bat algorithm for multidimensional knapsack problem. Int J Bio-Inspired Comput 6:140\u2013152","journal-title":"Int J Bio-Inspired Comput"},{"issue":"4","key":"6262_CR6","first-page":"491","volume":"9","author":"TG Pradeepmon","year":"2018","unstructured":"Pradeepmon TG, Sridharan R, Panicker V (2018) Development of modified discrete particle swarm optimization algorithm for quadratic assignment problems. Int J Ind Eng Comput 9(4):491\u2013508","journal-title":"Int J Ind Eng Comput"},{"key":"6262_CR7","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni S, Gonzalez T (1976) P-complete approximation problems. JACM 23:555\u201365","journal-title":"JACM"},{"key":"6262_CR8","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"E Loiola","year":"2007","unstructured":"Loiola E, de Abreo N, Boaventura-Nett P, Hahn P, Querido T (2007) A survey for the quadratic assignment problem. Europ J Oper Res 176:657\u2013690","journal-title":"Europ J Oper Res"},{"key":"6262_CR9","volume-title":"The quadratic assignment problem","author":"RE Burkard","year":"1998","unstructured":"Burkard RE, Cela E, Pardalos PM, Pitsoulis LS (1998) The quadratic assignment problem. Kluwer Academic Publishers, Dordrecht"},{"issue":"3","key":"6262_CR10","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/j.ejor.2005.01.066","volume":"174","author":"T Stutzle","year":"2006","unstructured":"Stutzle T (2006) Iterated local search for the quadratic assignment problem. Europ J Oper Res 174(3):1519\u20131539","journal-title":"Europ J Oper Res"},{"issue":"9","key":"6262_CR11","doi-asserted-by":"crossref","first-page":"4800","DOI":"10.1016\/j.amc.2012.10.106","volume":"219","author":"U Benlic","year":"2013","unstructured":"Benlic U, Hao JK (2013) Breakout local search for the quadratic assignment problem. Appl Math Comput 219(9):4800\u20134815","journal-title":"Appl Math Comput"},{"issue":"1","key":"6262_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1080\/07408178708975376","volume":"19","author":"MR Wilhelm","year":"1987","unstructured":"Wilhelm MR, Ward TL (1987) Solving quadratic assignment problems by simulated annealing. IIE Trans 19(1):107\u2013119","journal-title":"IIE Trans"},{"key":"6262_CR13","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1007\/s00521-018-3613-z","volume":"31","author":"RM Rizk-Allah","year":"2019","unstructured":"Rizk-Allah RM, Hassanien AE, Elhoseny M (2019) A new binary salp swarm algorithm: development and application for optimization tasks. Neural Comput Appl 31:1641\u20131663","journal-title":"Neural Comput Appl"},{"key":"6262_CR14","doi-asserted-by":"publisher","first-page":"7135","DOI":"10.1007\/s00500-018-3355-y","volume":"23","author":"RM Rizk-Allah","year":"2019","unstructured":"Rizk-Allah RM (2019) An improved sine cosine algorithm based on orthogonal parallel information for global optimization. Soft Comput 23:7135\u20137161","journal-title":"Soft Comput"},{"key":"6262_CR15","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1016\/j.epsr.2010.12.005","volume":"81","author":"AA Mousa","year":"2011","unstructured":"Mousa AA, Abd El-Wahed WF, Rizk-Allah RM (2011) A hybrid ant colony optimization approach based local search scheme for multiobjective design optimizations. J Electric Power Syst Res 81:1014\u20131023","journal-title":"J Electric Power Syst Res"},{"issue":"1","key":"6262_CR16","first-page":"152","volume":"4","author":"AA El-Sawy","year":"2013","unstructured":"El-Sawy AA, Zaki EM, Rizk-Allah RM (2013) Novel hybrid ant colony optimization and firefly algorithm for multi-objective optimization problems. Int J Math Archive 4(1):152\u2013161","journal-title":"Int J Math Archive"},{"issue":"9","key":"6262_CR17","first-page":"183","volume":"5","author":"RM Rizk-Allah","year":"2014","unstructured":"Rizk-Allah RM (2014) A novel multi-ant colony optimization for multi-objective resource allocation problems. Int J Math Archive 5(9):183\u2013192","journal-title":"Int J Math Archive"},{"key":"6262_CR18","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/j.amc.2013.07.092","volume":"224","author":"RM Rizk-Allah","year":"2013","unstructured":"Rizk-Allah RM, Zaki EM, El-Sawy AA (2013) Hybridizing ant colony optimization with firefly algorithm for unconstrained optimization problems. Appl Math Comput 224:473\u2013483","journal-title":"Appl Math Comput"},{"issue":"2","key":"6262_CR19","first-page":"1","volume":"5","author":"RM Rizk-Allah","year":"2016","unstructured":"Rizk-Allah RM (2016) Hybridization of fruit fly optimization algorithm and firefly algorithm for solving nonlinear programming problems. Int J Swarm Intell Evolut Comput 5(2):1\u201310","journal-title":"Int J Swarm Intell Evolut Comput"},{"issue":"1","key":"6262_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s40747-017-0050-z","volume":"4","author":"RM Rizk-Allah","year":"2018","unstructured":"Rizk-Allah RM, Hassanien AE (2018) New binary bat algorithm for solving 0\u20131 knapsack problem. Complex Intell Syst 4(1):31\u201353","journal-title":"Complex Intell Syst"},{"issue":"3","key":"6262_CR21","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1007\/s11227-016-1806-8","volume":"73","author":"RM Rizk-Allah","year":"2017","unstructured":"Rizk-Allah RM, El-Sehiemy RA, Deb S, Wang G-G (2017) A novel fruit fly framework for multi-objective shape design of tubular linear synchronous motor. J Supercomput 73(3):1235\u20131256","journal-title":"J Supercomput"},{"key":"6262_CR22","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1016\/j.asoc.2018.03.019","volume":"71","author":"RM Rizk-Allah","year":"2018","unstructured":"Rizk-Allah RM, Hassanien AE, Bhattacharyya S (2018) Chaotic crow search algorithm for fractional optimization problems. Appl Soft Comput 71:1161\u20131175","journal-title":"Appl Soft Comput"},{"issue":"6","key":"6262_CR23","first-page":"180","volume":"5","author":"RM Rizk-Allah","year":"2017","unstructured":"Rizk-Allah RM, Abdel HM, El-Sehiemy AR, Shady HE, Aleem A, El Shahat A (2017) A new sine cosine optimization algorithm for solving combined non-convex economic and emission power dispatch problems. Int J Energy Convers 5(6):180\u2013192","journal-title":"Int J Energy Convers"},{"issue":"2","key":"6262_CR24","first-page":"1","volume":"29","author":"RA El-Sehiemy","year":"2019","unstructured":"El-Sehiemy RA, Rizk-Allah RM, Attia AF (2019) Assessment of hurricane versus sine-cosine optimization algorithms for economic\/ecological emissions load dispatch problem. Int Trans Electrical Energy Syst 29(2):1\u201314","journal-title":"Int Trans Electrical Energy Syst"},{"issue":"3","key":"6262_CR25","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1109\/JAS.2019.1911450","volume":"6","author":"ZM Lv","year":"2019","unstructured":"Lv ZM, Wang LQ, Han ZY, Zhao J, Wang W (2019) Surrogate-assisted particle swarm optimization algorithm with Pareto active learning for expensive multi-objective optimization. IEEE\/CAA J Autom Sinica 6(3):838\u2013849","journal-title":"IEEE\/CAA J Autom Sinica"},{"issue":"2","key":"6262_CR26","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/JAS.2017.7510436","volume":"6","author":"K Jagatheesan","year":"2019","unstructured":"Jagatheesan K, Anand B, Samanta S, Dey N, Ashour AS, Balas VE (2019) Design of a proportional-integral-derivative controller for an automatic generation control of multi-area power thermal systems using firefly algorithm. IEEE\/CAA J Autom Sinica 6(2):503\u2013515","journal-title":"IEEE\/CAA J Autom Sinica"},{"issue":"4","key":"6262_CR27","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1109\/JAS.2018.7511138","volume":"5","author":"J Zhao","year":"2018","unstructured":"Zhao J, Liu SX, Zhou MC, Guo XW, Qi L (2018) Modified cuckoo search algorithm to solve economic power dispatch optimization problems. IEEE\/CAA J Autom Sinica 5(4):794\u2013806","journal-title":"IEEE\/CAA J Autom Sinica"},{"key":"6262_CR28","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.asoc.2019.01.001","volume":"76","author":"T Dokeroglu","year":"2019","unstructured":"Dokeroglu T, Sevinc E, Cosar A (2019) Artificial bee colony optimization for the quadratic assignment problem. Appl Soft Comput 76:595\u2013606","journal-title":"Appl Soft Comput"},{"issue":"2","key":"6262_CR29","first-page":"673","volume":"22","author":"H Kilic","year":"2019","unstructured":"Kilic H, Yuzgec U (2019) Tournament selection based antlion optimization algorithm for solving quadratic assignment problem. Int J Eng Sci Technol 22(2):673\u2013691","journal-title":"Int J Eng Sci Technol"},{"key":"6262_CR30","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.asoc.2018.08.047","volume":"73","author":"M Abdel-Basset","year":"2018","unstructured":"Abdel-Basset M, Manogaran G, El-Shahat D, Mirjalili S (2018) Integrating the whale algorithm with tabu search for quadratic assignment problem: a new approach for locating hospital departments. Appl Soft Comput 73:530\u2013546","journal-title":"Appl Soft Comput"},{"issue":"3","key":"6262_CR31","first-page":"221","volume":"18","author":"ME Riffi","year":"2017","unstructured":"Riffi ME, Saji Y, Barkatou M (2017) Incorporating a modified uniform crossover and 2-exchange neighborhood mechanism in a discrete bat algorithm to solve the quadratic assignment problem. Egypt Inf J 18(3):221\u2013232","journal-title":"Egypt Inf J"},{"key":"6262_CR32","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.eswa.2015.09.032","volume":"44","author":"F Hafiz","year":"2016","unstructured":"Hafiz F, Abdennour A (2016) Particle swarm algorithm variants for the quadratic assignment problems\u2014a probabilistic learning approach. Exp Syst Appl 44:413\u2013431","journal-title":"Exp Syst Appl"},{"issue":"1","key":"6262_CR33","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1016\/j.eswa.2014.08.011","volume":"42","author":"U Benlic","year":"2015","unstructured":"Benlic U, Hao J-K (2015) Memetic search for the quadratic assignment problem. Exp Syst Appl 42(1):584\u2013595","journal-title":"Exp Syst Appl"},{"key":"6262_CR34","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.cie.2015.03.001","volume":"85","author":"T Dokeroglu","year":"2015","unstructured":"Dokeroglu T (2015) Hybrid teaching-learning-based optimization algorithms for the quadratic assignment problem. Comput Ind Eng 85:86\u2013101","journal-title":"Comput Ind Eng"},{"key":"6262_CR35","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.procs.2014.05.394","volume":"32","author":"U Tosun","year":"2014","unstructured":"Tosun U (2014) A new recombination operator for the genetic algorithm solution of the quadratic assignment problem. Procedia Comput Sci 32:29\u201336","journal-title":"Procedia Comput Sci"},{"issue":"14","key":"6262_CR36","doi-asserted-by":"publisher","first-page":"4117","DOI":"10.1080\/00207543.2012.746798","volume":"51","author":"U Tosun","year":"2013","unstructured":"Tosun U, Dokeroglu T, Cosar A (2013) A robust island parallel genetic algorithm for the quadratic assignment problem. Int J Prod Res 51(14):4117\u20134133","journal-title":"Int J Prod Res"},{"issue":"3","key":"6262_CR37","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s00291-011-0274-z","volume":"34","author":"A Misevicius","year":"2012","unstructured":"Misevicius A (2012) An implementation of the iterated tabu search algorithm for the quadratic assignment problem. OR Spectrum 34(3):665\u2013690","journal-title":"OR Spectrum"},{"issue":"2","key":"6262_CR38","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.cie.2010.11.014","volume":"60","author":"N Fescioglu-Unver","year":"2011","unstructured":"Fescioglu-Unver N, Kokar M (2011) Self controlling tabu search algorithm for the quadratic assignment problem. Comput Ind Eng 60(2):310\u2013319","journal-title":"Comput Ind Eng"},{"key":"6262_CR39","unstructured":"Mamaghani AS, Meybodi MR (2011) An application of imperialist competitive algorithm to solve the quadratic assignment problem. In Proceedings of the 6th international conference on internet technology and secured transactions, Abu Dhabi, United Arab Emirates, pp 562\u2013565"},{"key":"6262_CR40","unstructured":"Shojaee K, Mollai N, Seyedkashi SMH, Neshati M (2010) New simulated annealing algorithm for quadratic assignment problem. In Proceedings of the fourth international conference on advanced engineering computing and applications in sciences, pp 87\u201392"},{"issue":"3","key":"6262_CR41","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1109\/TSMCA.2009.2014556","volume":"39","author":"T James","year":"2009","unstructured":"James T, Rego C, Glover F (2009) Multistart tabu search and diversification strategies for the quadratic assignment problem. IEEE Trans Syst Man Cybern 39(3):579\u2013596","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"6262_CR42","doi-asserted-by":"crossref","unstructured":"Tsutsui S (2008) Parallel ant colony optimization for the quadratic assignment problems with symmetric multi processing. In Proceedings of international conference on ant colony optimization and swarm intelligence, ANTS 2008, pp 363\u2013370","DOI":"10.1007\/978-3-540-87527-7_38"},{"key":"6262_CR43","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evolut Comput 1:67\u201382","journal-title":"IEEE Trans Evolut Comput"},{"key":"6262_CR44","volume-title":"Nature-inspired metaheuristic algorithms","author":"XS Yang","year":"2008","unstructured":"Yang XS (2008) Nature-inspired metaheuristic algorithms. Luniver Press, UK"},{"key":"6262_CR45","doi-asserted-by":"crossref","unstructured":"Li W, Wang GG, Alavi AH (2020) Learning-based elephant herding optimization algorithm for solving numerical optimization problems. Knowl Based Syst, vol 195, Article ID: 105675","DOI":"10.1016\/j.knosys.2020.105675"},{"key":"6262_CR46","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.neucom.2015.11.018","volume":"177","author":"GG Wang","year":"2016","unstructured":"Wang GG, Deb S, Gandomi AH, Alavi AH (2016) Opposition-based krill herd algorithm with Cauchy mutation and position clamping. Neurocomputing 177:147\u2013157","journal-title":"Neurocomputing"},{"key":"6262_CR47","doi-asserted-by":"crossref","unstructured":"Li W, Wang GG (2021) Elephant herding optimization using dynamic topology and biogeography-based optimization based on learning for numerical optimization. Eng Comput ((in print))","DOI":"10.1007\/s00366-021-01293-y"},{"key":"6262_CR48","doi-asserted-by":"publisher","first-page":"11967","DOI":"10.1007\/s00521-019-04178-w","volume":"32","author":"J Li","year":"2020","unstructured":"Li J, Li YX, Tian SS, Xia JL (2020) An improved cuckoo search algorithm with self-adaptive knowledge learning. Neural Comput Appl 32:11967\u201311997","journal-title":"Neural Comput Appl"},{"issue":"1","key":"6262_CR49","doi-asserted-by":"publisher","first-page":"676","DOI":"10.2991\/ijcis.d.201216.002","volume":"14","author":"J Li","year":"2020","unstructured":"Li J, Yang YH, Lei H, Wang GG (2020) Solving logistics distribution center location with improved cuckoo search algorithm. Int J Comput Intell Syst 14(1):676\u2013692","journal-title":"Int J Comput Intell Syst"},{"key":"6262_CR50","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1057\/jors.1977.29","volume":"28","author":"AE Elshafei","year":"1977","unstructured":"Elshafei AE (1977) Hospital layout as a quadratic assignment problem. Oper Res Quart 28:167\u2013179","journal-title":"Oper Res Quart"},{"issue":"4","key":"6262_CR51","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.orl.2003.10.010","volume":"32","author":"AD Magos","year":"2004","unstructured":"Magos AD, Mourtos I (2004) An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6. Oper Res Lett 32(4):336\u2013344","journal-title":"Oper Res Lett"},{"issue":"3","key":"6262_CR52","first-page":"1","volume":"4","author":"J Seberry","year":"2012","unstructured":"Seberry J, Tonien D (2012) Some constructions of mutually orthogonal Latin squares and superimposed codes Discrete Mathematics. Algorithms Appl 4(3):1\u20138","journal-title":"Algorithms Appl"},{"key":"6262_CR53","unstructured":"Seberry J, Tonien D. https:\/\/www.opt.math.tugraz.at\/qaplib\/inst.html#BO. Visited, 28\/2\/2019"},{"key":"6262_CR54","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/j.future.2018.12.065","volume":"95","author":"D Xueshi","year":"2019","unstructured":"Xueshi D, Cai Y (2019) A novel genetic algorithm for large scale colored balanced traveling salesman problem. Future Generat Comput Syst 95:727\u2013742","journal-title":"Future Generat Comput Syst"},{"key":"6262_CR55","doi-asserted-by":"crossref","unstructured":"Hao L, Zhang X-W, Tu L-P (2020) A modified particle swarm optimization using adaptive strategy. Expert Syst Appl, vol 152, Article ID: 113353","DOI":"10.1016\/j.eswa.2020.113353"},{"issue":"1","key":"6262_CR56","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garca S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut Comput 1(1):3\u201318","journal-title":"Swarm Evolut Comput"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06262-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-021-06262-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06262-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T07:09:30Z","timestamp":1699254570000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-021-06262-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,20]]},"references-count":56,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["6262"],"URL":"https:\/\/doi.org\/10.1007\/s00521-021-06262-6","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2021,7,20]]},"assertion":[{"value":"3 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"In the present work, we have not used any material from previously published. So we have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}