{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T02:55:40Z","timestamp":1768445740204,"version":"3.49.0"},"reference-count":39,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T00:00:00Z","timestamp":1553904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["305844\/2011-3"],"award-info":[{"award-number":["305844\/2011-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>We propose in this paper a two-phase approach that decomposes the process of solving the three-dimensional single Container Loading Problem (CLP) into subsequent tasks: (i) the generation of blocks of boxes and (ii) the loading of blocks into the container. The first phase is deterministic, and it is performed by means of constructive algorithms from the literature. The second phase is non-deterministic, and it is performed with the use of Generate-and-Solve (GS), a problem-independent hybrid optimization framework based on problem instance reduction that combines a metaheuristic with an exact solver. Computational experiments performed on benchmark instances indicate that our approach presents competitive results compared to those found by state-of-the-art algorithms, particularly for problem instances consisting of a few types of boxes. In fact, we present new best solutions for classical instances from groups BR1 and BR2.<\/jats:p>","DOI":"10.3390\/a12040067","type":"journal-article","created":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T03:21:26Z","timestamp":1554175286000},"page":"67","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A Two-Phase Approach for Single Container Loading with Weakly Heterogeneous Boxes"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1089-0129","authenticated-orcid":false,"given":"Rommel","family":"Dias Saraiva","sequence":"first","affiliation":[{"name":"Graduate Program in Applied Informatics, University of Fortaleza, Fortaleza 60811-905, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0734-4688","authenticated-orcid":false,"given":"Napole\u00e3o","family":"Nepomuceno","sequence":"additional","affiliation":[{"name":"Graduate Program in Applied Informatics, University of Fortaleza, Fortaleza 60811-905, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1718-1712","authenticated-orcid":false,"given":"Pl\u00e1cido","family":"Rog\u00e9rio Pinheiro","sequence":"additional","affiliation":[{"name":"Graduate Program in Applied Informatics, University of Fortaleza, Fortaleza 60811-905, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,3,30]]},"reference":[{"key":"ref_1","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":"Schumann","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2012.12.006","article-title":"Constraints in container loading\u2014A state-of-the-art review","volume":"229","author":"Bortfeldt","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Scheithauer, G. (1992). Algorithms for the container loading problem. Operations Research Proceedings 1991, Springer.","DOI":"10.1007\/978-3-642-46773-8_112"},{"key":"ref_4","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 J. Comput."},{"key":"ref_5","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":"Comput. Oper. Res."},{"key":"ref_6","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"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.ejor.2012.04.036","article-title":"A new iterative-doubling Greedy\u2013Lookahead algorithm for the single container loading problem","volume":"222","author":"Zhu","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"ref_8","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":"Comput. Oper. Res."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10732-008-9081-3","article-title":"Neighborhood structures for the container loading problem: A VNS implementation","volume":"16","author":"Oliveira","year":"2010","journal-title":"J. Heuristics"},{"key":"ref_10","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":"Resende","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"ref_11","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":"Int. Trans. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1111\/j.1475-3995.2004.00474.x","article-title":"A parallel hybrid local search algorithm for the container loading problem","volume":"11","author":"Mack","year":"2004","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_13","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 Intell. Syst."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/j.cor.2010.09.002","article-title":"A novel hybrid tabu search approach to container loading","volume":"38","author":"Liu","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2854","DOI":"10.1016\/j.asoc.2010.11.017","article-title":"A hybrid \u2018bee(s) algorithm\u2019 for solving container loading problems","volume":"11","author":"Dereli","year":"2011","journal-title":"Appl. Soft Comput."},{"key":"ref_16","first-page":"59","article-title":"An AND\/OR-graph approach to the container loading problem","volume":"1","author":"Morabito","year":"1994","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_17","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":"Eur. J. Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/S0377-2217(02)00132-7","article-title":"Heuristics for the container loading problem","volume":"141","author":"Pisinger","year":"2002","journal-title":"Eur. J. Oper. Res."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.cor.2010.04.015","article-title":"An efficient placement heuristic for three-dimensional rectangular packing","volume":"38","author":"He","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.ejor.2014.12.005","article-title":"Decomposition based hybrid metaheuristics","volume":"244","author":"Raidl","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Blum, C., and Raidl, G.R. (2016). Hybrid Metaheuristics: Powerful Tools for Optimization, Springer.","DOI":"10.1007\/978-3-319-30883-8"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/978-3-642-04918-7_13","article-title":"Matheuristics: Optimization, Simulation and Control","volume":"Volume 5818","author":"Blesa","year":"2009","journal-title":"Hybrid Metaheuristics"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0377-2217(90)90364-H","article-title":"Load planning for shipments of low density products","volume":"44","author":"Haessler","year":"1990","journal-title":"Eur. J. Oper. Res."},{"key":"ref_24","first-page":"154","article-title":"Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms","volume":"Voume 4446","author":"Cotta","year":"2007","journal-title":"Evolutionary Computation in Combinatorial Optimization"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-3-540-70807-0_6","article-title":"A Hybrid Optimization Framework for Cutting and Packing Problems","volume":"Volume 153","author":"Cotta","year":"2008","journal-title":"Recent Advances in Evolutionary Computation for Combinatorial Optimization"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/978-3-642-37198-1_23","article-title":"The Generate-and-Solve Framework Revisited: Generating by Simulated Annealing","volume":"Volume 7832","author":"Middendorf","year":"2013","journal-title":"Evolutionary Computation in Combinatorial Optimization"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/j.ijpe.2013.04.028","article-title":"A multi-round partial beam search approach for the single container loading problem with shipment priority","volume":"145","author":"Wang","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.33.1.49","article-title":"An exact two-dimensional non-guillotine cutting tree search procedure","volume":"33","author":"Beasley","year":"1985","journal-title":"Oper. Res."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Blum, C., and Raidl, G.R. (2016). Hybridization Based on Problem Instance Reduction. Hybrid Metaheuristics: Powerful Tools for Optimization, Springer.","DOI":"10.1007\/978-3-319-30883-8_3"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/j.cie.2011.03.013","article-title":"On the concept of density control and its application to a hybrid optimization framework: Investigation into cutting problems","volume":"61","author":"Pinheiro","year":"2011","journal-title":"Comput. Ind. Eng."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.cor.2015.10.014","article-title":"Construct, Merge, Solve & Adapt: A new general algorithm for combinatorial optimization","volume":"68","author":"Blum","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"\u00c7a\u011fatay Iris, Pacino, D., Ropke, S., and Larsen, A. (2015). Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results. Transp. Res. Part E Logist. Transp. Rev., 81, 75\u201397.","DOI":"10.1016\/j.tre.2015.06.008"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","article-title":"Genetic algorithms and random keys for sequencing and optimization","volume":"6","author":"Bean","year":"1994","journal-title":"ORSA J. Comput."},{"key":"ref_34","unstructured":"Spears, W.M., and De Jong, K.A. (1991, January 13\u201316). On the virtues of parameterized uniform crossover. Proceedings of the Fourth International Conference on Genetic Algorithms, San Diego, CA, USA."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Beasley, J.E. (1990). OR-Library: Distributing test problems by electronic mail. J. Oper. Res. Soc., 1069\u20131072.","DOI":"10.1038\/sj\/jors\/0411109"},{"key":"ref_36","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":"Comput. Oper. Res."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.cie.2014.05.024","article-title":"A tree search algorithm for the container loading problem","volume":"75","author":"Liu","year":"2014","journal-title":"Comput. Ind. Eng."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.ejor.2015.07.002","article-title":"The multiple container loading problem with preference","volume":"248","author":"Tian","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.trb.2018.03.009","article-title":"Flexible ship loading problem with transfer vehicle assignment and scheduling","volume":"111","author":"Christensen","year":"2018","journal-title":"Transp. Res. Part B Methodol."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/4\/67\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:41:40Z","timestamp":1760186500000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/4\/67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,30]]},"references-count":39,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2019,4]]}},"alternative-id":["a12040067"],"URL":"https:\/\/doi.org\/10.3390\/a12040067","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,30]]}}}