{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:58:18Z","timestamp":1787320698139,"version":"build-2736575974"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T00:00:00Z","timestamp":1716336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T00:00:00Z","timestamp":1716336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"public welfare research program of Zhejiang Province","award":["LGN22C140007, LGG19F050003"],"award-info":[{"award-number":["LGN22C140007, LGG19F050003"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Comput Intell Syst"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Gaussian bare-bone imperialist competitive algorithm (GBB-ICA) is an effective variant of imperialist competitive algorithm (ICA), which updates the position of colonies by sampling a Gaussian distribution. However, the mean and standard deviation adopted by GBB-ICA is calculated only using the positions of imperialist and the colony itself, making the searching tends to trap into local optimum. To overcome this drawback, a new double Gaussian sampling strategy is proposed in this paper. An extra Gaussian sampling point, whose mean and standard is calculated using the positions of the second best colony and the current colony itself, is introduced into GBB-ICA. To further speed up the convergence and explore informative region, the quasi-oppositional learning technique is incorporated into GBB-ICA to produce more potential candidates in the assimilation step as well as generating a higher quality initial population. The proposed algorithm is called quasi-oppositional learning-based double Gaussian sampling bare-bone imperialist competitive algorithm (QOLBDGSBB-ICA) and is tested on 20 benchmark functions and four engineering design problems. Experimental results show that the proposed algorithm outperforms over other referenced ICA variants on 19 benchmark functions, which well validates the effectiveness of the proposed algorithm.<\/jats:p>","DOI":"10.1007\/s44196-024-00503-x","type":"journal-article","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T07:01:51Z","timestamp":1716361311000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Enhanced Gaussian Bare-Bone Imperialist Competition Algorithm Based on Doubling Sampling and Quasi-oppositional Learning for Global Optimization"],"prefix":"10.1007","volume":"17","author":[{"given":"Dongge","family":"Lei","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lulu","family":"Cai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2624-3134","authenticated-orcid":false,"given":"Fei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"key":"503_CR1","doi-asserted-by":"publisher","unstructured":"Abdechiri, M., Faez, K., Bahrami, H.: Adaptive imperialist competitive algorithm (aica). In: 9th IEEE International Conference on Cognitive Informatics (ICCI\u201910). IEEE, pp. 940\u2013945 (2010). https:\/\/doi.org\/10.1109\/COGINF.2010.5599776","DOI":"10.1109\/COGINF.2010.5599776"},{"issue":"9","key":"503_CR2","doi-asserted-by":"publisher","first-page":"3794","DOI":"10.1016\/j.eswa.2012.12.093","volume":"40","author":"LD Afonso","year":"2013","unstructured":"Afonso, L.D., Mariani, V.C., Dos Santos, C.L.: Modified imperialist competitive algorithm based on attraction and repulsion concepts for reliability-redundancy optimization. Expert Syst. Appl. 40(9), 3794\u20133802 (2013). https:\/\/doi.org\/10.1016\/j.eswa.2012.12.093","journal-title":"Expert Syst. Appl."},{"issue":"11","key":"503_CR3","doi-asserted-by":"publisher","first-page":"7549","DOI":"10.1007\/s00521-018-3587-x","volume":"31","author":"Z Aliniya","year":"2019","unstructured":"Aliniya, Z., Keyvanpour, M.R.: CB-ICA: a crossover-based imperialist competitive algorithm for large-scale problems and engineering design optimization. Neural Comput. Appl. 31(11), 7549\u20137570 (2019). https:\/\/doi.org\/10.1007\/s00521-018-3587-x","journal-title":"Neural Comput. Appl."},{"key":"503_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.eswa.2018.09.050","volume":"117","author":"Z Aliniya","year":"2019","unstructured":"Aliniya, Z., Mirroshandel, S.A.: A novel combinatorial merge-split approach for automatic clustering using imperialist competitive algorithm. Expert Syst. Appl. 117, 243\u2013266 (2019). https:\/\/doi.org\/10.1016\/j.eswa.2018.09.050","journal-title":"Expert Syst. Appl."},{"key":"503_CR5","doi-asserted-by":"publisher","unstructured":"Atashpaz-Gargari, E., Lucas, C.: Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: 2007 IEEE Congress on Evolutionary Computation. IEEE, pp. 4661\u20134667 (2007). https:\/\/doi.org\/10.1109\/CEC.2007.4425083","DOI":"10.1109\/CEC.2007.4425083"},{"issue":"5\u20138","key":"503_CR6","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1007\/s00170-012-4233-x","volume":"65","author":"AH Banisadr","year":"2013","unstructured":"Banisadr, A.H., Zandieh, M., Mahdavi, I.: A hybrid imperialist competitive algorithm for single-machine scheduling problem with linear earliness and quadratic tardiness penalties. Int. J. Adv. Manuf. Technol. 65(5\u20138), 981\u2013989 (2013). https:\/\/doi.org\/10.1007\/s00170-012-4233-x","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"503_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2020.102183","volume":"106","author":"W Barkhoda","year":"2020","unstructured":"Barkhoda, W., Sheikhi, H.: Immigrant imperialist competitive algorithm to solve the multi-constraint node placement problem in target-based wireless sensor networks. Ad Hoc Netw. 106, 102183 (2020). https:\/\/doi.org\/10.1016\/j.adhoc.2020.102183","journal-title":"Ad Hoc Netw."},{"key":"503_CR8","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.asoc.2015.10.048","volume":"40","author":"N Ben Guedria","year":"2016","unstructured":"Ben Guedria, N.: Improved accelerated pso algorithm for mechanical engineering optimization problems. Appl. Soft Comput. 40, 455\u2013467 (2016). https:\/\/doi.org\/10.1016\/j.asoc.2015.10.048","journal-title":"Appl. Soft Comput."},{"key":"503_CR9","doi-asserted-by":"publisher","unstructured":"Bernal, E., Castillo, O., Soria, J., et\u00a0al.: Interval type-2 fuzzy logic for dynamic parameter adjustment in the imperialist competitive algorithm. In: 2019 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), pp. 1\u20135 (2019). https:\/\/doi.org\/10.1109\/FUZZ-IEEE.2019.8858935","DOI":"10.1109\/FUZZ-IEEE.2019.8858935"},{"key":"503_CR10","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/j.neucom.2015.09.025","volume":"173","author":"CH Chen","year":"2016","unstructured":"Chen, C.H., Chen, W.H.: Bare-bones imperialist competitive algorithm for a compensatory neural fuzzy controller. Neurocomputing 173, 1519\u20131528 (2016). https:\/\/doi.org\/10.1016\/j.neucom.2015.09.025","journal-title":"Neurocomputing"},{"key":"503_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.apm.2019.02.004","volume":"71","author":"H Chen","year":"2019","unstructured":"Chen, H., Xu, Y., Wang, M., et al.: A balanced whale optimization algorithm for constrained engineering design problems. Appl. Math. Model. 71, 45\u201359 (2019). https:\/\/doi.org\/10.1016\/j.apm.2019.02.004","journal-title":"Appl. Math. Model."},{"issue":"1","key":"503_CR12","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.isatra.2011.08.005","volume":"51","author":"A Ebrahimzadeh","year":"2012","unstructured":"Ebrahimzadeh, A., Addeh, J., Rahmani, Z.: Control chart pattern recognition using k-mica clustering and neural networks. ISA Trans. 51(1), 111\u2013119 (2012). https:\/\/doi.org\/10.1016\/j.isatra.2011.08.005","journal-title":"ISA Trans."},{"key":"503_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.compstruc.2012.07.010","volume":"110\u2013111","author":"H Eskandar","year":"2012","unstructured":"Eskandar, H., Sadollah, A., Bahreininejad, A., et al.: Water cycle algorithm\u2014a novel metaheuristic optimization method for solving constrained engineering optimization problems. Comput. Struct. 110\u2013111, 151\u2013166 (2012). https:\/\/doi.org\/10.1016\/j.compstruc.2012.07.010","journal-title":"Comput. Struct."},{"key":"503_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113377","volume":"152","author":"A Faramarzi","year":"2020","unstructured":"Faramarzi, A., Heidarinejad, M., Mirjalili, S., et al.: Marine predators algorithm: a nature-inspired metaheuristic. Expert Syst. Appl. 152, 113377 (2020). https:\/\/doi.org\/10.1016\/j.eswa.2020.113377","journal-title":"Expert Syst. Appl."},{"key":"503_CR15","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.eswa.2018.05.027","volume":"110","author":"MP Ferreira","year":"2018","unstructured":"Ferreira, M.P., Rocha, M.L., Silva Neto, A.J., et al.: A constrained itgo heuristic applied to engineering optimization. Expert Syst. Appl. 110, 106\u2013124 (2018). https:\/\/doi.org\/10.1016\/j.eswa.2018.05.027","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"503_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.cnsns.2012.06.009","volume":"18","author":"AH Gandomi","year":"2013","unstructured":"Gandomi, A.H., Yang, X.S., Talatahari, S., et al.: Firefly algorithm with chaos. Commun. Nonlinear Sci. Numer. Simul. 18(1), 89\u201398 (2013). https:\/\/doi.org\/10.1016\/j.cnsns.2012.06.009","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"key":"503_CR17","doi-asserted-by":"crossref","unstructured":"Gazi, V., Passino, K.M., Gazi, V., et al.: Bacteria foraging optimization. In: Swarm Stability and Optimization, pp. 233\u2013249. Springer, Berlin Heidelberg, Berlin, Heidelberg (2011)","DOI":"10.1007\/978-3-642-18041-5_11"},{"issue":"23","key":"503_CR18","doi-asserted-by":"publisher","first-page":"9603","DOI":"10.1016\/j.apm.2013.05.002","volume":"37","author":"SM Goldansaz","year":"2013","unstructured":"Goldansaz, S.M., Jolai, F., Zahedi Anaraki, A.H.: A hybrid imperialist competitive algorithm for minimizing Makespan in a multi-processor open shop. Appl. Math. Model. 37(23), 9603\u20139616 (2013). https:\/\/doi.org\/10.1016\/j.apm.2013.05.002","journal-title":"Appl. Math. Model."},{"issue":"24","key":"503_CR19","doi-asserted-by":"publisher","first-page":"11149","DOI":"10.1016\/j.amc.2013.05.027","volume":"219","author":"L Idoumghar","year":"2013","unstructured":"Idoumghar, L., Ch\u00e9rin, N., Siarry, P., et al.: Hybrid ICA-PSO algorithm for continuous optimization. Appl. Math. Comput. 219(24), 11149\u201311170 (2013). https:\/\/doi.org\/10.1016\/j.amc.2013.05.027","journal-title":"Appl. Math. Comput."},{"key":"503_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115665","volume":"185","author":"H Jia","year":"2021","unstructured":"Jia, H., Peng, X., Lang, C.: Remora optimization algorithm. Expert Syst. Appl. 185, 115665 (2021). https:\/\/doi.org\/10.1016\/j.eswa.2021.115665","journal-title":"Expert Syst. Appl."},{"key":"503_CR21","first-page":"30","volume":"26","author":"D Kalyanmoy","year":"1996","unstructured":"Kalyanmoy, D., Goyal, M.: A combined genetic adaptive search (geneas) for engineering design. Comput. Sci. Informatics 26, 30\u201345 (1996)","journal-title":"Comput. Sci. Informatics"},{"issue":"2","key":"503_CR22","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1115\/1.2919393","volume":"116","author":"BK Kannan","year":"1994","unstructured":"Kannan, B.K., Kramer, S.N.: An augmented Lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design. J. Mech. Design 116(2), 405\u2013411 (1994). https:\/\/doi.org\/10.1115\/1.2919393","journal-title":"J. Mech. Design"},{"key":"503_CR23","doi-asserted-by":"publisher","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN\u201995 - International Conference on Neural Networks, pp. 1942\u20131948 vol.4, (1995). https:\/\/doi.org\/10.1109\/ICNN.1995.488968","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"4","key":"503_CR24","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s00521-014-1752-4","volume":"26","author":"AA Khaled","year":"2015","unstructured":"Khaled, A.A., Hosseini, S.: Fuzzy adaptive imperialist competitive algorithm for global optimization. Neural Comput. Appl. 26(4), 813\u2013825 (2015). https:\/\/doi.org\/10.1007\/s00521-014-1752-4","journal-title":"Neural Comput. Appl."},{"key":"503_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108789","volume":"248","author":"AM Khalid","year":"2022","unstructured":"Khalid, A.M., Hamza, H.M., Mirjalili, S., et al.: Bcovidoa: a novel binary coronavirus disease optimization algorithm for feature selection. Knowl.-Based Syst. 248, 108789 (2022). https:\/\/doi.org\/10.1016\/j.knosys.2022.108789","journal-title":"Knowl.-Based Syst."},{"key":"503_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-022-07639-x","author":"AM Khalid","year":"2022","unstructured":"Khalid, A.M., Hosny, K.M., Mirjalili, S.: Covidoa: a novel evolutionary optimization algorithm based on coronavirus disease replication lifecycle. Neural Comput. Appl. (2022). https:\/\/doi.org\/10.1007\/s00521-022-07639-x","journal-title":"Neural Comput. Appl."},{"key":"503_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108641","volume":"172","author":"Y Li","year":"2022","unstructured":"Li, Y., Yang, Z., Wang, L., et al.: A hybrid imperialist competitive algorithm for energy-efficient flexible job shop scheduling problem with variable-size sublots. Comput. Ind. Eng. 172, 108641 (2022). https:\/\/doi.org\/10.1016\/j.cie.2022.108641","journal-title":"Comput. Ind. Eng."},{"key":"503_CR28","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.ijepes.2016.03.039","volume":"83","author":"M Mehdinejad","year":"2016","unstructured":"Mehdinejad, M., Mohammadi-Ivatloo, B., Dadashzadeh-Bonab, R., et al.: Solution of optimal reactive power dispatch of power systems using hybrid particle swarm optimization and imperialist competitive algorithms. Int. J. Electr. Power 83, 104\u2013116 (2016). https:\/\/doi.org\/10.1016\/j.ijepes.2016.03.039","journal-title":"Int. J. Electr. Power"},{"key":"503_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.measurement.2020.108837","volume":"172","author":"H Moayedi","year":"2021","unstructured":"Moayedi, H., G\u00f6r, M., Kok Foong, L., et al.: Imperialist competitive algorithm hybridized with multilayer perceptron to predict the load-settlement of square footing on layered soils. Measurement 172, 108837 (2021). https:\/\/doi.org\/10.1016\/j.measurement.2020.108837","journal-title":"Measurement"},{"issue":"7","key":"503_CR30","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1007\/s00521-015-1828-9","volume":"26","author":"A Mortazavi","year":"2015","unstructured":"Mortazavi, A., Khamseh, A.A., Naderi, B.: A novel chaotic imperialist competitive algorithm for production and air transportation scheduling problems. Neural Comput. Appl. 26(7), 1709\u20131723 (2015). https:\/\/doi.org\/10.1007\/s00521-015-1828-9","journal-title":"Neural Comput. Appl."},{"issue":"3","key":"503_CR31","doi-asserted-by":"publisher","first-page":"1279","DOI":"10.1007\/s00500-021-06401-0","volume":"26","author":"I Naruei","year":"2022","unstructured":"Naruei, I., Keynia, F., Sabbagh Molahosseini, A.: Hunter-prey optimization: algorithm and applications. Soft. Comput. 26(3), 1279\u20131314 (2022). https:\/\/doi.org\/10.1007\/s00500-021-06401-0","journal-title":"Soft. Comput."},{"issue":"3","key":"503_CR32","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s12046-011-0026-4","volume":"36","author":"T Niknam","year":"2011","unstructured":"Niknam, T., Fard, E.T., Ehrampoosh, S., et al.: A new hybrid imperialist competitive algorithm on data clustering. Sadhana - Acad. Proc. Eng. Sci. 36(3), 293\u2013315 (2011). https:\/\/doi.org\/10.1007\/s12046-011-0026-4","journal-title":"Sadhana - Acad. Proc. Eng. Sci."},{"issue":"2","key":"503_CR33","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.engappai.2010.10.001","volume":"24","author":"T Niknama","year":"2011","unstructured":"Niknama, T., Fard, E.T., Pourjafarian, N., et al.: An efficient hybrid algorithm based on modified imperialist competitive algorithm and k-means for data clustering. Eng. Appl. Artif. Intel. 24(2), 306\u2013317 (2011). https:\/\/doi.org\/10.1016\/j.engappai.2010.10.001","journal-title":"Eng. Appl. Artif. Intel."},{"key":"503_CR34","doi-asserted-by":"publisher","unstructured":"Price, K.V.: Differential evolution: a fast and simple numerical optimizer. In: Proceedings of North American Fuzzy Information Processing, pp. 524\u2013527 (1996). https:\/\/doi.org\/10.1109\/NAFIPS.1996.534790","DOI":"10.1109\/NAFIPS.1996.534790"},{"key":"503_CR35","doi-asserted-by":"publisher","unstructured":"Rabiee, A., Sadeghi, M., Aghaei, J.: Modified imperialist competitive algorithm for environmental constrained energy management of microgrids. J. Clean. Prod. 202, 273\u2013292 (2018). https:\/\/doi.org\/10.1016\/j.jclepro.2018.08.129","DOI":"10.1016\/j.jclepro.2018.08.129"},{"key":"503_CR36","doi-asserted-by":"publisher","unstructured":"Rahnamayan, S., Tizhoosh, H.R., Salama, M.M.: Quasi-oppositional differential evolution. In: 2007 IEEE Congress on Evolutionary Computation, pp. 2229\u20132236 (2007). https:\/\/doi.org\/10.1109\/CEC.2007.4424748","DOI":"10.1109\/CEC.2007.4424748"},{"issue":"3","key":"503_CR37","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.cad.2010.12.015","volume":"43","author":"R Rao","year":"2011","unstructured":"Rao, R., Savsani, V., Vakharia, D.: Teaching\u2013learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput.-Aided Des. 43(3), 303\u2013315 (2011). https:\/\/doi.org\/10.1016\/j.cad.2010.12.015","journal-title":"Comput.-Aided Des."},{"key":"503_CR38","doi-asserted-by":"publisher","unstructured":"Reisi, N., Hadipour Lakmesari, S., Mahmoodabadi, M., et al.: Optimum fuzzy control of human immunodeficiency virus type1 using an imperialist competitive algorithm. Informatics Med. Unlocked 16, 100241 (2019). https:\/\/doi.org\/10.1016\/j.imu.2019.100241","DOI":"10.1016\/j.imu.2019.100241"},{"key":"503_CR39","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.robot.2015.11.010","volume":"76","author":"AK Sadhu","year":"2016","unstructured":"Sadhu, A.K., Rakshit, P., Konar, A.: A modified imperialist competitive algorithm for multi-robot stick-carrying application. Robot. Auton. Syst. 76, 15\u201335 (2016). https:\/\/doi.org\/10.1016\/j.robot.2015.11.010","journal-title":"Robot. Auton. Syst."},{"key":"503_CR40","doi-asserted-by":"publisher","unstructured":"Simon, D.: Biogeography-based optimization 12(6), 702\u2013713 (2008). https:\/\/doi.org\/10.1109\/TEVC.2008.919004","DOI":"10.1109\/TEVC.2008.919004"},{"key":"503_CR41","doi-asserted-by":"publisher","unstructured":"Tizhoosh, H.: 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 (2005). https:\/\/doi.org\/10.1109\/CIMCA.2005.1631345","DOI":"10.1109\/CIMCA.2005.1631345"},{"issue":"7","key":"503_CR42","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1007\/s00521-015-2138-y","volume":"28","author":"S Xu","year":"2017","unstructured":"Xu, S., Wang, Y., Lu, P.: Improved imperialist competitive algorithm with mutation operator for continuous optimization problems. Neural Comput. Appl. 28(7), 1667\u20131682 (2017). https:\/\/doi.org\/10.1007\/s00521-015-2138-y","journal-title":"Neural Comput. Appl."},{"issue":"7","key":"503_CR43","first-page":"3166","volume":"217","author":"G Zhu","year":"2010","unstructured":"Zhu, G., Kwong, S.: Gbest-guided artificial bee colony algorithm for numerical function optimization. Appl. Math. Comput. 217(7), 3166\u20133173 (2010)","journal-title":"Appl. Math. Comput."}],"container-title":["International Journal of Computational Intelligence Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44196-024-00503-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44196-024-00503-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44196-024-00503-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T07:17:46Z","timestamp":1716362266000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44196-024-00503-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,22]]},"references-count":43,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["503"],"URL":"https:\/\/doi.org\/10.1007\/s44196-024-00503-x","relation":{},"ISSN":["1875-6883"],"issn-type":[{"value":"1875-6883","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,22]]},"assertion":[{"value":"7 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"128"}}