{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:45:03Z","timestamp":1761061503326,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,10,12]],"date-time":"2021-10-12T00:00:00Z","timestamp":1633996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,12]],"date-time":"2021-10-12T00:00:00Z","timestamp":1633996800000},"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":["51875422"],"award-info":[{"award-number":["51875422"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s10489-021-02869-3","type":"journal-article","created":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T07:26:45Z","timestamp":1634110005000},"page":"7793-7807","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A hybrid immune genetic algorithm with tabu search for minimizing the tool switch times in CNC milling batch-processing"],"prefix":"10.1007","volume":"52","author":[{"given":"Shuangyuan","family":"Shi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6615-3515","authenticated-orcid":false,"given":"Hegen","family":"Xiong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,12]]},"reference":[{"key":"2869_CR1","doi-asserted-by":"publisher","first-page":"1775","DOI":"10.1007\/s00170-016-9194-z","volume":"89","author":"A Baykaso\u011flu","year":"2017","unstructured":"Baykaso\u011flu A, Ozsoydan FB (2017) Minimizing tool switching and indexing times with tool duplications in automatic machines. Int J Adv Manuf Technol 89:1775\u20131789. https:\/\/doi.org\/10.1007\/s00170-016-9194-z","journal-title":"Int J Adv Manuf Technol"},{"key":"2869_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105797","volume":"85","author":"F Benbouzid-SiTayeb","year":"2019","unstructured":"Benbouzid-SiTayeb F, Bessedik M, Keddar MR, Kiouche AE (2019) An effective multi-objective hybrid immune algorithm for the frequency assignment problem. Appl Soft Comput 85:105797. https:\/\/doi.org\/10.1016\/j.asoc.2019.105797","journal-title":"Appl Soft Comput"},{"key":"2869_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105107","volume":"126","author":"X Chou","year":"2021","unstructured":"Chou X, Gambardella LM, Montemanni R (2021) A tabu search algorithm for the probabilistic orienteering problem. Comput Oper Res 126:105107. https:\/\/doi.org\/10.1016\/j.cor.2020.105107","journal-title":"Comput Oper Res"},{"key":"2869_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01324874","volume":"6","author":"Y Crama","year":"1994","unstructured":"Crama Y, Kolen AWJ, Oerlemans AG, Spieksma FCR (1994) Minimizing the number of tool switches on a flexible machine. Int J Flex Manuf Syst 6:33\u201354. https:\/\/doi.org\/10.1007\/BF01324874","journal-title":"Int J Flex Manuf Syst"},{"issue":"2","key":"2869_CR5","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1016\/j.asoc.2010.08.024","volume":"11","author":"D Dasgupta","year":"2011","unstructured":"Dasgupta D, Yu S, Nino F (2011) Recent advances in artificial immune systems: models and applications. Appl Soft Comput J 11(2):1574\u20131587. https:\/\/doi.org\/10.1016\/j.asoc.2010.08.024","journal-title":"Appl Soft Comput J"},{"issue":"4","key":"2869_CR6","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/s10845-015-1126-5","volume":"29","author":"J Dong","year":"2018","unstructured":"Dong J, Zhang L, Xiao T (2018) A hybrid PSO\/SA algorithm for bi-criteria stochastic line balancing with flexible task times and zoning constraints. J Intell Manuf 29(4):737\u2013751. https:\/\/doi.org\/10.1007\/s10845-015-1126-5","journal-title":"J Intell Manuf"},{"issue":"2","key":"2869_CR7","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1016\/j.cie.2012.12.001","volume":"64","author":"MM El-Sherbiny","year":"2013","unstructured":"El-Sherbiny MM, Alhamali RM (2013) A hybrid particle swarm algorithm with artificial immune learning for solving the fixed charge transportation problem. Comput Ind Eng 64(2):610\u2013620. https:\/\/doi.org\/10.1016\/j.cie.2012.12.001","journal-title":"Comput Ind Eng"},{"issue":"11","key":"2869_CR8","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.cie.2018.08.025","volume":"125","author":"M Gen","year":"2018","unstructured":"Gen M, Lin L, Yun Y, Inoue H (2018) Recent advances in hybrid priority-based genetic algorithms for logistics and SCM network design. Comput Ind Eng 125(11):394\u2013412. https:\/\/doi.org\/10.1016\/j.cie.2018.08.025","journal-title":"Comput Ind Eng"},{"key":"2869_CR9","doi-asserted-by":"publisher","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning.\u00a0https:\/\/doi.org\/10.5860\/choice.27-0936","DOI":"10.5860\/choice.27-0936"},{"issue":"4","key":"2869_CR10","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/s10845-011-0622-5","volume":"24","author":"MA Gonz\u00e1lez","year":"2013","unstructured":"Gonz\u00e1lez MA, Vela CR, Gonz\u00e1lez-Rodr\u00edguez I, Varela R (2013) Lateness minimization with tabu search for job shop scheduling problem with sequence dependent setup times. J Intell Manuf 24(4):741\u2013754. https:\/\/doi.org\/10.1007\/s10845-011-0622-5","journal-title":"J Intell Manuf"},{"key":"2869_CR11","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.procs.2019.12.180","volume":"164","author":"HB Hassen","year":"2019","unstructured":"Hassen HB, Tounsi J, Bachouch RB (2019) An artificial immune algorithm for HHC planning based on multi-agent system. Procedia Comput Sci 164:251\u2013256. https:\/\/doi.org\/10.1016\/j.procs.2019.12.180","journal-title":"Procedia Comput Sci"},{"issue":"4","key":"2869_CR12","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1007\/s10845-019-01518-4","volume":"31","author":"L He","year":"2020","unstructured":"He L, de Weerdt M, Yorke-Smith N (2020) Time\/sequence-dependent scheduling: the design and evaluation of a general purpose tabu-based adaptive large neighbourhood search algorithm. J Intell Manuf 31(4):1051\u20131078. https:\/\/doi.org\/10.1007\/s10845-019-01518-4","journal-title":"J Intell Manuf"},{"key":"2869_CR13","unstructured":"Holland J (1975) Adaption in natural and artificial systems: an introductory analysis with applications to biology, control and AI"},{"key":"2869_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114039","volume":"164","author":"S Karakatic","year":"2021","unstructured":"Karakatic S (2021) Optimizing nonlinear charging times of electric vehicle routing with genetic algorithm. Expert Syst Appl 164:114039. https:\/\/doi.org\/10.1016\/j.eswa.2020.114039","journal-title":"Expert Syst Appl"},{"key":"2869_CR15","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/s001700170001","volume":"18","author":"KW Keung","year":"2001","unstructured":"Keung KW, Ip WH, Lee TC (2001) The solution of a multi-objective tool selection model using the GA approach. Int J Adv Manuf Technol 18:771\u2013777. https:\/\/doi.org\/10.1007\/s001700170001","journal-title":"Int J Adv Manuf Technol"},{"key":"2869_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113381","volume":"151","author":"B Koohestani","year":"2020","unstructured":"Koohestani B (2020) A crossover operator for improving the efficiency of permutation-based genetic algorithms. Expert Syst Appl 151:113381. https:\/\/doi.org\/10.1016\/j.eswa.2020.113381","journal-title":"Expert Syst Appl"},{"key":"2869_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ijepes.2016.03.007","volume":"82","author":"K Lenin","year":"2016","unstructured":"Lenin K, Ravindhranath Reddy B, Suryakalavathi M (2016) Hybrid Tabu search-simulated annealing method to solve optimal reactive power problem. Int J Elec Power 82:87\u201391. https:\/\/doi.org\/10.1016\/j.ijepes.2016.03.007","journal-title":"Int J Elec Power"},{"key":"2869_CR18","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.ijpe.2018.10.010","volume":"206","author":"G Li","year":"2018","unstructured":"Li G, Li N, Sambandam N, Sethi SP, Zhang F (2018) Flow shop scheduling with jobs arriving at different times. Int J Prod Econ 206:250\u2013260. https:\/\/doi.org\/10.1016\/j.ijpe.2018.10.010","journal-title":"Int J Prod Econ"},{"key":"2869_CR19","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1016\/j.cie.2019.04.028","volume":"135","author":"X Li","year":"2019","unstructured":"Li X, Gao L, Wang W, Wang C, Wen L (2019) Particle swarm optimization hybridized with genetic algorithm for uncertain integrated process planning and scheduling with interval processing time. Comput Ind Eng 135:1036\u20131046. https:\/\/doi.org\/10.1016\/j.cie.2019.04.028","journal-title":"Comput Ind Eng"},{"key":"2869_CR20","unstructured":"Li Z (2018) Research on Tool Dynamic Configuration Optimization in Machining Center Magazine. PhD thesis, Guangdong University of Technology"},{"key":"2869_CR21","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.eswa.2019.06.007","volume":"135","author":"G Lin","year":"2019","unstructured":"Lin G, Guan J, Li Z, Feng H (2019) A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem. Expert Syst Appl 135:201\u2013211. https:\/\/doi.org\/10.1016\/j.eswa.2019.06.007","journal-title":"Expert Syst Appl"},{"key":"2869_CR22","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/s10489-016-0775-1","volume":"45","author":"HY Lin","year":"2016","unstructured":"Lin HY, Lin CJ, Huang ML (2016) Optimization of printed circuit board component placement using an efficient hybrid genetic algorithm. Appl Intell 45:622\u2013637. https:\/\/doi.org\/10.1007\/s10489-016-0775-1","journal-title":"Appl Intell"},{"issue":"s2","key":"2869_CR23","doi-asserted-by":"publisher","first-page":"3419","DOI":"10.1007\/s10586-018-2189-9","volume":"22","author":"G Lou","year":"2019","unstructured":"Lou G, Cai Z (2019) Improved hybrid immune clonal selection genetic algorithm and its application in hybrid shop scheduling. Clust Comput 22(s2):3419\u20133429. https:\/\/doi.org\/10.1007\/s10586-018-2189-9","journal-title":"Clust Comput"},{"key":"2869_CR24","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1016\/j.procs.2020.02.061","volume":"166","author":"X Luo","year":"2020","unstructured":"Luo X, Qian Q, Fu YF (2020) Improved genetic algorithm for solving flexible job shop scheduling problem. Procedia Comput Sci 166:480\u2013485. https:\/\/doi.org\/10.1016\/j.procs.2020.02.061","journal-title":"Procedia Comput Sci"},{"issue":"4","key":"2869_CR25","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1007\/s10845-011-0520-x","volume":"23","author":"S Meeran","year":"2012","unstructured":"Meeran S, Morshed MS (2012) A hybrid genetic tabu search algorithm for solving job shop scheduling problems: a case study. J Intell Manuf 23(4):1063\u20131078. https:\/\/doi.org\/10.1007\/s10845-011-0520-x","journal-title":"J Intell Manuf"},{"issue":"5\u20138","key":"2869_CR26","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1007\/s00170-012-4375-x","volume":"66","author":"B Naderi","year":"2013","unstructured":"Naderi B, Mousakhani M, Khalili M (2013) Scheduling multi-objective open shop scheduling using a hybrid immune algorithm. Int J Adv Manuf Technol 66(5\u20138):895\u2013905. https:\/\/doi.org\/10.1007\/s00170-012-4375-x","journal-title":"Int J Adv Manuf Technol"},{"key":"2869_CR27","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.resconrec.2016.12.001","volume":"128","author":"H Piroozfard","year":"2018","unstructured":"Piroozfard H, Wong KY, Wong WP (2018) Minimizing total carbon footprint and total late work criterion in flexible job shop scheduling by using an improved multi-objective genetic algorithm. Resour Conserv Recy 128:267\u2013283. https:\/\/doi.org\/10.1016\/j.resconrec.2016.12.001","journal-title":"Resour Conserv Recy"},{"key":"2869_CR28","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.cie.2018.06.002","volume":"123","author":"AV Raghavan","year":"2018","unstructured":"Raghavan AV, Yoon SW, Srihari K (2018) A modified genetic algorithm approach to minimize total weighted tardiness with stochastic rework and reprocessing times. Comput Ind Eng 123:42\u201353. https:\/\/doi.org\/10.1016\/j.cie.2018.06.002","journal-title":"Comput Ind Eng"},{"issue":"9","key":"2869_CR29","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.cor.2019.04.021","volume":"109","author":"D Schermer","year":"2019","unstructured":"Schermer D, Moeini M, Wendt O (2019) A hybrid vns\/tabu search algorithm for solving the vehicle routing problem with drones and en route operations. Comput Oper Res 109(9):134\u2013158. https:\/\/doi.org\/10.1016\/j.cor.2019.04.021","journal-title":"Comput Oper Res"},{"issue":"4","key":"2869_CR30","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1080\/00207540110098850","volume":"40","author":"CY Song","year":"2002","unstructured":"Song CY, Hwang H (2002) Optimal tooling policy for a tool switching problem of a flexible machine with automatic tool transporter. Int J Prod Res 40(4):873\u2013883. https:\/\/doi.org\/10.1080\/00207540110098850","journal-title":"Int J Prod Res"},{"key":"2869_CR31","doi-asserted-by":"publisher","first-page":"1880","DOI":"10.1007\/s10489-018-1370-4","volume":"49","author":"YY Song","year":"2019","unstructured":"Song YY, Wang FL, Chen XX (2019) An improved genetic algorithm for numerical function optimization. Appl Intell 49:1880\u20131902. https:\/\/doi.org\/10.1007\/s10489-018-1370-4","journal-title":"Appl Intell"},{"key":"2869_CR32","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1007\/s10845-020-01597-8","volume":"32","author":"B Su","year":"2021","unstructured":"Su B, Xie N, Yang Y (2021) Hybrid genetic algorithm based on bin packing strategy for the unrelated parallel workgroup scheduling problem. J Intell Manuf 32:957\u2013969. https:\/\/doi.org\/10.1007\/s10845-020-01597-8","journal-title":"J Intell Manuf"},{"key":"2869_CR33","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.cie.2016.05.006","volume":"97","author":"DW Sukker","year":"2016","unstructured":"Sukker DW, Wuttipornpun T (2016) Hybrid genetic algorithm and tabu search for finite capacity material requirement planning system in flexible flow shop with assembly operations. Comput Ind Eng 97:157\u2013169. https:\/\/doi.org\/10.1016\/j.cie.2016.05.006","journal-title":"Comput Ind Eng"},{"issue":"3","key":"2869_CR34","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.rcim.2003.09.001","volume":"20","author":"R Swarnkar","year":"2004","unstructured":"Swarnkar R, Tiwari MK (2004) Modeling machine loading problem of FMSs and its solution methodology using a hybrid tabu search and simulated annealing-based heuristic approach. Robot Cim-Int Manuf 20(3):199\u2013209. https:\/\/doi.org\/10.1016\/j.rcim.2003.09.001","journal-title":"Robot Cim-Int Manuf"},{"key":"2869_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02291-9","author":"FH Syed","year":"2021","unstructured":"Syed FH, Tahir MA, Rafi M, Shahab MD (2021) Feature selection for semi-supervised multi-target regression using genetic algorithm. Appl Intell. https:\/\/doi.org\/10.1007\/s10489-021-02291-9","journal-title":"Appl Intell"},{"issue":"5","key":"2869_CR36","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1287\/opre.36.5.767","volume":"36","author":"CS Tang","year":"1988","unstructured":"Tang CS, Denardo EV (1988) Models arising from a flexible manufacturing machine, part I: minimization of the number of tool switches. Oper Res 36(5):767\u2013777. https:\/\/doi.org\/10.1287\/opre.36.5.767","journal-title":"Oper Res"},{"key":"2869_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104931","volume":"119","author":"CR Vela","year":"2020","unstructured":"Vela CR, Afsar S, Palacios JJ, Gonz\u00e1lez-Rodr\u00edguez I, Puente J (2020) Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling. Comput Oper Res 119:104931. https:\/\/doi.org\/10.1016\/j.cor.2020.104931","journal-title":"Comput Oper Res"},{"key":"2869_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106522","volume":"95","author":"W Wei","year":"2020","unstructured":"Wei W, Chen S, Lin Q, Ji J, Chen J (2020) A multi-objective immune algorithm for intrusion feature selection. Appl Soft Comput Journal 95:106522. https:\/\/doi.org\/10.1016\/j.asoc.2020.106522","journal-title":"Appl Soft Comput Journal"},{"key":"2869_CR39","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.rcim.2003.08.003","volume":"20","author":"XW Xu","year":"2004","unstructured":"Xu XW, He Q (2004) Striving for a total integration of CAD, CAPP, CAM and CNC. Robot Cim-Int Manuf 20:101\u2013109. https:\/\/doi.org\/10.1016\/j.rcim.2003.08.003","journal-title":"Robot Cim-Int Manuf"},{"key":"2869_CR40","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.neucom.2018.06.094","volume":"344","author":"Z Yang","year":"2019","unstructured":"Yang Z, Ding Y, Hao K, Cai X (2019) An adaptive immune algorithm for service-oriented agricultural Internet of Things. Neurocomputing 344:3\u201312. https:\/\/doi.org\/10.1016\/j.neucom.2018.06.094","journal-title":"Neurocomputing"},{"issue":"11","key":"2869_CR41","doi-asserted-by":"publisher","first-page":"156","DOI":"10.3901\/JME.2010.11.156","volume":"46","author":"C Zhang","year":"2010","unstructured":"Zhang C, Dong X, Wang X, Li X, Liu Q (2010) Improved NSGA-II for the multi-objective flexible job-shop scheduling problem. Chin J Mech Eng 46(11):156\u2013164. https:\/\/doi.org\/10.3901\/JME.2010.11.156","journal-title":"Chin J Mech Eng"},{"issue":"7","key":"2869_CR42","doi-asserted-by":"publisher","first-page":"145","DOI":"10.3901\/JME.2009.07.145","volume":"45","author":"G Zhang","year":"2009","unstructured":"Zhang G, Gao L, Li P, Zhang C (2009) Improved genetic algorithm for the flexible job-shop scheduling problem. Chin J Mech Eng 45(7):145\u2013151. https:\/\/doi.org\/10.3901\/JME.2009.07.145","journal-title":"Chin J Mech Eng"},{"issue":"s2","key":"2869_CR43","doi-asserted-by":"publisher","first-page":"3621","DOI":"10.1007\/s10586-018-2212-1","volume":"22","author":"X Zhao","year":"2019","unstructured":"Zhao X, Xia X, Wang L, Cao J (2019) A fuzzy multi-objective immune genetic algorithm for the strategic location planning problem. Clust Comput 22(s2):3621\u20133641. https:\/\/doi.org\/10.1007\/s10586-018-2212-1","journal-title":"Clust Comput"},{"key":"2869_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.06.056","author":"I \u017dulj","year":"2017","unstructured":"\u017dulj I, Kramer S, Schneider M (2017) A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem. Eur J Oper Res. https:\/\/doi.org\/10.1016\/j.ejor.2017.06.056","journal-title":"Eur J Oper Res"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02869-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02869-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02869-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T09:31:49Z","timestamp":1651743109000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02869-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,12]]},"references-count":44,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["2869"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02869-3","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2021,10,12]]},"assertion":[{"value":"21 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to publication"}}]}}