{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T06:41:08Z","timestamp":1775112068716,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Science Fund for Distinguished Young Scholars of Guangdong Province","award":["2022B1515020076"],"award-info":[{"award-number":["2022B1515020076"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10479-023-05542-9","type":"journal-article","created":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T03:31:22Z","timestamp":1693539082000},"page":"253-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A two-phase constructive algorithm for the single container mix-loading problem"],"prefix":"10.1007","volume":"332","author":[{"given":"Tian","family":"Tian","sequence":"first","affiliation":[]},{"given":"Wenbin","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5685-4940","authenticated-orcid":false,"given":"Lijun","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,1]]},"reference":[{"key":"5542_CR1","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cor.2017.01.002","volume":"82","author":"I Araya","year":"2017","unstructured":"Araya, I., Guerrero, K., & Nu\u00f1ez, E. (2017). Vcs: A new heuristic function for selecting boxes in the single container loading problem. Computers & Operations Research, 82, 27\u201335.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"5542_CR2","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/j.ejor.2020.03.040","volume":"286","author":"I Araya","year":"2020","unstructured":"Araya, I., Moyano, M., & Sanchez, C. (2020). A beam search algorithm for the biobjective container loading problem. European Journal of Operational Research, 286(2), 417\u2013431.","journal-title":"European Journal of Operational Research"},{"key":"5542_CR3","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.cor.2013.09.003","volume":"43","author":"I Araya","year":"2014","unstructured":"Araya, I., & Riff, M. C. (2014). A beam search approach to the container loading problem. Computers & Operations Research, 43, 100\u2013107.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"5542_CR4","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1016\/0377-2217(95)00031-K","volume":"84","author":"EE Bischoff","year":"1995","unstructured":"Bischoff, E. E., Janetz, F., & Ratcliff, M. (1995). Loading pallets with non-identical items. European journal of operational research, 84(3), 681\u2013692.","journal-title":"European journal of operational research"},{"issue":"2","key":"5542_CR5","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0377-2217(90)90362-F","volume":"44","author":"EE Bischoff","year":"1990","unstructured":"Bischoff, E. E., & Marriott, M. D. (1990). A comparative evaluation of heuristics for container loading. European Journal of Operational Research, 44(2), 267\u2013276.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"5542_CR6","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0305-0483(95)00015-G","volume":"23","author":"EE Bischoff","year":"1995","unstructured":"Bischoff, E. E., & Ratcliff, M. (1995). Issues in the development of approaches to container loading. Omega, 23(4), 377\u2013390.","journal-title":"Omega"},{"issue":"4","key":"5542_CR7","first-page":"237","volume":"20","author":"A Bortfeldt","year":"1998","unstructured":"Bortfeldt, A., & Gehring, H. (1998). Ein Tabu Search-Verfahren f\u00fcr Containerbeladeprobleme mit schwach heterogenem Kistenvorrat. OR Spectrum, 20(4), 237\u2013250.","journal-title":"OR Spectrum"},{"issue":"1","key":"5542_CR8","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0377-2217(00)00055-2","volume":"131","author":"A Bortfeldt","year":"2001","unstructured":"Bortfeldt, A., & Gehring, H. (2001). A hybrid genetic algorithm for the container loading problem. European Journal of Operational Research, 131(1), 143\u2013161.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"5542_CR9","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/S0167-8191(03)00047-4","volume":"29","author":"A Bortfeldt","year":"2003","unstructured":"Bortfeldt, A., Gehring, H., & Mack, D. (2003). A parallel tabu search algorithm for solving the container loading problem. Parallel Computing, 29(5), 641\u2013662.","journal-title":"Parallel Computing"},{"issue":"3","key":"5542_CR10","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/S0377-2217(98)00139-8","volume":"114","author":"AP Davies","year":"1999","unstructured":"Davies, A. P., & Bischoff, E. E. (1999). Weight distribution considerations in container loading. European Journal of Operational Research, 114(3), 509\u2013527.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"5542_CR11","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1287\/opre.1050.0210","volume":"53","author":"E Den Boef","year":"2005","unstructured":"Den Boef, E., Korst, J., Martello, S., et al. (2005). Erratum to \u201cthe three-dimensional bin packing problem\u2019\u2019: Robot-packable and orthogonal variants of packing problems. Operations Research, 53(4), 735\u2013736.","journal-title":"Operations Research"},{"issue":"2","key":"5542_CR12","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(02)00133-9","volume":"141","author":"M Eley","year":"2002","unstructured":"Eley, M. (2002). Solving container loading problems by block arrangement. European Journal of Operational Research, 141(2), 393\u2013409.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5542_CR13","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1287\/ijoc.1090.0338","volume":"22","author":"T Fanslau","year":"2010","unstructured":"Fanslau, T., & Bortfeldt, A. (2010). A tree search algorithm for solving the container loading problem. INFORMS Journal on Computing, 22(2), 222\u2013235.","journal-title":"INFORMS Journal on Computing"},{"key":"5542_CR14","unstructured":"Fekete, S. P., & Schepers, J. (1997). On more-dimensional packing I: Modeling. Technical report, Mathematisches Institut, Universit\u00e4t zu Kiel."},{"key":"5542_CR15","unstructured":"Fekete, S. P., & Schepers, J. (1997). On more-dimensional packing II: Bounds. Technical report, Mathematisches Institut, Universit\u00e4t zu Kiel."},{"issue":"2","key":"5542_CR16","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/moor.1030.0079","volume":"29","author":"SP Fekete","year":"2004","unstructured":"Fekete, S. P., & Schepers, J. (2004). A combinatorial characterization of higher-dimensional orthogonal packing. Mathematics of Operations Research, 29(2), 353\u2013368.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"5542_CR17","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s001860400376","volume":"60","author":"SP Fekete","year":"2004","unstructured":"Fekete, S. P., & Schepers, J. (2004). A general framework for bounds for higher-dimensional orthogonal packing problems. Mathematical Methods of Operations Research, 60(2), 311\u2013329.","journal-title":"Mathematical Methods of Operations Research"},{"issue":"3","key":"5542_CR18","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/opre.1060.0369","volume":"55","author":"SP Fekete","year":"2007","unstructured":"Fekete, S. P., Schepers, J., & Van der Veen, J. C. (2007). An exact algorithm for higher-dimensional orthogonal packing. Operations Research, 55(3), 569\u2013587.","journal-title":"Operations Research"},{"issue":"5\u20136","key":"5542_CR19","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1111\/j.1475-3995.1997.tb00095.x","volume":"4","author":"H Gehring","year":"1997","unstructured":"Gehring, H., & Bortfeldt, A. (1997). A genetic algorithm for solving the container loading problem. International transactions in operational research, 4(5\u20136), 401\u2013418.","journal-title":"International transactions in operational research"},{"issue":"4","key":"5542_CR20","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1111\/1475-3995.00369","volume":"9","author":"H Gehring","year":"2002","unstructured":"Gehring, H., & Bortfeldt, A. (2002). A parallel genetic algorithm for solving the container loading problem. International Transactions in Operational Research, 9(4), 497\u2013511.","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"5542_CR21","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0305-0548(80)90001-5","volume":"7","author":"JA George","year":"1980","unstructured":"George, J. A., & Robinson, D. F. (1980). A heuristic for packing boxes into a container. Computers & Operations Research, 7(3), 147\u2013156.","journal-title":"Computers & Operations Research"},{"issue":"6","key":"5542_CR22","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1287\/opre.14.6.1045","volume":"14","author":"P Gilmore","year":"1966","unstructured":"Gilmore, P., & Gomory, R. E. (1966). The theory and computation of knapsack functions. Operations Research, 14(6), 1045\u20131074.","journal-title":"Operations Research"},{"issue":"1","key":"5542_CR23","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.cor.2010.04.015","volume":"38","author":"K He","year":"2011","unstructured":"He, K., & Huang, W. (2011). An efficient placement heuristic for three-dimensional rectangular packing. Computers & Operations Research, 38(1), 227\u2013233.","journal-title":"Computers & Operations Research"},{"issue":"5","key":"5542_CR24","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/S0305-0548(03)00019-4","volume":"31","author":"M Hifi","year":"2004","unstructured":"Hifi, M. (2004). Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study. Computers & Operations Research, 31(5), 657\u2013674.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"5542_CR25","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/0377-2217(95)00343-6","volume":"91","author":"M Hifi","year":"1996","unstructured":"Hifi, M., & Zissimopoulos, V. (1996). A recursive exact algorithm for weighted two-dimensional cutting. European Journal of Operational Research, 91(3), 553\u2013564.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5542_CR26","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ejor.2008.02.024","volume":"196","author":"W Huang","year":"2009","unstructured":"Huang, W., & He, K. (2009). A caving degree approach for the single container loading problem. European Journal of Operational Research, 196(1), 93\u2013101.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5542_CR27","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ejor.2019.12.012","volume":"284","author":"DV Kurpel","year":"2020","unstructured":"Kurpel, D. V., Scarpin, C. T., Junior, J. E. P., et al. (2020). The exact solutions of several types of container loading problems. European Journal of Operational Research, 284(1), 87\u2013107.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5542_CR28","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/j.ijpe.2013.03.001","volume":"144","author":"A Lim","year":"2013","unstructured":"Lim, A., Ma, H., Qiu, C., et al. (2013). The single container loading problem with axle weight constraints. International Journal of Production Economics, 144(1), 358\u2013369.","journal-title":"International Journal of Production Economics"},{"issue":"6","key":"5542_CR29","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/j.omega.2003.08.004","volume":"31","author":"A Lim","year":"2003","unstructured":"Lim, A., Rodrigues, B., & Wang, Y. (2003). A multi-faced buildup algorithm for three-dimensional packing problems. Omega, 31(6), 471\u2013481.","journal-title":"Omega"},{"issue":"5","key":"5542_CR30","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1111\/j.1475-3995.2004.00474.x","volume":"11","author":"D Mack","year":"2004","unstructured":"Mack, D., Bortfeldt, A., & Gehring, H. (2004). A parallel hybrid local search algorithm for the container loading problem. International Transactions in Operational Research, 11(5), 511\u2013533.","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"5542_CR31","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1287\/opre.48.2.256.12386","volume":"48","author":"S Martello","year":"2000","unstructured":"Martello, S., Pisinger, D., & Vigo, D. (2000). The three-dimensional bin packing problem. Operations Research, 48(2), 256\u2013267.","journal-title":"Operations Research"},{"key":"5542_CR32","volume-title":"Knapsack problems: Algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., & Toth, P. (1990). Knapsack problems: Algorithms and computer implementations. Wiley."},{"issue":"1","key":"5542_CR33","first-page":"59","volume":"1","author":"R Morabito","year":"1994","unstructured":"Morabito, R., & Arenales, M. (1994). An and\/or-graph approach to the container loading problem. International Transactions in Operational Research, 1(1), 59\u201373.","journal-title":"International Transactions in Operational Research"},{"issue":"4","key":"5542_CR34","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MIS.2005.57","volume":"20","author":"A Moura","year":"2005","unstructured":"Moura, A., & Oliveira, J. F. (2005). A grasp approach to the container-loading problem. IEEE Intelligent Systems, 20(4), 50\u201357.","journal-title":"IEEE Intelligent Systems"},{"issue":"1","key":"5542_CR35","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1080\/00207549408956919","volume":"32","author":"B Ngoi","year":"1994","unstructured":"Ngoi, B., Tay, M., & Chua, E. (1994). Applying spatial representation techniques to the container packing problem. The International Journal of Production Research, 32(1), 111\u2013123.","journal-title":"The International Journal of Production Research"},{"issue":"2","key":"5542_CR36","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01748770","volume":"8","author":"BKA Ngoi","year":"1993","unstructured":"Ngoi, B. K. A., & Whybrew, K. (1993). A fast spatial representation method (applied to fixture design). The International Journal of Advanced Manufacturing Technology, 8(2), 71\u201377.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"3","key":"5542_CR37","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1287\/ijoc.1070.0254","volume":"20","author":"F Parre\u00f1o","year":"2008","unstructured":"Parre\u00f1o, F., Alvarez-Vald\u00e9s, R., Tamarit, J. M., et al. (2008). A maximal-space algorithm for the container loading problem. INFORMS Journal on Computing, 20(3), 412\u2013422.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"5542_CR38","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/S0377-2217(02)00132-7","volume":"141","author":"D Pisinger","year":"2002","unstructured":"Pisinger, D. (2002). Heuristics for the container loading problem. European Journal of Operational Research, 141(2), 382\u2013392.","journal-title":"European Journal of Operational Research"},{"key":"5542_CR39","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/j.trb.2016.06.003","volume":"91","author":"AG Ramos","year":"2016","unstructured":"Ramos, A. G., Oliveira, J. F., Gon\u00e7alves, J. F., et al. (2016). A container loading algorithm with static mechanical equilibrium stability constraints. Transportation Research Part B: Methodological, 91, 565\u2013581.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"3","key":"5542_CR40","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1016\/j.ejor.2016.01.025","volume":"252","author":"L Sheng","year":"2016","unstructured":"Sheng, L., Hongxia, Z., Xisong, D., et al. (2016). A heuristic algorithm for container loading of pallets with infill boxes. European Journal of Operational Research, 252(3), 728\u2013736.","journal-title":"European Journal of Operational Research"},{"key":"5542_CR41","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cor.2019.04.020","volume":"109","author":"EF Silva","year":"2019","unstructured":"Silva, E. F., Toffolo, T. A. M., & Wauters, T. (2019). Exact methods for three-dimensional cutting and packing: A comparative study concerning single container problems. Computers & Operations Research, 109, 12\u201327.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"5542_CR42","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/S0377-2217(99)00263-5","volume":"123","author":"J Terno","year":"2000","unstructured":"Terno, J., Scheithauer, G., Sommerwei\u00df, U., et al. (2000). An efficient approach for the multi-pallet loading problem. European Journal of Operational Research, 123(2), 372\u2013381.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5542_CR43","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/j.ijpe.2013.04.028","volume":"145","author":"N Wang","year":"2013","unstructured":"Wang, N., Lim, A., & Zhu, W. (2013). A multi-round partial beam search approach for the single container loading problem with shipment priority. International Journal of Production Economics, 145(2), 531\u2013540.","journal-title":"International Journal of Production Economics"},{"issue":"3","key":"5542_CR44","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher, G., Hau\u00dfner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183(3), 1109\u20131130.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5542_CR45","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ejor.2014.08.015","volume":"241","author":"L Wei","year":"2015","unstructured":"Wei, L., Zhu, W., & Lim, A. (2015). A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem. European Journal of Operational Research, 241(1), 39\u201349.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"5542_CR46","doi-asserted-by":"crossref","first-page":"2267","DOI":"10.1016\/j.cor.2011.10.019","volume":"39","author":"D Zhang","year":"2012","unstructured":"Zhang, D., Peng, Y., & Leung, S. C. (2012). A heuristic block-loading algorithm based on multi-layer search for the container loading problem. Computers & Operations Research, 39(10), 2267\u20132276.","journal-title":"Computers & Operations Research"},{"issue":"1\u20132","key":"5542_CR47","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1111\/itor.12094","volume":"23","author":"X Zhao","year":"2016","unstructured":"Zhao, X., Bennell, J. A., Bekta\u015f, T., et al. (2016). A comparative review of 3d container loading algorithms. International Transactions in Operational Research, 23(1\u20132), 287\u2013320.","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"5542_CR48","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.ejor.2012.04.036","volume":"222","author":"W Zhu","year":"2012","unstructured":"Zhu, W., & Lim, A. (2012). A new iterative-doubling greedy-lookahead algorithm for the single container loading problem. European Journal of Operational Research, 222(3), 408\u2013417.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"5542_CR49","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s10489-012-0337-0","volume":"37","author":"W Zhu","year":"2012","unstructured":"Zhu, W., Oon, W. C., Lim, A., et al. (2012). The six elements to block-building approaches for the single container loading problem. Applied Intelligence, 37(3), 431\u2013445.","journal-title":"Applied Intelligence"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05542-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-023-05542-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05542-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T17:20:45Z","timestamp":1709054445000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-023-05542-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,1]]},"references-count":49,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["5542"],"URL":"https:\/\/doi.org\/10.1007\/s10479-023-05542-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,1]]},"assertion":[{"value":"11 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This article contains no studies with human participants or animals performed by any authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The authors disclose no financial or conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}