{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T06:05:36Z","timestamp":1780380336580,"version":"3.54.1"},"reference-count":92,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52065010"],"award-info":[{"award-number":["52065010"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51865004"],"award-info":[{"award-number":["51865004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005329","name":"Natural Science Foundation of Guizhou Province","doi-asserted-by":"publisher","award":["Qiankehe platform talent [2018] No.5781"],"award-info":[{"award-number":["Qiankehe platform talent [2018] No.5781"]}],"id":[{"id":"10.13039\/501100005329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005329","name":"Natural Science Foundation of Guizhou Province","doi-asserted-by":"publisher","award":["Qiankehe support [2019] No.2010"],"award-info":[{"award-number":["Qiankehe support [2019] No.2010"]}],"id":[{"id":"10.13039\/501100005329","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Top Talent Support Program Project of Guizhou Province","award":["Qianjiaohe KY [2018] No.037"],"award-info":[{"award-number":["Qianjiaohe KY [2018] No.037"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Engineering with Computers"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s00366-021-01319-5","type":"journal-article","created":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T19:02:57Z","timestamp":1614625377000},"page":"3269-3294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":47,"title":["A modified self-adaptive marine predators algorithm: framework and engineering applications"],"prefix":"10.1007","volume":"38","author":[{"given":"Qingsong","family":"Fan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3750-6537","authenticated-orcid":false,"given":"Haisong","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qipeng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liguo","family":"Yao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dong","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,3,1]]},"reference":[{"key":"1319_CR1","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.1007\/s00366-019-00780-7","volume":"36","author":"J Katebi","year":"2020","unstructured":"Katebi J, Shoaei-parchin M, Shariati M et al (2020) Developed comparative analysis of metaheuristic optimization algorithms for optimal active control of structures. Eng Comput 36:1539\u20131558. https:\/\/doi.org\/10.1007\/s00366-019-00780-7","journal-title":"Eng Comput"},{"key":"1319_CR2","doi-asserted-by":"publisher","first-page":"6449","DOI":"10.1007\/s00521-018-3454-9","volume":"31","author":"X Lai","year":"2019","unstructured":"Lai X, Zhou Y (2019) An adaptive parallel particle swarm optimization for numerical optimization problems. Neural Comput Appl 31:6449\u20136467. https:\/\/doi.org\/10.1007\/s00521-018-3454-9","journal-title":"Neural Comput Appl"},{"key":"1319_CR3","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.ins.2015.09.051","volume":"329","author":"G Wu","year":"2016","unstructured":"Wu G (2016) Across neighborhood search for numerical optimization. Inf Sci (Ny) 329:597\u2013618. https:\/\/doi.org\/10.1016\/j.ins.2015.09.051","journal-title":"Inf Sci (Ny)"},{"key":"1319_CR4","doi-asserted-by":"publisher","first-page":"106018","DOI":"10.1016\/j.asoc.2019.106018","volume":"89","author":"VK Kamboj","year":"2020","unstructured":"Kamboj VK, Nandi A, Bhadoria A, Sehgal S (2020) An intensify Harris Hawks optimizer for numerical and engineering optimization problems. Appl Soft Comput J 89:106018. https:\/\/doi.org\/10.1016\/j.asoc.2019.106018","journal-title":"Appl Soft Comput J"},{"key":"1319_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-020-01174-w","author":"H Yu","year":"2020","unstructured":"Yu H, Li W, Chen C et al (2020) Dynamic Gaussian bare-bones fruit fly optimizers with abandonment mechanism: method and analysis. Eng Comput. https:\/\/doi.org\/10.1007\/s00366-020-01174-w","journal-title":"Eng Comput"},{"key":"1319_CR6","doi-asserted-by":"publisher","first-page":"2191","DOI":"10.1007\/s10462-017-9605-z","volume":"52","author":"K Hussain","year":"2019","unstructured":"Hussain K, Mohd Salleh MN, Cheng S, Shi Y (2019) Metaheuristic research: a comprehensive survey. Artif Intell Rev 52:2191\u20132233. https:\/\/doi.org\/10.1007\/s10462-017-9605-z","journal-title":"Artif Intell Rev"},{"key":"1319_CR7","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.knosys.2018.06.001","volume":"159","author":"G Dhiman","year":"2018","unstructured":"Dhiman G, Kumar V (2018) Emperor penguin optimizer: A bio-inspired algorithm for engineering problems. Knowl-Based Syst 159:20\u201350. https:\/\/doi.org\/10.1016\/j.knosys.2018.06.001","journal-title":"Knowl-Based Syst"},{"key":"1319_CR8","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/BF00047572","volume":"12","author":"C-R Hwang","year":"1988","unstructured":"Hwang C-R (1988) Simulated annealing: Theory and applications. Acta Appl Math 12:108\u2013111. https:\/\/doi.org\/10.1007\/BF00047572","journal-title":"Acta Appl Math"},{"key":"1319_CR9","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1016\/j.future.2018.08.002","volume":"93","author":"FB Ozsoydan","year":"2019","unstructured":"Ozsoydan FB, Baykasoglu A (2019) A swarm intelligence-based algorithm for the set-union knapsack problem. Futur Gener Comput Syst 93:560\u2013569. https:\/\/doi.org\/10.1016\/j.future.2018.08.002","journal-title":"Futur Gener Comput Syst"},{"key":"1319_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.03.055","author":"S Li","year":"2020","unstructured":"Li S, Chen H, Wang M et al (2020) Slime mould algorithm: a new method for stochastic optimization. Futur Gener Comput Syst. https:\/\/doi.org\/10.1016\/j.future.2020.03.055","journal-title":"Futur Gener Comput Syst"},{"key":"1319_CR11","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, Garc\u00eda 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 Evol Comput 1:3\u201318. https:\/\/doi.org\/10.1016\/j.swevo.2011.02.002","journal-title":"Swarm Evol Comput"},{"key":"1319_CR12","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1109\/TFUZZ.2018.2870590","volume":"27","author":"P Kumar","year":"2019","unstructured":"Kumar P, Mukherjee S, Saini R et al (2019) Multimodal gait recognition with inertial sensor data and video using evolutionary algorithm. IEEE Trans Fuzzy Syst 27:956\u2013965. https:\/\/doi.org\/10.1109\/TFUZZ.2018.2870590","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"1319_CR13","doi-asserted-by":"publisher","first-page":"113882","DOI":"10.1016\/j.eswa.2020.113882","volume":"165","author":"Q Fan","year":"2021","unstructured":"Fan Q, Huang H, Li Y et al (2021) Beetle antenna strategy based grey wolf optimization. Expert Syst Appl 165:113882. https:\/\/doi.org\/10.1016\/j.eswa.2020.113882","journal-title":"Expert Syst Appl"},{"key":"1319_CR14","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 Evol Comput 1:67\u201382. https:\/\/doi.org\/10.1109\/4235.585893","journal-title":"IEEE Trans Evol Comput"},{"key":"1319_CR15","doi-asserted-by":"publisher","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN\u201995\u2014international conference on neural networks, pp 1942\u20131948. Doi: https:\/\/doi.org\/10.1109\/ICNN.1995.488968","DOI":"10.1109\/ICNN.1995.488968"},{"key":"1319_CR16","doi-asserted-by":"publisher","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:687\u2013697. https:\/\/doi.org\/10.1016\/j.asoc.2007.05.007","journal-title":"Appl Soft Comput"},{"key":"1319_CR17","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci (Ny) 179:2232\u20132248. https:\/\/doi.org\/10.1016\/j.ins.2009.03.004","journal-title":"Inf Sci (Ny)"},{"key":"1319_CR18","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1109\/NABIC.2009.5393690","volume":"2009","author":"X-S Yang","year":"2009","unstructured":"Yang X-S, Deb S (2009) Cuckoo search via levy flights. IEEE World Congr Nat Biol Inspired Comput NaBIC 2009:210\u2013214. https:\/\/doi.org\/10.1109\/NABIC.2009.5393690","journal-title":"IEEE World Congr Nat Biol Inspired Comput NaBIC"},{"key":"1319_CR19","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. https:\/\/doi.org\/10.1016\/j.advengsoft.2013.12.007","journal-title":"Adv Eng Softw"},{"key":"1319_CR20","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.knosys.2015.07.006","volume":"89","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili S (2015) Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl-Based Syst 89:228\u2013249. https:\/\/doi.org\/10.1016\/j.knosys.2015.07.006","journal-title":"Knowl-Based Syst"},{"key":"1319_CR21","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.ins.2014.10.042","volume":"295","author":"S Mahdavi","year":"2015","unstructured":"Mahdavi S, Shiri ME, Rahnamayan S (2015) Metaheuristics in large-scale global continues optimization: a survey. Inf Sci (Ny) 295:407\u2013428. https:\/\/doi.org\/10.1016\/j.ins.2014.10.042","journal-title":"Inf Sci (Ny)"},{"key":"1319_CR22","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.asoc.2018.03.011","volume":"67","author":"A Bouyer","year":"2018","unstructured":"Bouyer A, Hatamlou A (2018) An efficient hybrid clustering method based on improved cuckoo optimization and modified particle swarm optimization algorithms. Appl Soft Comput 67:172\u2013182. https:\/\/doi.org\/10.1016\/j.asoc.2018.03.011","journal-title":"Appl Soft Comput"},{"key":"1319_CR23","doi-asserted-by":"publisher","first-page":"105761","DOI":"10.1016\/j.asoc.2019.105761","volume":"84","author":"B Morales-Casta\u00f1eda","year":"2019","unstructured":"Morales-Casta\u00f1eda B, Zald\u00edvar D, Cuevas E et al (2019) An improved Simulated Annealing algorithm based on ancient metallurgy techniques. Appl Soft Comput 84:105761. https:\/\/doi.org\/10.1016\/j.asoc.2019.105761","journal-title":"Appl Soft Comput"},{"key":"1319_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113389","author":"S Dhargupta","year":"2020","unstructured":"Dhargupta S, Ghosh M, Mirjalili S, Sarkar R (2020) Selective opposition based Grey Wolf optimization. Expert Syst Appl. https:\/\/doi.org\/10.1016\/j.eswa.2020.113389","journal-title":"Expert Syst Appl"},{"key":"1319_CR25","doi-asserted-by":"publisher","first-page":"105746","DOI":"10.1016\/j.knosys.2020.105746","volume":"195","author":"P Hu","year":"2020","unstructured":"Hu P, Pan J-S, Chu S-C (2020) Improved binary Grey Wolf Optimizer and Its application for feature selection. Knowl-Based Syst 195:105746. https:\/\/doi.org\/10.1016\/j.knosys.2020.105746","journal-title":"Knowl-Based Syst"},{"key":"1319_CR26","doi-asserted-by":"publisher","first-page":"105276","DOI":"10.1016\/j.knosys.2019.105276","volume":"191","author":"Q Liu","year":"2020","unstructured":"Liu Q, Ren H-P, Tang R-J, Yao J-L (2020) Optimizing co-existing multicast routing trees in IP network via discrete artificial fish school algorithm. Knowl-Based Syst 191:105276. https:\/\/doi.org\/10.1016\/j.knosys.2019.105276","journal-title":"Knowl-Based Syst"},{"key":"1319_CR27","doi-asserted-by":"publisher","first-page":"8419","DOI":"10.1016\/j.eswa.2011.01.037","volume":"38","author":"J Wang","year":"2011","unstructured":"Wang J, Chi D, Wu J, Lu H (2011) Chaotic time series method combined with particle swarm optimization and trend adjustment for electricity demand forecasting. Expert Syst Appl 38:8419\u20138429. https:\/\/doi.org\/10.1016\/j.eswa.2011.01.037","journal-title":"Expert Syst Appl"},{"key":"1319_CR28","doi-asserted-by":"publisher","first-page":"2372","DOI":"10.1016\/j.engappai.2013.07.018","volume":"26","author":"B-M Chang","year":"2013","unstructured":"Chang B-M, Tsai H-H, Chou W-L (2013) Using visual features to design a content-based image retrieval method optimized by particle swarm optimization algorithm. Eng Appl Artif Intell 26:2372\u20132382. https:\/\/doi.org\/10.1016\/j.engappai.2013.07.018","journal-title":"Eng Appl Artif Intell"},{"key":"1319_CR29","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.eswa.2017.10.042","volume":"94","author":"Y Djenouri","year":"2018","unstructured":"Djenouri Y, Belhadi A, Belkebir R (2018) Bees swarm optimization guided by data mining techniques for document information retrieval. Expert Syst Appl 94:126\u2013136. https:\/\/doi.org\/10.1016\/j.eswa.2017.10.042","journal-title":"Expert Syst Appl"},{"key":"1319_CR30","doi-asserted-by":"publisher","first-page":"106115","DOI":"10.1016\/j.cie.2019.106115","volume":"138","author":"W Qin","year":"2019","unstructured":"Qin W, Zhuang Z, Liu Y, Tang O (2019) A two-stage ant colony algorithm for hybrid flow shop scheduling with lot sizing and calendar constraints in printed circuit board assembly. Comput Ind Eng 138:106115. https:\/\/doi.org\/10.1016\/j.cie.2019.106115","journal-title":"Comput Ind Eng"},{"key":"1319_CR31","doi-asserted-by":"publisher","first-page":"1688","DOI":"10.1007\/s10489-018-1334-8","volume":"49","author":"M Tubishat","year":"2019","unstructured":"Tubishat M, Abushariah MAM, Idris N, Aljarah I (2019) Improved whale optimization algorithm for feature selection in Arabic sentiment analysis. Appl Intell 49:1688\u20131707. https:\/\/doi.org\/10.1007\/s10489-018-1334-8","journal-title":"Appl Intell"},{"key":"1319_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.06.112","author":"P Wang","year":"2020","unstructured":"Wang P, Zhou Y, Luo Q et al (2020) Complex-valued encoding metaheuristic optimization algorithm: a comprehensive survey. Neurocomputing. https:\/\/doi.org\/10.1016\/j.neucom.2019.06.112","journal-title":"Neurocomputing"},{"key":"1319_CR33","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/j.swevo.2018.08.015","volume":"44","author":"G Wu","year":"2019","unstructured":"Wu G, Mallipeddi R, Suganthan PN (2019) Ensemble strategies for population-based optimization algorithms\u2014a survey. Swarm Evol Comput 44:695\u2013711. https:\/\/doi.org\/10.1016\/j.swevo.2018.08.015","journal-title":"Swarm Evol Comput"},{"key":"1319_CR34","doi-asserted-by":"publisher","first-page":"100694","DOI":"10.1016\/j.swevo.2020.100694","volume":"56","author":"Z Li","year":"2020","unstructured":"Li Z, Lin X, Zhang Q, Liu H (2020) Evolution strategies for continuous optimization: a survey of the state-of-the-art. Swarm Evol Comput 56:100694. https:\/\/doi.org\/10.1016\/j.swevo.2020.100694","journal-title":"Swarm Evol Comput"},{"key":"1319_CR35","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.asoc.2019.03.012","volume":"78","author":"H Yapici","year":"2019","unstructured":"Yapici H, Cetinkaya N (2019) A new meta-heuristic optimizer: Pathfinder algorithm. Appl Soft Comput 78:545\u2013568. https:\/\/doi.org\/10.1016\/j.asoc.2019.03.012","journal-title":"Appl Soft Comput"},{"key":"1319_CR36","doi-asserted-by":"publisher","first-page":"105190","DOI":"10.1016\/j.knosys.2019.105190","volume":"191","author":"A Faramarzi","year":"2020","unstructured":"Faramarzi A, Heidarinejad M, Stephens B, Mirjalili S (2020) Equilibrium optimizer: A novel optimization algorithm. Knowl-Based Syst 191:105190. https:\/\/doi.org\/10.1016\/j.knosys.2019.105190","journal-title":"Knowl-Based Syst"},{"key":"1319_CR37","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1016\/j.future.2019.07.015","volume":"101","author":"FA Hashim","year":"2019","unstructured":"Hashim FA, Houssein EH, Mabrouk MS et al (2019) Henry gas solubility optimization: a novel physics-based algorithm. Futur Gener Comput Syst 101:646\u2013667. https:\/\/doi.org\/10.1016\/j.future.2019.07.015","journal-title":"Futur Gener Comput Syst"},{"key":"1319_CR38","volume-title":"Adaptation in natural and artificial systems","author":"J Holland","year":"1975","unstructured":"Holland J (1975) Adaptation in natural and artificial systems. Univ Michigan Press, Michigan"},{"key":"1319_CR39","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 et al (2017) Salp Swarm Algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Softw 114:163\u2013191. https:\/\/doi.org\/10.1016\/j.advengsoft.2017.07.002","journal-title":"Adv Eng Softw"},{"key":"1319_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/106365603321828970","volume":"11","author":"N Hansen","year":"2003","unstructured":"Hansen N, M\u00fcller SD, Koumoutsakos P (2003) Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evol Comput 11:1\u201318. https:\/\/doi.org\/10.1162\/106365603321828970","journal-title":"Evol Comput"},{"key":"1319_CR41","doi-asserted-by":"publisher","unstructured":"Tanabe R, Fukunaga A (2013) Success-history based parameter adaptation for differential evolution. In: 2013 IEEE Congress on evolutionary computation, pp 71\u201378. Doi: https:\/\/doi.org\/10.1109\/CEC.2013.6557555","DOI":"10.1109\/CEC.2013.6557555"},{"key":"1319_CR42","doi-asserted-by":"publisher","first-page":"113377","DOI":"10.1016\/j.eswa.2020.113377","volume":"152","author":"A Faramarzi","year":"2020","unstructured":"Faramarzi A, Heidarinejad M, Mirjalili S, Gandomi AH (2020) Marine predators algorithm: a nature-inspired metaheuristic. Expert Syst Appl 152:113377. https:\/\/doi.org\/10.1016\/j.eswa.2020.113377","journal-title":"Expert Syst Appl"},{"key":"1319_CR43","doi-asserted-by":"publisher","first-page":"2044","DOI":"10.1016\/j.ins.2009.12.010","volume":"180","author":"S Garc\u00eda","year":"2010","unstructured":"Garc\u00eda S, Fern\u00e1ndez A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: experimental analysis of power. Inf Sci (Ny) 180:2044\u20132064. https:\/\/doi.org\/10.1016\/j.ins.2009.12.010","journal-title":"Inf Sci (Ny)"},{"key":"1319_CR44","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0010-4825(87)90003-5","volume":"17","author":"E Theodorsson-Norheim","year":"1987","unstructured":"Theodorsson-Norheim E (1987) Friedman and Quade tests: BASIC computer program to perform nonparametric two-way analysis of variance and multiple comparisons on ranks of several related samples. Comput Biol Med 17:85\u201399. https:\/\/doi.org\/10.1016\/0010-4825(87)90003-5","journal-title":"Comput Biol Med"},{"key":"1319_CR45","doi-asserted-by":"publisher","unstructured":"Tizhoosh HR (2005) Opposition-Based Learning: A New Scheme for Machine Intelligence. In: International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC\u201906), pp 695\u2013701. Doi: https:\/\/doi.org\/10.1109\/CIMCA.2005.1631345","DOI":"10.1109\/CIMCA.2005.1631345"},{"key":"1319_CR46","doi-asserted-by":"publisher","unstructured":"Hui Wang, Hui Li, Yong Liu, et al (2007) Opposition-based particle swarm algorithm with cauchy mutation. In: 2007 IEEE Congress on Evolutionary Computation, pp 4750\u20134756. Doi: https:\/\/doi.org\/10.1109\/CEC.2007.4425095","DOI":"10.1109\/CEC.2007.4425095"},{"key":"1319_CR47","doi-asserted-by":"publisher","first-page":"2828","DOI":"10.1016\/j.asoc.2012.03.034","volume":"12","author":"S Rahnamayan","year":"2012","unstructured":"Rahnamayan S, Wang GG, Ventresca M (2012) An intuitive distance-based explanation of opposition-based sampling. Appl Soft Comput 12:2828\u20132839. https:\/\/doi.org\/10.1016\/j.asoc.2012.03.034","journal-title":"Appl Soft Comput"},{"key":"1319_CR48","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1109\/TEVC.2017.2674800","volume":"21","author":"Y Zhou","year":"2017","unstructured":"Zhou Y, Hao JK, Duval B (2017) Opposition-based memetic search for the maximum diversity problem. IEEE Trans Evol Comput 21:731\u2013745. https:\/\/doi.org\/10.1109\/TEVC.2017.2674800","journal-title":"IEEE Trans Evol Comput"},{"key":"1319_CR49","doi-asserted-by":"publisher","first-page":"112798","DOI":"10.1016\/j.eswa.2019.07.015","volume":"138","author":"Z Liang","year":"2019","unstructured":"Liang Z, Zhang J, Feng L, Zhu Z (2019) A hybrid of genetic transform and hyper-rectangle search strategies for evolutionary multi-tasking. Expert Syst Appl 138:112798. https:\/\/doi.org\/10.1016\/j.eswa.2019.07.015","journal-title":"Expert Syst Appl"},{"key":"1319_CR50","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.eswa.2017.07.043","volume":"90","author":"MA Elaziz","year":"2017","unstructured":"Elaziz MA, Oliva D, Xiong S (2017) An improved Opposition-Based Sine Cosine Algorithm for global optimization. Expert Syst Appl 90:484\u2013500. https:\/\/doi.org\/10.1016\/j.eswa.2017.07.043","journal-title":"Expert Syst Appl"},{"key":"1319_CR51","doi-asserted-by":"publisher","unstructured":"Guo Z, Cheng B, Ye M, Cao B (2006) Self-adaptive chaos differential evolution. Lect Notes Comput Sci (including Subser Lect Notes Artif Intell Lect Notes Bioinformatics) 4221 LNCS, pp 972\u2013975. Doi: https:\/\/doi.org\/10.1007\/11881070_128","DOI":"10.1007\/11881070_128"},{"key":"1319_CR52","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1016\/j.apm.2019.09.029","volume":"77","author":"H Yu","year":"2020","unstructured":"Yu H, Zhao N, Wang P et al (2020) Chaos-enhanced synchronized bat optimizer. Appl Math Model 77:1201\u20131215. https:\/\/doi.org\/10.1016\/j.apm.2019.09.029","journal-title":"Appl Math Model"},{"key":"1319_CR53","doi-asserted-by":"publisher","first-page":"100573","DOI":"10.1016\/j.swevo.2019.100573","volume":"51","author":"D Tian","year":"2019","unstructured":"Tian D, Zhao X, Shi Z (2019) Chaotic particle swarm optimization with sigmoid-based acceleration coefficients for numerical function optimization. Swarm Evol Comput 51:100573. https:\/\/doi.org\/10.1016\/j.swevo.2019.100573","journal-title":"Swarm Evol Comput"},{"key":"1319_CR54","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.asoc.2018.07.036","volume":"71","author":"RV Rao","year":"2018","unstructured":"Rao RV, Keesari HS (2018) Multi-team perturbation guiding Jaya algorithm for optimization of wind farm layout. Appl Soft Comput 71:800\u2013815. https:\/\/doi.org\/10.1016\/j.asoc.2018.07.036","journal-title":"Appl Soft Comput"},{"key":"1319_CR55","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1007\/s10845-014-0918-3","volume":"27","author":"K Yu","year":"2016","unstructured":"Yu K, Wang X, Wang Z (2016) An improved teaching-learning-based optimization algorithm for numerical and engineering optimization problems. J Intell Manuf 27:831\u2013843. https:\/\/doi.org\/10.1007\/s10845-014-0918-3","journal-title":"J Intell Manuf"},{"key":"1319_CR56","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113395","author":"S Gupta","year":"2020","unstructured":"Gupta S, Deep K, Mirjalili S, Kim JH (2020) A modified sine cosine algorithm with novel transition parameter and mutation operator for global optimization. Expert Syst Appl. https:\/\/doi.org\/10.1016\/j.eswa.2020.113395","journal-title":"Expert Syst Appl"},{"key":"1319_CR57","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.asoc.2017.01.008","volume":"53","author":"S Mirjalili","year":"2017","unstructured":"Mirjalili S, Gandomi AH (2017) Chaotic gravitational constants for the gravitational search algorithm. Appl Soft Comput 53:407\u2013419. https:\/\/doi.org\/10.1016\/j.asoc.2017.01.008","journal-title":"Appl Soft Comput"},{"key":"1319_CR58","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/j.asoc.2018.11.033","volume":"75","author":"E Emary","year":"2019","unstructured":"Emary E, Zawbaa HM, Sharawi M (2019) Impact of L\u00e8vy flight on modern meta-heuristic optimizers. Appl Soft Comput 75:775\u2013789. https:\/\/doi.org\/10.1016\/j.asoc.2018.11.033","journal-title":"Appl Soft Comput"},{"key":"1319_CR59","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) SCA: A Sine Cosine Algorithm for solving optimization problems. Knowl-Based Syst 96:120\u2013133. https:\/\/doi.org\/10.1016\/j.knosys.2015.12.022","journal-title":"Knowl-Based Syst"},{"key":"1319_CR60","unstructured":"Yue CT, Price KV, Suganthan PN et al (2020) Problem Definitions and Evaluation Criteria for the CEC 2020 Special Session and Competition on Single Objective Bound Constrained Numerical Optimization. https:\/\/github.com\/P-N-Suganthan\/2020-Bound-Constrained-Opt-Benchmark"},{"key":"1319_CR61","doi-asserted-by":"publisher","first-page":"103457","DOI":"10.1016\/j.engappai.2019.103457","volume":"89","author":"W Long","year":"2020","unstructured":"Long W, Wu T, Jiao J et al (2020) Refraction-learning-based whale optimization algorithm for high-dimensional problems and parameter estimation of PV model. Eng Appl Artif Intell 89:103457. https:\/\/doi.org\/10.1016\/j.engappai.2019.103457","journal-title":"Eng Appl Artif Intell"},{"key":"1319_CR62","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-020-00994-0","author":"S Barshandeh","year":"2020","unstructured":"Barshandeh S, Haghzadeh M (2020) A new hybrid chaotic atom search optimization based on tree-seed algorithm and Levy flight for solving optimization problems. Eng Comput. https:\/\/doi.org\/10.1007\/s00366-020-00994-0","journal-title":"Eng Comput"},{"key":"1319_CR63","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-020-01120-w","author":"S Barshandeh","year":"2020","unstructured":"Barshandeh S, Piri F, Sangani SR (2020) HMPA: an innovative hybrid multi-population algorithm based on artificial ecosystem-based and Harris Hawks optimization algorithms for engineering problems. Eng Comput. https:\/\/doi.org\/10.1007\/s00366-020-01120-w","journal-title":"Eng Comput"},{"key":"1319_CR64","doi-asserted-by":"publisher","first-page":"106086","DOI":"10.1016\/j.asoc.2020.106086","volume":"89","author":"X Xu","year":"2020","unstructured":"Xu X, Hu Z, Su Q et al (2020) Multivariable grey prediction evolution algorithm: a new metaheuristic. Appl Soft Comput 89:106086. https:\/\/doi.org\/10.1016\/j.asoc.2020.106086","journal-title":"Appl Soft Comput"},{"key":"1319_CR65","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.ins.2018.04.024","volume":"451\u2013452","author":"NH Awad","year":"2018","unstructured":"Awad NH, Ali MZ, Mallipeddi R, Suganthan PN (2018) An improved differential evolution algorithm using efficient adapted surrogate model for numerical optimization. Inf Sci (Ny) 451\u2013452:326\u2013347. https:\/\/doi.org\/10.1016\/j.ins.2018.04.024","journal-title":"Inf Sci (Ny)"},{"key":"1319_CR66","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1016\/j.asoc.2017.06.033","volume":"59","author":"AF Nematollahi","year":"2017","unstructured":"Nematollahi AF, Rahiminejad A, Vahidi B (2017) A novel physical based meta-heuristic optimization method known as Lightning Attachment Procedure Optimization. Appl Soft Comput 59:596\u2013621. https:\/\/doi.org\/10.1016\/j.asoc.2017.06.033","journal-title":"Appl Soft Comput"},{"key":"1319_CR67","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1080\/03052150108940941","volume":"33","author":"T Ray","year":"2001","unstructured":"Ray T, Saini P (2001) Engineering design optimization using a swarm with an intelligent information sharing among individuals. Eng Optim 33:735\u2013748. https:\/\/doi.org\/10.1080\/03052150108940941","journal-title":"Eng Optim"},{"key":"1319_CR68","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.engappai.2019.08.025","volume":"86","author":"SH Moosavi","year":"2019","unstructured":"Moosavi SH, Samareh FG, Bardsiri VK (2019) Poor and rich optimization algorithm: a new human-based and multi populations algorithm. Eng Appl Artif Intell 86:165\u2013181. https:\/\/doi.org\/10.1016\/j.engappai.2019.08.025","journal-title":"Eng Appl Artif Intell"},{"key":"1319_CR69","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.advengsoft.2017.01.004","volume":"105","author":"S Saremi","year":"2017","unstructured":"Saremi S, Mirjalili S, Lewis A (2017) Grasshopper optimisation algorithm: theory and application. Adv Eng Softw 105:30\u201347. https:\/\/doi.org\/10.1016\/j.advengsoft.2017.01.004","journal-title":"Adv Eng Softw"},{"key":"1319_CR70","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. https:\/\/doi.org\/10.1016\/j.advengsoft.2015.01.010","journal-title":"Adv Eng Softw"},{"key":"1319_CR71","doi-asserted-by":"publisher","first-page":"2592","DOI":"10.1016\/j.asoc.2012.11.026","volume":"13","author":"A Sadollah","year":"2013","unstructured":"Sadollah A, Bahreininejad A, Eskandar H, Hamdi M (2013) Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems. Appl Soft Comput 13:2592\u20132612. https:\/\/doi.org\/10.1016\/j.asoc.2012.11.026","journal-title":"Appl Soft Comput"},{"key":"1319_CR72","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/j.asoc.2009.08.031","volume":"10","author":"H Liu","year":"2010","unstructured":"Liu H, Cai Z, Wang Y (2010) Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization. Appl Soft Comput 10:629\u2013640. https:\/\/doi.org\/10.1016\/j.asoc.2009.08.031","journal-title":"Appl Soft Comput"},{"key":"1319_CR73","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-12538-6_6","volume":"284","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) A new metaheuristic Bat-inspired Algorithm. Stud Comput Intell 284:65\u201374. https:\/\/doi.org\/10.1007\/978-3-642-12538-6_6","journal-title":"Stud Comput Intell"},{"key":"1319_CR74","doi-asserted-by":"publisher","first-page":"3043","DOI":"10.1016\/j.ins.2008.02.014","volume":"178","author":"M Zhang","year":"2008","unstructured":"Zhang M, Luo W, Wang X (2008) Differential evolution with dynamic stochastic selection for constrained optimization. Inf Sci (Ny) 178:3043\u20133074. https:\/\/doi.org\/10.1016\/j.ins.2008.02.014","journal-title":"Inf Sci (Ny)"},{"key":"1319_CR75","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0166-3615(99)00046-9","volume":"41","author":"CA Coello","year":"2000","unstructured":"Coello CA, Coello A (2000) Use of a self-adaptive penalty approach for engineering optimization problems. Comput Ind 41:113\u2013127. https:\/\/doi.org\/10.1016\/S0166-3615(99)00046-9","journal-title":"Comput Ind"},{"key":"1319_CR76","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.asoc.2017.10.013","volume":"63","author":"A Babalik","year":"2018","unstructured":"Babalik A, Cinar AC, Kiran MS (2018) A modification of tree-seed algorithm using Deb\u2019s rules for constrained optimization. Appl Soft Comput J 63:289\u2013305. https:\/\/doi.org\/10.1016\/j.asoc.2017.10.013","journal-title":"Appl Soft Comput J"},{"key":"1319_CR77","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.compstruc.2012.09.003","volume":"112\u2013113","author":"A Kaveh","year":"2012","unstructured":"Kaveh A, Khayatazad M (2012) A new meta-heuristic method: Ray Optimization. Comput Struct 112\u2013113:283\u2013294. https:\/\/doi.org\/10.1016\/j.compstruc.2012.09.003","journal-title":"Comput Struct"},{"key":"1319_CR78","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0045-7825(99)00389-8","volume":"186","author":"K Deb","year":"2000","unstructured":"Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186:311\u2013338. https:\/\/doi.org\/10.1016\/S0045-7825(99)00389-8","journal-title":"Comput Methods Appl Mech Eng"},{"key":"1319_CR79","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.engappai.2006.03.003","volume":"20","author":"Q He","year":"2007","unstructured":"He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20:89\u201399. https:\/\/doi.org\/10.1016\/j.engappai.2006.03.003","journal-title":"Eng Appl Artif Intell"},{"key":"1319_CR80","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.eswa.2018.11.032","volume":"123","author":"W Long","year":"2019","unstructured":"Long W, Wu T, Liang X, Xu S (2019) Solving high-dimensional global optimization problems using an improved sine cosine algorithm. Expert Syst Appl 123:108\u2013126. https:\/\/doi.org\/10.1016\/j.eswa.2018.11.032","journal-title":"Expert Syst Appl"},{"key":"1319_CR81","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.eswa.2018.06.023","volume":"112","author":"AA Ewees","year":"2018","unstructured":"Ewees AA, Abd Elaziz M, Houssein EH (2018) Improved grasshopper optimization algorithm using opposition-based learning. Expert Syst Appl 112:156\u2013172. https:\/\/doi.org\/10.1016\/j.eswa.2018.06.023","journal-title":"Expert Syst Appl"},{"key":"1319_CR82","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.eswa.2018.05.040","volume":"110","author":"PR Singh","year":"2018","unstructured":"Singh PR, Elaziz MA, Xiong S (2018) Modified Spider Monkey Optimization based on Nelder-Mead method for global optimization. Expert Syst Appl 110:264\u2013289. https:\/\/doi.org\/10.1016\/j.eswa.2018.05.040","journal-title":"Expert Syst Appl"},{"key":"1319_CR83","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A (2016) The Whale optimization algorithm. Adv Eng Softw 95:51\u201367. https:\/\/doi.org\/10.1016\/j.advengsoft.2016.01.008","journal-title":"Adv Eng Softw"},{"key":"1319_CR84","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s00521-015-1870-7","volume":"27","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Mirjalili SM, Hatamlou A (2016) Multi-Verse Optimizer: a nature-inspired algorithm for global optimization. Neural Comput Appl 27:495\u2013513. https:\/\/doi.org\/10.1007\/s00521-015-1870-7","journal-title":"Neural Comput Appl"},{"key":"1319_CR85","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1080\/03081070701303470","volume":"37","author":"E Mezura-Montes","year":"2008","unstructured":"Mezura-Montes E, Coello CAC (2008) An empirical study about the usefulness of evolution strategies to solve constrained optimization problems. Int J Gen Syst 37:443\u2013473","journal-title":"Int J Gen Syst"},{"key":"1319_CR86","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/j.amc.2006.07.105","volume":"186","author":"F Huang","year":"2007","unstructured":"Huang F, Wang L, He Q (2007) An effective co-evolutionary differential evolution for constrained optimization. Appl Math Comput 186:340\u2013356. https:\/\/doi.org\/10.1016\/j.amc.2006.07.105","journal-title":"Appl Math Comput"},{"key":"1319_CR87","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1016\/j.amc.2006.11.033","volume":"188","author":"M Mahdavi","year":"2007","unstructured":"Mahdavi M, Fesanghary M, Damangir E (2007) An improved harmony search algorithm for solving optimization problems. Appl Math Comput 188:1567\u20131579. https:\/\/doi.org\/10.1016\/j.amc.2006.11.033","journal-title":"Appl Math Comput"},{"key":"1319_CR88","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1115\/1.2919393","volume":"116","author":"B Kannan","year":"1994","unstructured":"Kannan B, Kramer S (1994) An augmented lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design. J Mech Des 116:405\u2013411. https:\/\/doi.org\/10.1115\/1.2919393","journal-title":"J Mech Des"},{"key":"1319_CR89","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.engappai.2017.10.024","volume":"68","author":"W Long","year":"2018","unstructured":"Long W, Jiao J, Liang X, Tang M (2018) An exploration-enhanced grey wolf optimizer to solve high-dimensional numerical optimization. Eng Appl Artif Intell 68:63\u201380. https:\/\/doi.org\/10.1016\/j.engappai.2017.10.024","journal-title":"Eng Appl Artif Intell"},{"key":"1319_CR90","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.compstruc.2016.03.001","volume":"169","author":"A Askarzadeh","year":"2016","unstructured":"Askarzadeh A (2016) A novel metaheuristic method for solving constrained engineering optimization problems: Crow search algorithm. Comput Struct 169:1\u201312. https:\/\/doi.org\/10.1016\/j.compstruc.2016.03.001","journal-title":"Comput Struct"},{"key":"1319_CR91","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1108\/02644401011008577","volume":"27","author":"A Kaveh","year":"2010","unstructured":"Kaveh A, Talathari S (2010) An improved ant colony optimization for constrained engineering design problems. Eng Comput 27:155\u2013182. https:\/\/doi.org\/10.1108\/02644401011008577","journal-title":"Eng Comput"},{"key":"1319_CR92","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00366-011-0241-y","volume":"29","author":"AH Gandomi","year":"2013","unstructured":"Gandomi AH, Yang X-S, Alavi AH (2013) Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng Comput 29:17\u201335","journal-title":"Eng Comput"}],"container-title":["Engineering with Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00366-021-01319-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00366-021-01319-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00366-021-01319-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T22:49:30Z","timestamp":1659480570000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00366-021-01319-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,1]]},"references-count":92,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["1319"],"URL":"https:\/\/doi.org\/10.1007\/s00366-021-01319-5","relation":{},"ISSN":["0177-0667","1435-5663"],"issn-type":[{"value":"0177-0667","type":"print"},{"value":"1435-5663","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,1]]},"assertion":[{"value":"20 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"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"}}]}}