{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T14:49:42Z","timestamp":1774968582737,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T00:00:00Z","timestamp":1768348800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T00:00:00Z","timestamp":1768348800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100020771","name":"Natural Science Foundation for Young Scientists of Shanxi Province","doi-asserted-by":"publisher","award":["U22B2017"],"award-info":[{"award-number":["U22B2017"]}],"id":[{"id":"10.13039\/501100020771","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100016909","name":"Microsoft Research Asia","doi-asserted-by":"publisher","award":["100338928"],"award-info":[{"award-number":["100338928"]}],"id":[{"id":"10.13039\/100016909","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10732-025-09578-x","type":"journal-article","created":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T05:43:06Z","timestamp":1768369386000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem and its Variants"],"prefix":"10.1007","volume":"32","author":[{"given":"Long","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiongzhi","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengda","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,14]]},"reference":[{"key":"9578_CR1","doi-asserted-by":"crossref","unstructured":"Barrett, T., Clements, W., Foerster, J., Lvovsky, A.: Exploratory combinatorial optimization with reinforcement learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, 3243\u20133250 (2020)","DOI":"10.1609\/aaai.v34i04.5723"},{"key":"9578_CR2","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. In: Proceedings of the 5th International Conference on Learning Representations (2017)"},{"key":"9578_CR3","first-page":"351","volume":"14","author":"ML Braun","year":"2001","unstructured":"Braun, M.L., Buhmann, J.M.: The noisy euclidean traveling salesman problem and learning. Advances in Neural Information Processing Systems 14, 351\u2013358 (2001)","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"1","key":"9578_CR4","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manage. Sci."},{"key":"9578_CR5","unstructured":"Dubois, O., Dequen, G.: A backbone-search heuristic for efficient solving of hard 3-SAT formulae. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence, 248\u2013253 (2001)"},{"key":"9578_CR6","unstructured":"Gehring, H., Homberger, J.: A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: Proceedings of EUROGEN99, 2, 57\u201364 (1999)"},{"issue":"1\u20133","key":"9578_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F Glover","year":"1996","unstructured":"Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discret. Appl. Math. 65(1\u20133), 223\u2013253 (1996)","journal-title":"Discret. Appl. Math."},{"key":"9578_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.104018","volume":"97","author":"P He","year":"2021","unstructured":"He, P., Hao, J.: Iterated two-phase local search for the colored traveling salesmen problem. Eng. Appl. Artif. Intell. 97, 104018 (2021)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"9578_CR9","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.ins.2021.04.090","volume":"570","author":"P He","year":"2021","unstructured":"He, P., Hao, J., Wu, Q.: Grouping memetic search for the colored traveling salesmen problem. Inf. Sci. 570, 689\u2013707 (2021)","journal-title":"Inf. Sci."},{"issue":"6","key":"9578_CR10","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. Oper. Res. 18(6), 1138\u20131162 (1970)","journal-title":"Oper. Res."},{"issue":"1","key":"9578_CR11","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M Held","year":"1971","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees: Part II. Math. Program. 1(1), 6\u201325 (1971)","journal-title":"Math. Program."},{"key":"9578_CR12","unstructured":"Helsgaun, K.: An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems. Roskilde: Roskilde University 12 (2017)"},{"issue":"1","key":"9578_CR13","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9578_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","volume":"1","author":"K Helsgaun","year":"2009","unstructured":"Helsgaun, K.: General k-opt submoves for the Lin-Kernighan TSP heuristic. Math. Program. Comput. 1, 119\u2013163 (2009)","journal-title":"Math. Program. Comput."},{"key":"9578_CR15","doi-asserted-by":"crossref","unstructured":"Hu, Y., Yu, Y., Liao, J.: Cascaded algorithm-selection and hyper-parameter optimization with extreme-region upper confidence bound bandit. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence, 2528\u20132534 (2019)","DOI":"10.24963\/ijcai.2019\/351"},{"key":"9578_CR16","doi-asserted-by":"crossref","unstructured":"Jin, Y., Ding, Y., Pan, X., He, K., Zhao, L., Qin, T., Song, L., Bian, J.: Pointerformer: Deep reinforced multi-pointer transformer for the traveling salesman problem. In: Proceedings of the 37th AAAI Conference on Artificial Intelligence, 8132\u20138140 (2023)","DOI":"10.1609\/aaai.v37i7.25982"},{"issue":"4","key":"9578_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0167-6377(86)90081-7","volume":"5","author":"R Jonker","year":"1986","unstructured":"Jonker, R., Volgenant, T.: Transforming asymmetric into symmetric traveling salesman problems: Erratum. Oper. Res. Lett. 5(4), 215\u2013216 (1986)","journal-title":"Oper. Res. Lett."},{"key":"9578_CR18","first-page":"6348","volume":"30","author":"EB Khalil","year":"2017","unstructured":"Khalil, E.B., Dai, H., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. Advances in Neural Information Processing Systems 30, 6348\u20136358 (2017)","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"2","key":"9578_CR19","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/s10732-025-09553-6","volume":"31","author":"S Lan","year":"2025","unstructured":"Lan, S., Lu, Y., Fan, W.: An adaptive variable neighborhood search for the traveling salesman problem with job-times. Journal of Heuristics 31(2), 18 (2025)","journal-title":"Journal of Heuristics"},{"key":"9578_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.111266","volume":"153","author":"Z Lei","year":"2024","unstructured":"Lei, Z., Hao, J.-K.: An effective memetic algorithm for the close-enough traveling salesman problem. Appl. Soft Comput. 153, 111266 (2024)","journal-title":"Appl. Soft Comput."},{"issue":"12","key":"9578_CR21","doi-asserted-by":"publisher","first-page":"13572","DOI":"10.1109\/TCYB.2021.3111082","volume":"52","author":"J Li","year":"2022","unstructured":"Li, J., Ma, Y., Gao, R., Cao, Z., Lim, A., Song, W., Zhang, J.: Deep reinforcement learning for solving the heterogeneous capacitated vehicle routing problem. IEEE Transactions on Cybernetics 52(12), 13572\u201313585 (2022)","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"10","key":"9578_CR22","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44(10), 2245\u20132269 (1965)","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"9578_CR23","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"issue":"54","key":"9578_CR24","first-page":"1","volume":"23","author":"M Lindauer","year":"2022","unstructured":"Lindauer, M., Eggensperger, K., Feurer, M., Biedenkapp, A., Deng, D., Benjamins, C., Ruhkopf, T., Sass, R., Hutter, F.: SMAC3: A versatile bayesian optimization package for hyperparameter optimization. J. Mach. Learn. Res. 23(54), 1\u20139 (2022)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"9578_CR25","doi-asserted-by":"publisher","first-page":"6995","DOI":"10.1016\/j.eswa.2008.08.026","volume":"36","author":"F Liu","year":"2009","unstructured":"Liu, F., Zeng, G.: Study of genetic algorithm with reinforcement learning to solve the TSP. Expert Syst. Appl. 36(3), 6995\u20137001 (2009)","journal-title":"Expert Syst. Appl."},{"key":"9578_CR26","unstructured":"Ma, Y., Cao, Z., Chee, Y.M.: Learning to search feasible and infeasible regions of routing problems with flexible neural k-opt. In: Advances in Neural Information Processing Systems 36 (2024)"},{"issue":"2","key":"9578_CR27","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/ijoc.1120.0506","volume":"25","author":"Y Nagata","year":"2013","unstructured":"Nagata, Y., Kobayashi, S.: A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem. INFORMS J. Comput. 25(2), 346\u2013363 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"9578_CR28","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/ijoc.1120.0506","volume":"25","author":"Y Nagata","year":"2013","unstructured":"Nagata, Y., Kobayashi, S.: A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem. INFORMS J. Comput. 25(2), 346\u2013363 (2013)","journal-title":"INFORMS J. Comput."},{"key":"9578_CR29","first-page":"9861","volume":"31","author":"M Nazari","year":"2018","unstructured":"Nazari, M., Oroojlooy, A., Snyder, L.V., Tak\u00e1c, M.: Reinforcement learning for solving the vehicle routing problem. Advances in Neural Information Processing Systems 31, 9861\u20139871 (2018)","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"4","key":"9578_CR30","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10732-023-09516-9","volume":"29","author":"A Nourmohammadzadeh","year":"2023","unstructured":"Nourmohammadzadeh, A., Sarhani, M., Vo\u00ff, S.: A matheuristic approach for the family traveling salesman problem. Journal of Heuristics 29(4), 435\u2013460 (2023)","journal-title":"Journal of Heuristics"},{"key":"9578_CR31","doi-asserted-by":"crossref","unstructured":"O\u00a0Costa, P.R., Rhuggenaath, J., Zhang, Y., Akcay, A.: Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning. In: Proceedings of the 12th Asian Conference on Machine Learning, 465\u2013480 (2020). PMLR","DOI":"10.1007\/s42979-021-00779-2"},{"key":"9578_CR32","doi-asserted-by":"crossref","unstructured":"Pan, X., Jin, Y., Ding, Y., Feng, M., Zhao, L., Song, L., Bian, J.: H-TSP: Hierarchically solving the large-scale travelling salesman problem. arXiv preprint arXiv:2304.09395 (2023)","DOI":"10.1609\/aaai.v37i8.26120"},{"key":"9578_CR33","doi-asserted-by":"crossref","unstructured":"Prates, M.O.R., Avelar, P.H.C., Lemos, H., Lamb, L.C., Vardi, M.Y.: Learning to solve NP-complete problems: A graph neural network for decision TSP. In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence, 4731\u20134738 (2019)","DOI":"10.1609\/aaai.v33i01.33014731"},{"key":"9578_CR34","doi-asserted-by":"crossref","unstructured":"Rao, M.R.: Technical note\u2013a note on the multiple traveling salesmen problem. Operations Research 28(3-part-i), 628\u2013632 (1980)","DOI":"10.1287\/opre.28.3.628"},{"issue":"3","key":"9578_CR35","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ejor.2010.09.010","volume":"211","author":"C Rego","year":"2011","unstructured":"Rego, C., Gamboa, D., Glover, F., Osterman, C.: Traveling salesman problem heuristics: Leading methods, implementations and latest advances. Eur. J. Oper. Res. 211(3), 427\u2013441 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9578_CR36","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s12351-019-00543-8","volume":"22","author":"I Sbai","year":"2022","unstructured":"Sbai, I., Krichen, S., Limam, O.: Two meta-heuristics for solving the capacitated vehicle routing problem: the case of the tunisian post office. Oper. Res. Int. Journal 22(1), 507\u2013549 (2022)","journal-title":"Oper. Res. Int. Journal"},{"key":"9578_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.111858","volume":"163","author":"A Singh","year":"2024","unstructured":"Singh, A., Majumder, S.: Solution of maximum scatter traveling salesman problem through evolutionary approaches. Appl. Soft Comput. 163, 111858 (2024)","journal-title":"Appl. Soft Comput."},{"issue":"1\u20132","key":"9578_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000068","volume":"12","author":"A Slivkins","year":"2019","unstructured":"Slivkins, A.: Introduction to multi-armed bandits. Foundations and Trends in Machine Learning 12(1\u20132), 1\u2013286 (2019)","journal-title":"Foundations and Trends in Machine Learning"},{"issue":"2","key":"9578_CR39","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"issue":"1","key":"9578_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-023-09520-z","volume":"30","author":"E Teimoury","year":"2024","unstructured":"Teimoury, E., Rashid, R.: A hybrid variable neighborhood search heuristic for the sustainable time-dependent truck-drone routing problem with rendezvous locations. Journal of Heuristics 30(1), 1\u201341 (2024)","journal-title":"Journal of Heuristics"},{"key":"9578_CR41","first-page":"2692","volume":"28","author":"O Vinyals","year":"2015","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. Advances in Neural Information Processing Systems 28, 2692\u20132700 (2015)","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"4","key":"9578_CR42","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/0377-2217(83)90161-3","volume":"12","author":"T Volgenant","year":"1983","unstructured":"Volgenant, T., Jonker, R.: The symmetric traveling salesman problem and edge exchanges in minimal 1-trees. Eur. J. Oper. Res. 12(4), 394\u2013403 (1983)","journal-title":"Eur. J. Oper. Res."},{"key":"9578_CR43","first-page":"7472","volume":"34","author":"L Xin","year":"2021","unstructured":"Xin, L., Song, W., Cao, Z., Zhang, J.: NeuroLKH: Combining deep learning model with Lin-Kernighan-Helsgaun heuristic for solving the traveling salesman problem. Advances in Neural Information Processing Systems 34, 7472\u20137483 (2021)","journal-title":"Advances in Neural Information Processing Systems"},{"key":"9578_CR44","unstructured":"Ye, H., Wang, J., Liang, H., Cao, Z., Li, Y., Li, F.: GLOP: Learning global partition and local construction for solving large-scale routing problems in real-time. arXiv preprint arXiv 2312, 08224 (2023)"},{"key":"9578_CR45","unstructured":"Zhang, W., Looks, M.: A novel local search algorithm for the traveling salesman problem that exploits backbones. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence, 343\u2013384 (2005)"},{"key":"9578_CR46","doi-asserted-by":"crossref","unstructured":"Zhang, W.: Configuration landscape analysis and backbone guided local search.: Part I: Satisfiability and maximum satisfiability. Artificial Intelligence 158(1), 1\u201326 (2004)","DOI":"10.1016\/j.artint.2004.04.001"},{"key":"9578_CR47","doi-asserted-by":"crossref","unstructured":"Zheng, J., He, K., Zhou, J., Jin, Y., Li, C.-M., Many\u00c3 , F.: Bandmaxsat: A local search maxsat solver with multi-armed bandit. In: IJCAI, 1901\u20131907 (2022)","DOI":"10.24963\/ijcai.2022\/264"},{"key":"9578_CR48","doi-asserted-by":"crossref","unstructured":"Zheng, J., He, K., Zhou, J., Jin, Y., Li, C., Many\u00e0, F.: BandMaxSAT: A local search MaxSAT solver with multi-armed bandit. In: Proceedings of the 31st International Joint Conference on Artificial Intelligence, 1901\u20131907 (2022)","DOI":"10.24963\/ijcai.2022\/264"},{"key":"9578_CR49","doi-asserted-by":"crossref","unstructured":"Zheng, J., He, K., Zhou, J., Jin, Y., Li, C.-M.: Combining reinforcement learning with Lin-Kernighan-Helsgaun algorithm for the traveling salesman problem. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence, 12445\u201312452 (2021)","DOI":"10.1609\/aaai.v35i14.17476"},{"key":"9578_CR50","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.110144","volume":"260","author":"J Zheng","year":"2023","unstructured":"Zheng, J., He, K., Zhou, J., Jin, Y., Li, C.-M.: Reinforced lin-kernighan-helsgaun algorithms for the traveling salesman problems. Knowl.-Based Syst. 260, 110144 (2023)","journal-title":"Knowl.-Based Syst."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-025-09578-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-025-09578-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-025-09578-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T14:21:50Z","timestamp":1773066110000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-025-09578-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,14]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["9578"],"URL":"https:\/\/doi.org\/10.1007\/s10732-025-09578-x","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,14]]},"assertion":[{"value":"21 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2026","order":4,"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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"The manuscript is not currently being considered for publication in another journal. All authors have been personally and actively involved in substantive work leading to the manuscript, and will hold themselves jointly and individually responsible for its content.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed Consent"}}],"article-number":"6"}}