{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T00:02:54Z","timestamp":1783468974878,"version":"3.55.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T00:00:00Z","timestamp":1751241600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T00:00:00Z","timestamp":1751241600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71501064"],"award-info":[{"award-number":["71501064"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s12293-025-00468-0","type":"journal-article","created":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T07:54:56Z","timestamp":1751270096000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Dual evolutionary algorithm based on Dyna-Q for distributed heterogeneous hybrid flow shop problems with L-R trapezoidal fuzzy numbers"],"prefix":"10.1007","volume":"17","author":[{"given":"Liangcai","family":"Xia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shijun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weigang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qian","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiying","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,6,30]]},"reference":[{"key":"468_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105044","volume":"125","author":"F Burcin Ozsoydan","year":"2021","unstructured":"Burcin Ozsoydan F, Sa\u011fir M (2021) Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: A case study at a manufacturing plant. Computers & Operations Research 125:105044. https:\/\/doi.org\/10.1016\/j.cor.2020.105044","journal-title":"Computers & Operations Research"},{"issue":"3","key":"468_CR2","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1109\/TEVC.2021.3106168","volume":"26","author":"JJ Wang","year":"2022","unstructured":"Wang JJ, Wang L (2022) A cooperative memetic algorithm with learning-based agent for energy-aware distributed hybrid flow-shop scheduling. IEEE Transactions on Evolutionary Computation 26(3):461\u2013475. https:\/\/doi.org\/10.1109\/TEVC.2021.3106168","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"468_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100858","volume":"62","author":"G Wang","year":"2021","unstructured":"Wang G, Li X, Gao L et al (2021) Energy-efficient distributed heterogeneous welding flow shop scheduling problem using a modified moea\/d. Swarm and Evolutionary Computation 62:100858. https:\/\/doi.org\/10.1016\/j.swevo.2021.100858","journal-title":"Swarm and Evolutionary Computation"},{"issue":"4","key":"468_CR4","doi-asserted-by":"publisher","first-page":"6550","DOI":"10.1109\/TASE.2023.3327792","volume":"21","author":"R Li","year":"2024","unstructured":"Li R, Gong W, Wang L et al (2024) Double dqn-based coevolution for green distributed heterogeneous hybrid flowshop scheduling with multiple priorities of jobs. IEEE Transactions on Automation Science and Engineering 21(4):6550\u20136562. https:\/\/doi.org\/10.1109\/TASE.2023.3327792","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"468_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105536","volume":"194","author":"J Zheng","year":"2020","unstructured":"Zheng J, Wang L, jing Wang J (2020) A cooperative coevolution algorithm for multi-objective fuzzy distributed hybrid flow shop. Knowledge-Based Systems 194:105536. https:\/\/doi.org\/10.1016\/j.knosys.2020.105536","journal-title":"Knowledge-Based Systems"},{"key":"468_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120043","volume":"224","author":"M Sun","year":"2023","unstructured":"Sun M, Cai Z, Zhang H (2023) A teaching-learning-based optimization with feedback for l-r fuzzy flexible assembly job shop scheduling problem with batch splitting. Expert Systems with Applications 224:120043. https:\/\/doi.org\/10.1016\/j.eswa.2023.120043","journal-title":"Expert Systems with Applications"},{"issue":"03","key":"468_CR7","doi-asserted-by":"publisher","first-page":"696","DOI":"10.19734\/j.issn.1001-3695.2020.04.0056","volume":"38","author":"W Sen","year":"2021","unstructured":"Sen W, Li C, Jie Z (2021) Collaborative filtering recommendation algorithm based on fuzzy similarity of items. Computer Application Research 38(03):696\u2013701. https:\/\/doi.org\/10.19734\/j.issn.1001-3695.2020.04.0056","journal-title":"Computer Application Research"},{"issue":"4","key":"468_CR8","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1145\/122344.122377","volume":"2","author":"RS Sutton","year":"1991","unstructured":"Sutton RS (1991) Dyna, an integrated architecture for learning, planning, and reacting. SIGART Bull 2(4):160\u2013163. https:\/\/doi.org\/10.1145\/122344.122377","journal-title":"SIGART Bull"},{"key":"468_CR9","doi-asserted-by":"publisher","unstructured":"Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1. https:\/\/doi.org\/10.1002\/nav.3800010110","DOI":"10.1002\/nav.3800010110"},{"issue":"8","key":"468_CR10","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1080\/07408179908969871","volume":"31","author":"RZ Rios-Mercado","year":"1999","unstructured":"Rios-Mercado RZ, Bard JF (1999) A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times. IIE Transactions 31(8):721\u2013731. https:\/\/doi.org\/10.1080\/07408179908969871","journal-title":"IIE Transactions"},{"key":"468_CR11","doi-asserted-by":"publisher","unstructured":"Mkadem MA, Moukrim A, Serairi M (2017) A branch-and-bound algorithm for the two-machine flow-shop problem with time delays. In: 2017 4th International Conference on Control, Decision and Information Technologies (CoDIT), pp 0690\u20130695, https:\/\/doi.org\/10.1109\/CoDIT.2017.8102675","DOI":"10.1109\/CoDIT.2017.8102675"},{"issue":"1","key":"468_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91\u201395. https:\/\/doi.org\/10.1016\/0305-0483(83)90088-9","journal-title":"Omega"},{"key":"468_CR13","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.eswa.2017.09.032","volume":"92","author":"KC Ying","year":"2018","unstructured":"Ying KC, Lin SW (2018) Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks. Expert Systems with Applications 92:132\u2013141. https:\/\/doi.org\/10.1016\/j.eswa.2017.09.032","journal-title":"Expert Systems with Applications"},{"key":"468_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115453","volume":"183","author":"W Shao","year":"2021","unstructured":"Shao W, Shao Z, Pi D (2021) Multi-objective evolutionary algorithm based on multiple neighborhoods local search for multi-objective distributed hybrid flow shop scheduling problem. Expert Systems with Applications 183:115453. https:\/\/doi.org\/10.1016\/j.eswa.2021.115453","journal-title":"Expert Systems with Applications"},{"issue":"6","key":"468_CR15","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1109\/TETCI.2020.3022372","volume":"5","author":"Wang Jj","year":"2021","unstructured":"Jj Wang, Wang L (2021) A bi-population cooperative memetic algorithm for distributed hybrid flow-shop scheduling. IEEE Transactions on Emerging Topics in Computational Intelligence 5(6):947\u2013961. https:\/\/doi.org\/10.1109\/TETCI.2020.3022372","journal-title":"IEEE Transactions on Emerging Topics in Computational Intelligence"},{"issue":"4","key":"468_CR16","doi-asserted-by":"publisher","first-page":"3379","DOI":"10.1109\/TASE.2021.3119353","volume":"19","author":"W Shao","year":"2022","unstructured":"Shao W, Shao Z, Pi D (2022) An ant colony optimization behavior-based moea\/d for distributed heterogeneous hybrid flow shop scheduling problem under nonidentical time-of-use electricity tariffs. IEEE Transactions on Automation Science and Engineering 19(4):3379\u20133394. https:\/\/doi.org\/10.1109\/TASE.2021.3119353","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"468_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101190","volume":"75","author":"W Shao","year":"2022","unstructured":"Shao W, Shao Z, Pi D (2022) A network memetic algorithm for energy and labor-aware distributed heterogeneous hybrid flow shop scheduling problem. Swarm and Evolutionary Computation 75:101190. https:\/\/doi.org\/10.1016\/j.swevo.2022.101190","journal-title":"Swarm and Evolutionary Computation"},{"key":"468_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.asoc.2014.03.031","volume":"21","author":"J Behnamian","year":"2014","unstructured":"Behnamian J, Fatemi Ghomi S (2014) Multi-objective fuzzy multiprocessor flowshop scheduling. Applied Soft Computing 21:139\u2013148. https:\/\/doi.org\/10.1016\/j.asoc.2014.03.031","journal-title":"Applied Soft Computing"},{"key":"468_CR19","doi-asserted-by":"publisher","first-page":"12103","DOI":"10.1007\/s00500-019-03767-0","volume":"23","author":"FP Golneshini","year":"2019","unstructured":"Golneshini FP, Fazlollahtabar H (2019) Meta-heuristic algorithms for a clustering-based fuzzy bi-criteria hybrid flow shop scheduling problem. Soft Computing 23:12103\u201312122. https:\/\/doi.org\/10.1007\/s00500-019-03767-0","journal-title":"Soft Computing"},{"issue":"10","key":"468_CR20","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1177\/0959651819827705","volume":"233","author":"B Zhou","year":"2019","unstructured":"Zhou B, Liu W (2019) Energy-efficient multi-objective scheduling algorithm for hybrid flow shop with fuzzy processing time. Proceedings of the Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering 233(10):1282\u20131297. https:\/\/doi.org\/10.1177\/0959651819827705","journal-title":"Proceedings of the Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering"},{"key":"468_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/JIFS-191175","volume":"38","author":"J Cai","year":"2020","unstructured":"Cai J, Lei D (2020) Fuzzy distributed two-stage hybrid flow shop scheduling problem with setup time: collaborative variable search. Journal of Intelligent & Fuzzy Systems 38:1\u201311. https:\/\/doi.org\/10.3233\/JIFS-191175","journal-title":"Journal of Intelligent & Fuzzy Systems"},{"key":"468_CR22","doi-asserted-by":"publisher","first-page":"214209","DOI":"10.1109\/ACCESS.2020.3041369","volume":"8","author":"L Wang","year":"2020","unstructured":"Wang L, Li D (2020) Fuzzy distributed hybrid flow shop scheduling problem with heterogeneous factory and unrelated parallel machine: A shuffled frog leaping algorithm with collaboration of multiple search strategies. IEEE Access 8:214209\u2013214223. https:\/\/doi.org\/10.1109\/ACCESS.2020.3041369","journal-title":"IEEE Access"},{"issue":"3","key":"468_CR23","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1109\/TEVC.2022.3175832","volume":"27","author":"R Li","year":"2023","unstructured":"Li R, Gong W, Lu C et al (2023) A learning-based memetic algorithm for energy-efficient flexible job-shop scheduling with type-2 fuzzy processing time. IEEE Transactions on Evolutionary Computation 27(3):610\u2013620. https:\/\/doi.org\/10.1109\/TEVC.2022.3175832","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"6","key":"468_CR24","doi-asserted-by":"publisher","first-page":"3753","DOI":"10.1109\/TFUZZ.2024.3382398","volume":"32","author":"F Yu","year":"2024","unstructured":"Yu F, Yin L, Zeng B et al (2024) A self-learning discrete artificial bee colony algorithm for energy-efficient distributed heterogeneous l-r fuzzy welding shop scheduling problem. IEEE Transactions on Fuzzy Systems 32(6):3753\u20133764. https:\/\/doi.org\/10.1109\/TFUZZ.2024.3382398","journal-title":"IEEE Transactions on Fuzzy Systems"},{"issue":"1","key":"468_CR25","first-page":"185","volume":"41","author":"TX Liu Sijia","year":"2021","unstructured":"Liu Sijia TX (2021) Urban transportation route planning based on intensive learning. Computer Application 41(1):185","journal-title":"Computer Application"},{"key":"468_CR26","doi-asserted-by":"publisher","first-page":"323","DOI":"10.3233\/IFS-2012-0556","volume":"24","author":"STH Mortaji","year":"2013","unstructured":"Mortaji STH, Bagherpour M, Noori S (2013) Fuzzy earned value management using l-r fuzzy numbers. Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology 24:323\u2013332. https:\/\/doi.org\/10.3233\/IFS-2012-0556","journal-title":"Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology"},{"key":"468_CR27","doi-asserted-by":"publisher","unstructured":"Salahshour S, Abbasbandy S, Allahviranloo T (2011) Ranking fuzzy numbers using fuzzy maximizing-minimizing points. In: EUSFLAT Conf., https:\/\/doi.org\/10.2991\/eusflat.2011.115","DOI":"10.2991\/eusflat.2011.115"},{"issue":"9","key":"468_CR28","doi-asserted-by":"publisher","first-page":"10906","DOI":"10.1016\/j.eswa.2011.02.131","volume":"38","author":"A Kumar","year":"2011","unstructured":"Kumar A, Singh P, Kaur P et al (2011) A new approach for ranking of l\u2013r type generalized fuzzy numbers. Expert Systems with Applications 38(9):10906\u201310910. https:\/\/doi.org\/10.1016\/j.eswa.2011.02.131","journal-title":"Expert Systems with Applications"},{"issue":"7","key":"468_CR29","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1016\/j.fss.2005.11.006","volume":"157","author":"YM Wang","year":"2006","unstructured":"Wang YM, Yang JB, Xu DL et al (2006) On the centroids of fuzzy numbers. Fuzzy Sets and Systems 157(7):919\u2013926. https:\/\/doi.org\/10.1016\/j.fss.2005.11.006","journal-title":"Fuzzy Sets and Systems"},{"key":"468_CR30","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1016\/j.jclepro.2016.06.161","volume":"137","author":"J Yan","year":"2016","unstructured":"Yan J, Li L, Zhao F et al (2016) A multi-level optimization approach for energy-efficient flexible flow shop scheduling. Journal of Cleaner Production 137:1543\u20131552. https:\/\/doi.org\/10.1016\/j.jclepro.2016.06.161","journal-title":"Journal of Cleaner Production"},{"key":"468_CR31","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","volume":"174","author":"X Li","year":"2016","unstructured":"Li X, Gao L (2016) An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. International Journal of Production Economics 174:93\u2013110. https:\/\/doi.org\/10.1016\/j.ijpe.2016.01.016","journal-title":"International Journal of Production Economics"},{"key":"468_CR32","unstructured":"MacQueen J (1967) Some methods for classification and analysis of multivariate observations"},{"issue":"2","key":"468_CR33","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S et al (2002) A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Transactions on Evolutionary Computation 6(2):182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"4","key":"468_CR34","doi-asserted-by":"publisher","first-page":"3563","DOI":"10.1016\/j.eswa.2010.08.145","volume":"38","author":"G Zhang","year":"2011","unstructured":"Zhang G, Gao L, Shi Y (2011) An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Systems with Applications 38(4):3563\u20133573. https:\/\/doi.org\/10.1016\/j.eswa.2010.08.145","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"468_CR35","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1162\/106365600568158","volume":"8","author":"DAV Veldhuizen","year":"2000","unstructured":"Veldhuizen DAV, Lamont GB (2000) Multiobjective evolutionary algorithms: Analyzing the state-of-the-art. Evolutionary Computation 8(2):125\u2013147. https:\/\/doi.org\/10.1162\/106365600568158","journal-title":"Evolutionary Computation"},{"key":"468_CR36","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s00500-008-0394-9","volume":"14","author":"Y Wang","year":"2010","unstructured":"Wang Y, Wu L, Yuan X (2010) Multi-objective self-adaptive differential evolution with elitist archive and crowding entropy-based diversity measure. Soft Comput 14:193\u2013209. https:\/\/doi.org\/10.1007\/s00500-008-0394-9","journal-title":"Soft Comput"},{"key":"468_CR37","doi-asserted-by":"publisher","unstructured":"While L, Hingston P, Barone L et al (2006) A faster algorithm for calculating hypervolume. IEEE Transactions on Evolutionary Computation 10(1):29\u201338. https:\/\/doi.org\/10.1109\/TEVC.2005.851275","DOI":"10.1109\/TEVC.2005.851275"},{"key":"468_CR38","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1198\/004017002320256440","volume":"44","author":"RCV Nostrand","year":"2002","unstructured":"Nostrand RCV (2002) Design of experiments using the taguchi approach: 16 steps to product and process improvement. Technometrics 44:289. https:\/\/doi.org\/10.1198\/004017002320256440","journal-title":"Technometrics"},{"key":"468_CR39","doi-asserted-by":"publisher","unstructured":"Zhang Q, Li H (2007) Moea\/d: A multiobjective evolutionary algorithm based on decomposition. IEEE Transactions on Evolutionary Computation 11(6):712\u2013731. https:\/\/doi.org\/10.1109\/TEVC.2007.892759","DOI":"10.1109\/TEVC.2007.892759"},{"issue":"6","key":"468_CR40","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1109\/TETCI.2020.3022372","volume":"5","author":"Wang Jj","year":"2021","unstructured":"Jj Wang, Wang L (2021) A bi-population cooperative memetic algorithm for distributed hybrid flow-shop scheduling. IEEE Transactions on Emerging Topics in Computational Intelligence 5(6):947\u2013961. https:\/\/doi.org\/10.1109\/TETCI.2020.3022372","journal-title":"IEEE Transactions on Emerging Topics in Computational Intelligence"},{"issue":"2","key":"468_CR41","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TEVC.2008.925798","volume":"13","author":"H Li","year":"2009","unstructured":"Li H, Zhang Q (2009) Multiobjective optimization problems with complicated pareto sets, moea\/d and nsga-ii. IEEE Transactions on Evolutionary Computation 13(2):284\u2013302. https:\/\/doi.org\/10.1109\/TEVC.2008.925798","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00468-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-025-00468-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00468-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T06:54:32Z","timestamp":1757573672000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-025-00468-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,30]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["468"],"URL":"https:\/\/doi.org\/10.1007\/s12293-025-00468-0","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,30]]},"assertion":[{"value":"12 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2025","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 competing interests","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"35"}}