{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T04:56:25Z","timestamp":1777870585540,"version":"3.51.4"},"reference-count":44,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001807","name":"State of Sao Paulo Research Foundation","doi-asserted-by":"publisher","award":["2022\/05803-3"],"award-info":[{"award-number":["2022\/05803-3"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"National Council for Scientific and Technological Development","doi-asserted-by":"publisher","award":["407005\/2024-2"],"award-info":[{"award-number":["407005\/2024-2"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"National Council for Scientific and Technological Development","doi-asserted-by":"publisher","award":["313146\/2022-5"],"award-info":[{"award-number":["313146\/2022-5"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"National Council for Scientific and Technological Development","doi-asserted-by":"publisher","award":["444679\/2024-3"],"award-info":[{"award-number":["444679\/2024-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"National Council for Scientific and Technological Development","doi-asserted-by":"publisher","award":["404315\/2023-2"],"award-info":[{"award-number":["404315\/2023-2"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"National Council for Scientific and Technological Development","doi-asserted-by":"publisher","award":["408722\/2023-1"],"award-info":[{"award-number":["408722\/2023-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"National Council for Scientific and Technological Development","doi-asserted-by":"publisher","award":["315555\/2023-8"],"award-info":[{"award-number":["315555\/2023-8"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005285","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Goi\u00e1s","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005285","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordination for the improvement of Higher Education Personnel","doi-asserted-by":"publisher","award":["001"],"award-info":[{"award-number":["001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.ejor.2026.01.039","type":"journal-article","created":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T06:27:54Z","timestamp":1769927274000},"page":"337-348","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["A tree search-based heuristic for the three-dimensional single container loading problem"],"prefix":"10.1016","volume":"333","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-6272-4061","authenticated-orcid":false,"given":"Lucas","family":"Guesser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2674-3366","authenticated-orcid":false,"given":"Thiago","family":"Alves De Queiroz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1067-6421","authenticated-orcid":false,"given":"Fl\u00e1vio","family":"Keidi Miyazawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2026.01.039_sbref0001","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108122","article-title":"On-line three-dimensional packing problems: A review of off-line and on-line solution approaches","volume":"168","author":"Ali","year":"2022","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0002","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cor.2017.01.002","article-title":"VCS: A new heuristic function for selecting boxes in the single container loading problem","volume":"82","author":"Araya","year":"2017","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.01.039_bib0003","unstructured":"Araya, I., Moyano, M., Arielo, Lobo, B., Emiliano, & Guesser, L. (2017b). Metasolver. Available at https:\/\/github.com\/rilianx\/Metasolver. The commit used for modifications is |449cc101aa85599660da89fbb90f0db596c4ca93|."},{"key":"10.1016\/j.ejor.2026.01.039_sbref0004","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.cor.2013.09.003","article-title":"A beam search approach to the container loading problem","volume":"43","author":"Araya","year":"2014","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.01.039_sbref0005","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1002\/j.2158-1592.2008.tb00086.x","article-title":"A logistics strategy taxonomy","volume":"29","author":"Autry","year":"2008","journal-title":"Journal of Business logistics"},{"issue":"4","key":"10.1016\/j.ejor.2026.01.039_sbref0006","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0305-0483(95)00015-G","article-title":"Issues in the development of approaches to container loading","volume":"23","author":"Bischoff","year":"1995","journal-title":"Omega"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.039_sbref0007","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/j.ejor.2022.10.033","article-title":"Modeling soft unloading constraints in the multi-drop container loading problem","volume":"308","author":"Bonet Filella","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"10.1016\/j.ejor.2026.01.039_sbref0008","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/S0167-8191(03)00047-4","article-title":"A parallel tabu search algorithm for solving the container loading problem","volume":"29","author":"Bortfeldt","year":"2003","journal-title":"Parallel Computing"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0009","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2012.12.006","article-title":"Constraints in container loading - a state-of-the-art review","volume":"229","author":"Bortfeldt","year":"2013","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0010","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1002\/j.2158-1592.2003.tb00044.x","article-title":"Estimation of global logistics expenditures using neural networks","volume":"24","author":"Bowersox","year":"2003","journal-title":"Journal of Business Logistics"},{"key":"10.1016\/j.ejor.2026.01.039_bib0011","unstructured":"Bullet-Physics (2024). Bullet3. Available at https:\/\/github.com\/bulletphysics\/bullet3."},{"key":"10.1016\/j.ejor.2026.01.039_bib0012","series-title":"Introduction to algorithms","author":"Cormen","year":"2022"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0013","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1111\/itor.12145","article-title":"Weight distribution in container loading: A case study","volume":"23","author":"Costa","year":"2016","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.039_sbref0014","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1287\/ijoc.1070.0250","article-title":"Extreme point-based heuristics for three-dimensional bin packing","volume":"20","author":"Crainic","year":"2008","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.039_sbref0015","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/S0377-2217(98)00139-8","article-title":"Weight distribution considerations in container loading","volume":"114","author":"Davies","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0016","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1177\/1745691611406920","article-title":"Bayesian versus orthodox statistics: Which side are you on?","volume":"6","author":"Dienes","year":"2011","journal-title":"Perspectives on Psychological Science"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0017","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(02)00133-9","article-title":"Solving container loading problems by block arrangement","volume":"141","author":"Eley","year":"2002","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0018","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1287\/ijoc.1090.0338","article-title":"A tree search algorithm for solving the container loading problem","volume":"22","author":"Fanslau","year":"2010","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2026.01.039_bib0019","series-title":"Computers and intractability","volume":"vol. 174","author":"Garey","year":"1979"},{"issue":"5-6","key":"10.1016\/j.ejor.2026.01.039_sbref0020","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1111\/j.1475-3995.1997.tb00095.x","article-title":"A genetic algorithm for solving the container loading problem","volume":"4","author":"Gehring","year":"1997","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.039_sbref0021","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0305-0548(80)90001-5","article-title":"A heuristic for packing boxes into a container","volume":"7","author":"George","year":"1980","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0022","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.cor.2011.03.009","article-title":"A parallel multi-population biased random-key genetic algorithm for a container loading problem","volume":"39","author":"Gon\u00e7alves","year":"2012","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0023","first-page":"658","article-title":"Bayesian data analysis","volume":"1 5","author":"Kruschke","year":"2010","journal-title":"Wiley Interdisciplinary Reviews: Cognitive Science"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0024","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1037\/a0029146","article-title":"Bayesian estimation supersedes the t test","volume":"142 2","author":"Kruschke","year":"2013","journal-title":"Journal of Experimental Psychology: General"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0025","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ejor.2019.12.012","article-title":"The exact solutions of several types of container loading problems","volume":"284","author":"Kurpel","year":"2020","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0026","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","article-title":"The irace package: Iterated racing for automatic algorithm configuration","volume":"3","author":"L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","journal-title":"Operations Research Perspectives"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0027","first-page":"59","article-title":"An AND\/OR-graph approach to the container loading problem","volume":"1","author":"Morabito","year":"1994","journal-title":"International Transactions in Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2026.01.039_bib0028","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MIS.2005.57","article-title":"A GRASP approach to the container-loading problem","volume":"20","author":"Moura","year":"2005","journal-title":"IEEE Intelligent Systems"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0029","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105186","article-title":"Practical constraints in the container loading problem: Comprehensive formulations and exact algorithm","volume":"128","author":"Nascimento","year":"2021","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.039_sbref0030","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1080\/00207549408956919","article-title":"Applying spatial representation techniques to the container packing problem","volume":"32","author":"Ngoi","year":"1994","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0031","series-title":"Paradigms of artificial intelligence programming: Case studies in Common LISP","author":"Norvig","year":"2014"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0032","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1287\/ijoc.1070.0254","article-title":"A maximal-space algorithm for the container loading problem","volume":"20","author":"Parre\u00f1o","year":"2008","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0033","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/j.trb.2016.06.003","article-title":"A container loading algorithm with static mechanical equilibrium stability constraints","volume":"91","author":"Ramos","year":"2016","journal-title":"Transportation Research Part B-methodological"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0034","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cor.2019.04.020","article-title":"Exact methods for three-dimensional cutting and packing: A comparative study concerning single container problems","volume":"109","author":"Silva","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0035","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105058","article-title":"A matheuristic framework for the three-dimensional single large object placement problem with practical constraints","volume":"124","author":"Silva","year":"2020","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0036","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1057\/jors.1992.101","article-title":"Cutting and packing problems: A categorized, application-orientated research bibliography","volume":"43","author":"Sweeney","year":"1992","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0037","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1016\/j.ejor.2016.07.033","article-title":"A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem","volume":"257","author":"Toffolo","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0038","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","article-title":"An improved typology of cutting and packing problems","volume":"183","author":"W\u00e4scher","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0039","first-page":"196","article-title":"Individual comparisons by ranking methods","volume":"1","author":"Wilcoxon","year":"1945","journal-title":"Biometrics"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.039_bib0040","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","article-title":"No free lunch theorems for optimization","volume":"1","author":"Wolpert","year":"1997","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0041","doi-asserted-by":"crossref","first-page":"2267","DOI":"10.1016\/j.cor.2011.10.019","article-title":"A heuristic block-loading algorithm based on multi-layer search for the container loading problem","volume":"39","author":"Zhang","year":"2012","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0042","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1111\/itor.12094","article-title":"A comparative review of 3D container loading algorithms","volume":"23","author":"Zhao","year":"2016","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0043","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.ejor.2012.04.036","article-title":"A new iterative-doubling greedy-lookahead algorithm for the single container loading problem","volume":"222","author":"Zhu","year":"2012","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.01.039_sbref0044","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s10489-012-0337-0","article-title":"The six elements to block-building approaches for the single container loading problem","volume":"37","author":"Zhu","year":"2012","journal-title":"Applied Intelligence"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726000809?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726000809?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T16:24:00Z","timestamp":1777566240000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221726000809"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["S0377221726000809"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2026.01.039","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A tree search-based heuristic for the three-dimensional single container loading problem","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2026.01.039","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}