{"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":1775112068516,"version":"3.50.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2022J02053"],"award-info":[{"award-number":["2022J02053"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>To improve cargo loading efficiency and achieve diverse needs of companies for the loading process, this paper innovatively establishes a multiple objective mixed integer programming model for the three-dimensional multiple bin-size bin packing problem (3D-MBSBPP). The model is designed to maximize container space utilization rate and cargo load balance, minimize container usage costs, and incorporates some practical constraints. On this basis, we propose a novel dynamic feedback algorithm based on spatial corner fitness (SCF_DFA) to solve this model, which consists of three stages. Specifically, Stage 1 employs a heuristic algorithm based on spatial corner fitness to optimize the search of the remaining spaces. Stage 2 employs a container type selection algorithm to dynamically adjust and optimize container types. Stage 3 uses an improved genetic algorithm to improve the quality of the solutions of the first two stages. We demonstrate the effectiveness of the proposed algorithm through comparative experiments on benchmark instances, and apply it to solve the real-life instances for the 3D-MBSBPP. The results show that the proposed algorithm can make the average container space utilization rate reach 85.38%, which is 1.48% higher than that of baseline method, while the loading results obtained are more balanced, indicating the advantages of the SCF_DFA in solving 3D-MBSBPP. Furthermore, we conduct ablation experiments to confirm the effectiveness of each component within the algorithm.<\/jats:p>","DOI":"10.1007\/s40747-024-01368-5","type":"journal-article","created":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T10:02:23Z","timestamp":1709287343000},"page":"4055-4081","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Dynamic feedback algorithm based on spatial corner fitness for solving the three-dimensional multiple bin-size bin packing problem"],"prefix":"10.1007","volume":"10","author":[{"given":"Yi","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4285-5822","authenticated-orcid":false,"given":"Xiaoyun","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,1]]},"reference":[{"issue":"01","key":"1368_CR1","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.ejor.2022.10.033","volume":"308","author":"GB Filellaa","year":"2022","unstructured":"Filellaa GB, Trivella A, Corman F (2022) Modeling soft unloading constraints in the multi-drop container loading problem. Eur J Oper Res 308(01):336\u2013352. https:\/\/doi.org\/10.1016\/j.ejor.2022.10.033","journal-title":"Eur J Oper Res"},{"key":"1368_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.omega.2021.102559","volume":"107","author":"M Gajda","year":"2022","unstructured":"Gajda M, Trivella A, Mansini R, Pisinger D (2022) An optimization approach for a complex real-life container loading problem. Omega 107:1\u201316. https:\/\/doi.org\/10.1016\/j.omega.2021.102559","journal-title":"Omega"},{"key":"1368_CR3","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.trb.2018.08.001","volume":"116","author":"E Silva","year":"2018","unstructured":"Silva E, Ramos AG, Oliveira JF (2018) Load balance recovery for multi-drop distribution problems: a mixed integer linear programming approach. Transp Res Part B 116:62\u201375. https:\/\/doi.org\/10.1016\/j.trb.2018.08.001","journal-title":"Transp Res Part B"},{"issue":"01","key":"1368_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ejor.2014.08.015","volume":"241","author":"LJ Wei","year":"2015","unstructured":"Wei LJ, Zhu WB, Lim A (2015) A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem. Eur J Oper Res 241(01):39\u201349. https:\/\/doi.org\/10.1016\/j.ejor.2014.08.015","journal-title":"Eur J Oper Res"},{"key":"1368_CR5","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.endm.2018.07.042","volume":"69","author":"JC Mart\u00ednez","year":"2018","unstructured":"Mart\u00ednez JC, Cuellar D, \u00c1lvarez-Mart\u00ednez D (2018) Review of dynamic stability metrics and a mechanical model integrated with open source tools for the container loading problem. Electron Notes Discrete Math 69:325\u2013332. https:\/\/doi.org\/10.1016\/j.endm.2018.07.042","journal-title":"Electron Notes Discrete Math"},{"key":"1368_CR6","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2023.3235742","author":"S Yang","year":"2023","unstructured":"Yang S, Song S, Chu SL, Song R, Cheng JY, Li YB, Zhang W (2023) Heuristics integrated deep reinforcement learning for online 3D bin packing. IEEE Trans Autom Sci Eng. https:\/\/doi.org\/10.1109\/TASE.2023.3235742","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"1368_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2022.119153","volume":"214","author":"QQ Que","year":"2023","unstructured":"Que QQ, Yang F, Zhang DF (2023) Solving 3D packing problem using transformer network and reinforcement learning. Expert Syst Appl 214:1\u201310. https:\/\/doi.org\/10.1016\/j.eswa.2022.119153","journal-title":"Expert Syst Appl"},{"key":"1368_CR8","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1016\/j.cie.2018.11.012","volume":"127","author":"MT Alonso","year":"2019","unstructured":"Alonso MT, Alvarez-Valdes R, Iori M, Parreno F (2019) Mathematical models for multi container loading problems with practical constraints. Comput Ind Eng 127:722\u2013733. https:\/\/doi.org\/10.1016\/j.cie.2018.11.012","journal-title":"Comput Ind Eng"},{"issue":"01","key":"1368_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1590\/0101-7438.2015.035.01.0001","volume":"35","author":"DA Mart\u00ednez","year":"2015","unstructured":"Mart\u00ednez DA, Alvarez-Valdes R, Parre\u00f1o F (2015) A GRASP algorithm for the container l-oading problem withmulti-drop constraints. Pesquisa Operacional 35(01):1\u201324. https:\/\/doi.org\/10.1590\/0101-7438.2015.035.01.0001","journal-title":"Pesquisa Operacional"},{"issue":"03","key":"1368_CR10","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1016\/j.ejor.2015.02.027","volume":"244","author":"V Lurkin","year":"2015","unstructured":"Lurkin V, Schyns M (2015) The airline container loading problem with pickup and deli-very. Eur J Oper Res 244(03):955\u2013965. https:\/\/doi.org\/10.1016\/j.ejor.2015.02.027","journal-title":"Eur J Oper Res"},{"issue":"02","key":"1368_CR11","doi-asserted-by":"publisher","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. Eur J Oper Res 141(02):393\u2013409. https:\/\/doi.org\/10.1016\/S0377-2217(02)00133-9","journal-title":"Eur J Oper Res"},{"key":"1368_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cor.2017.01.002","volume":"82","author":"I Araya","year":"2017","unstructured":"Araya I, Guerrero K, Nunez E (2017) VCS: a new heuristic function for selecting boxes i-n the single container loading problem. Comput Oper Res 82:27\u201335. https:\/\/doi.org\/10.1016\/j.cor.2017.01.002","journal-title":"Comput Oper Res"},{"issue":"07","key":"1368_CR13","doi-asserted-by":"publisher","first-page":"1192","DOI":"10.1080\/0305215X.2020.1779250","volume":"53","author":"LD Oliveira","year":"2021","unstructured":"Oliveira LD, de Lima VL, de Queiroz TA, Miyazawa FK (2021) The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids. Eng Optim 53(07):1192\u20131211. https:\/\/doi.org\/10.1080\/0305215X.2020.1779250","journal-title":"Eng Optim"},{"issue":"03","key":"1368_CR14","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/j.ejor.2011.04.017","volume":"214","author":"CH Che","year":"2011","unstructured":"Che CH, Huang WL, Lim A, Zhu WB (2011) The multiple container loading cost minimi-zation problem. Eur J Oper Res 214(03):501\u2013511. https:\/\/doi.org\/10.1016\/j.ejor.2011.04.017","journal-title":"Eur J Oper Res"},{"issue":"02","key":"1368_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1111\/1475-3995.00400","volume":"10","author":"JL De Castro Silva","year":"2003","unstructured":"De Castro Silva JL, Soam NY, Maculan N (2003) A greedy search for the three-dimensional bin packing problem: the packing static stability case. Int Trans Oper Res 10(02):141\u2013153. https:\/\/doi.org\/10.1111\/1475-3995.00400","journal-title":"Int Trans Oper Res"},{"issue":"01","key":"1368_CR16","first-page":"85","volume":"5","author":"L Kacprzak","year":"2015","unstructured":"Kacprzak L, Rudy J, Zelazny D (2015) Multi-criteria 3-dimision bin packing problem. Int Trans Oper Res 5(01):85\u201394","journal-title":"Int Trans Oper Res"},{"issue":"01","key":"1368_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ejor.2019.12.012","volume":"284","author":"DV Kurpel","year":"2020","unstructured":"Kurpel DV, Scarpin CT, Junior JEP, Schenekemberg CM, Coelho LC (2020) The exact solutions of several types of container loading problems. Eur J Oper Res 284(01):87\u2013107. https:\/\/doi.org\/10.1016\/j.ejor.2019.12.012","journal-title":"Eur J Oper Res"},{"issue":"08","key":"1368_CR18","doi-asserted-by":"publisher","first-page":"6425","DOI":"10.1016\/j.jksuci.2021.07.007","volume":"34","author":"Y Harrath","year":"2022","unstructured":"Harrath Y (2022) A three-stage layer-based heuristic to solve the 3D bin-packing problem under balancing constraint. J King Saud Univ Comput Inf Sci 34(08):6425\u20136431. https:\/\/doi.org\/10.1016\/j.jksuci.2021.07.007","journal-title":"J King Saud Univ Comput Inf Sci"},{"key":"1368_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2021.107518","volume":"159","author":"S Erbayrak","year":"2021","unstructured":"Erbayrak S, \u00d6zkir V, Yildirim UM (2021) Multi-objective 3D bin packing problem with load balance and product family concerns. Comput Ind Eng 159:1\u201311. https:\/\/doi.org\/10.1016\/j.cie.2021.107518","journal-title":"Comput Ind Eng"},{"key":"1368_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2022.108302","volume":"170","author":"DZ Zhang","year":"2022","unstructured":"Zhang DZ, Gu CH, Fang H, Ji CT, Zhang XG (2022) Multi-strategy hybrid heuristic algorithm for single container weakly heterogeneous loading problem. Comput Ind Eng 170:1\u201314. https:\/\/doi.org\/10.1016\/j.cie.2022.108302","journal-title":"Comput Ind Eng"},{"key":"1368_CR21","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.cor.2017.01.012","volume":"82","author":"JF Correcher","year":"2017","unstructured":"Correcher JF, Alonso MT, Parreno F, Alvarez-Valdes R (2017) Solving a large multicontainer loading problem in the car manufacturing industry. Comput Oper Res 82:139\u2013152. https:\/\/doi.org\/10.1016\/j.cor.2017.01.012","journal-title":"Comput Oper Res"},{"key":"1368_CR22","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1016\/j.ins.2022.05.063","volume":"606","author":"Y Huang","year":"2022","unstructured":"Huang Y, Lai L, Li W, Wang H (2022) A differential evolution algorithm with ternary search tree for solving the three-dimensional packing problem. Inf Sci 606:440\u2013452. https:\/\/doi.org\/10.1016\/j.ins.2022.05.063","journal-title":"Inf Sci"},{"issue":"02","key":"1368_CR23","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.ijpe.2013.04.019","volume":"145","author":"JF Goncalves","year":"2013","unstructured":"Goncalves JF, Resende MGC (2013) A biased random key genetic algorithm for 2D and 3-D bin packing problems. Int J Prod Econ 145(02):500\u2013510. https:\/\/doi.org\/10.1016\/j.ijpe.2013.04.019","journal-title":"Int J Prod Econ"},{"key":"1368_CR24","doi-asserted-by":"publisher","unstructured":"Wang Y, Li HL, Lei ZB, Ma DP, Fang Y (2019) Progressively-refined tree search for container loading problem. In: 2019 IEEE 21st International Conference on High Performance Computing and Communications :2520\u20132528. https:\/\/doi.org\/10.1109\/HPCC\/SmartCity\/DSS.2019.00353","DOI":"10.1109\/HPCC\/SmartCity\/DSS.2019.00353"},{"key":"1368_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.asoc.2021.107462","volume":"108","author":"T Bayraktar","year":"2021","unstructured":"Bayraktar T, Ersoz F, Kubat C (2021) Effects of memory and genetic operators on Artificial Bee Colony algorithm for Single Container Loading problem. Appl Soft Comput 108:1\u201317. https:\/\/doi.org\/10.1016\/j.asoc.2021.107462","journal-title":"Appl Soft Comput"},{"key":"1368_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2023.109239","volume":"180","author":"MZ Chen","year":"2023","unstructured":"Chen MZ, Huo JZ, Duan YR (2023) A hybrid biogeography-based optimization algorithm for three-dimensional bin size designing and packing problem. Comput Ind Eng 180:1\u201313. https:\/\/doi.org\/10.1016\/j.cie.2023.109239","journal-title":"Comput Ind Eng"},{"issue":"03","key":"1368_CR27","doi-asserted-by":"publisher","first-page":"1599","DOI":"10.1109\/TASE.2022.3177422","volume":"19","author":"G Tresca","year":"2022","unstructured":"Tresca G, Cavone G, Carli R, Cerviotti A, Dotoli M (2022) Automating bin packing: a layer building matheuristics for cost effective logistics. IEEE Trans Autom Sci Eng 19(03):1599\u20131613. https:\/\/doi.org\/10.1109\/TASE.2022.3177422","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"01","key":"1368_CR28","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s11750-020-00577-8","volume":"29","author":"I Gimenez-Palacios","year":"2021","unstructured":"Gimenez-Palacios I, Alonso MT, Alvarez-Valdes R, Parreno F (2021) Logistic constraints in container loading problems: the impact of complete shipment conditions. TOP 29(01):177\u2013203. https:\/\/doi.org\/10.1007\/s11750-020-00577-8","journal-title":"TOP"},{"key":"1368_CR29","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2019.0013","author":"S Elhedhli","year":"2019","unstructured":"Elhedhli S, Gzara F, Yildiz B (2019) Three-dimensional bin packing and mixed-case palletization. INFORMS J Optimiz. https:\/\/doi.org\/10.1287\/ijoo.2019.0013","journal-title":"INFORMS J Optimiz"},{"issue":"01","key":"1368_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.12.006","volume":"229","author":"A Bortfeldt","year":"2013","unstructured":"Bortfeldt A, Wascher G (2013) Constraints in container loading\u2014a state-of-the-art review. Eur J Oper Res 229(01):1\u201320. https:\/\/doi.org\/10.1016\/j.ejor.2012.12.006","journal-title":"Eur J Oper Res"},{"issue":"02","key":"1368_CR31","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/j.ejor.2017.02.002","volume":"261","author":"M Colombi","year":"2017","unstructured":"Colombi M, Corberan A, Mansini R, Plana I, Sanchis JM (2017) The directed profitable rural postman problem with incompatibility constraints. Eur J Oper Res 261(02):549\u2013562. https:\/\/doi.org\/10.1016\/j.ejor.2017.02.002","journal-title":"Eur J Oper Res"},{"issue":"04","key":"1368_CR32","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1007\/s00291-013-0356-1","volume":"36","author":"I Moon","year":"2014","unstructured":"Moon I, Nguyen TVL (2014) Container packing problem with balance constraints. OR Spectrum 36(04):837\u2013878. https:\/\/doi.org\/10.1007\/s00291-013-0356-1","journal-title":"OR Spectrum"},{"issue":"19","key":"1368_CR33","doi-asserted-by":"publisher","first-page":"9802","DOI":"10.1016\/j.amc.2012.03.052","volume":"218","author":"MM Baldi","year":"2012","unstructured":"Baldi MM, Perboli G, Tadei R (2012) The three-dimensional knapsack problem with balancing constraints. Appl Math Comput 218(19):9802\u20139818. https:\/\/doi.org\/10.1016\/j.amc.2012.03.052","journal-title":"Appl Math Comput"},{"issue":"11","key":"1368_CR34","doi-asserted-by":"publisher","first-page":"1999","DOI":"10.1016\/j.cor.2010.01.017","volume":"37","author":"RR Amossen","year":"2010","unstructured":"Amossen RR, Pisinger D (2010) Multi-dimensional bin packing problems with guillotine constraints. Comput Oper Res 37(11):1999\u20132006. https:\/\/doi.org\/10.1016\/j.cor.2010.01.017","journal-title":"Comput Oper Res"},{"key":"1368_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.omega.2020.102311","volume":"102","author":"S Polyakovskiy","year":"2021","unstructured":"Polyakovskiy S, M\u2019Hallah R (2021) Just-in-time two-dimensional bin packing. Omega (Westport) 102:1\u201341. https:\/\/doi.org\/10.1016\/j.omega.2020.102311","journal-title":"Omega (Westport)"},{"issue":"1\u20132","key":"1368_CR36","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1111\/itor.12094","volume":"23","author":"XZ Zhao","year":"2016","unstructured":"Zhao XZ, Bennell JA, Bektas T, Dowsland K (2016) A comparative review of 3D contain-er loading algorithms. Int Trans Oper Res 23(1\u20132):287\u2013320. https:\/\/doi.org\/10.1111\/itor.12094","journal-title":"Int Trans Oper Res"},{"issue":"03","key":"1368_CR37","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0305-0548(80)90001-5","volume":"7","author":"JA George","year":"1980","unstructured":"George JA, Robinson DF (1980) A heuristic for packing boxes into a container. Comput Oper Res 7(03):147\u2013156. https:\/\/doi.org\/10.1016\/0305-0548(80)90001-5","journal-title":"Comput Oper Res"},{"issue":"02","key":"1368_CR38","doi-asserted-by":"publisher","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. Eur J Oper Res 141(02):382\u2013392. https:\/\/doi.org\/10.1016\/s0377-2217(02)00132-7","journal-title":"Eur J Oper Res"},{"key":"1368_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2020.105058","volume":"124","author":"EF da Silva","year":"2020","unstructured":"da Silva EF, Leao AAS, Toledo FMB, Wauters T (2020) A matheuristic framework for the Three-dimensional single large object placement problem with practical constraints. Comput Oper Res 124:1\u201333. https:\/\/doi.org\/10.1016\/j.cor.2020.105058","journal-title":"Comput Oper Res"},{"issue":"1\u20132","key":"1368_CR40","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0360-8352(98)00085-0","volume":"35","author":"KK Lai","year":"1998","unstructured":"Lai KK, Xue J (1998) Container packing in a multi-customer delivering operation. Comput Ind Eng 35(1\u20132):323\u2013326. https:\/\/doi.org\/10.1016\/S0360-8352(98)00085-0","journal-title":"Comput Ind Eng"},{"issue":"03","key":"1368_CR41","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1287\/ijoc.1070.0254","volume":"20","author":"F Parreno","year":"2008","unstructured":"Parreno F, Alvarez-Valdes R, Tamarit JM, Oliveira JF (2008) A maximal-space algorithm for the container loading problem. INFORMS J Comput 20(03):412\u2013422. https:\/\/doi.org\/10.1287\/ijoc.1070.0254","journal-title":"INFORMS J Comput"},{"issue":"02","key":"1368_CR42","doi-asserted-by":"publisher","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. Oper Res 48(02):256\u2013267. https:\/\/doi.org\/10.1287\/opre.48.2.256.12386","journal-title":"Oper Res"},{"issue":"03","key":"1368_CR43","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1287\/ijoc.1070.0250","volume":"20","author":"TG Crainic","year":"2008","unstructured":"Crainic TG, Perboli G, Tadei R (2008) Extreme point-based heuristics for three-dimensional bin packing. INFORMS J Comput 20(03):368\u2013384. https:\/\/doi.org\/10.1287\/ijoc.1070.0250","journal-title":"INFORMS J Comput"},{"key":"1368_CR44","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.cor.2016.04.020","volume":"74","author":"A Trivella","year":"2016","unstructured":"Trivella A, Pisinger D (2016) The load-balanced multi-dimensional bin-packing problem. Comput Oper Res 74:152\u2013164. https:\/\/doi.org\/10.1016\/j.cor.2016.04.020","journal-title":"Comput Oper Res"},{"issue":"03","key":"1368_CR45","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1016\/j.ejor.2007.06.063","volume":"195","author":"TG Crainic","year":"2007","unstructured":"Crainic TG, Perboli G, Tadei R (2007) TS2 PACK: a two-level tabu search for the three-dimensional bin packing problem. Eur J Oper Res 195(03):744\u2013760. https:\/\/doi.org\/10.1016\/j.ejor.2007.06.063","journal-title":"Eur J Oper Res"},{"issue":"03","key":"1368_CR46","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1016\/j.ejor.2007.05.058","volume":"195","author":"EE Zachariadis","year":"2009","unstructured":"Zachariadis EE, Tarantilis CD, Kiranoudis CT (2009) A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. Eur J Oper Res 195(03):729\u2013743. https:\/\/doi.org\/10.1016\/j.ejor.2007.05.058","journal-title":"Eur J Oper Res"},{"issue":"03","key":"1368_CR47","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/j.cor.2007.10.021","volume":"36","author":"G Fuellerer","year":"2009","unstructured":"Fuellerer G, Doerner KF, Hardl RF, Iori M (2009) Ant colony optimization for the two-dimensional loading vehicle routing problem. Comput Oper Res 36(03):655\u2013673. https:\/\/doi.org\/10.1016\/j.cor.2007.10.021","journal-title":"Comput Oper Res"},{"issue":"03","key":"1368_CR48","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1016\/j.ejor.2009.03.046","volume":"201","author":"G Fuellerer","year":"2010","unstructured":"Fuellerer G, Doerner KF, Hartl RF, Iori M (2010) Metaheuristics for vehicle routing problems with three-dimensional loading constraints. Eur J Oper Res 201(03):751\u2013759. https:\/\/doi.org\/10.1016\/j.ejor.2009.03.046","journal-title":"Eur J Oper Res"},{"issue":"01","key":"1368_CR49","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s11750-010-0144-x","volume":"18","author":"M Iori","year":"2010","unstructured":"Iori M, Martello S (2010) Routing problems with loading constraints. TOP 18(01):4\u201327. https:\/\/doi.org\/10.1007\/s11750-010-0144-x","journal-title":"TOP"},{"issue":"03","key":"1368_CR50","doi-asserted-by":"publisher","first-page":"569","DOI":"10.2307\/25147100","volume":"55","author":"SP Fekete","year":"2007","unstructured":"Fekete SP, Schepers J, Van Der Veen JC (2007) An exact algorithm for higher-dimensional orthogonal packing. Oper Res 55(03):569\u2013587. https:\/\/doi.org\/10.2307\/25147100","journal-title":"Oper Res"},{"issue":"03","key":"1368_CR51","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1016\/j.ejor.2017.10.050","volume":"266","author":"AG Ramos","year":"2018","unstructured":"Ramos AG, Silva E, Oliveira JF (2018) A new load balance methodology for container loading problem in road transportation. Eur J Oper Res 266(03):1140\u20131152. https:\/\/doi.org\/10.1016\/j.ejor.2017.10.050","journal-title":"Eur J Oper Res"},{"issue":"04","key":"1368_CR52","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/MIS.2005.57","volume":"20","author":"A Moura","year":"2005","unstructured":"Moura A, Oliveira JF (2005) A GRASP approach to the container-loading problem. IEEE Intell Syst 20(04):50\u201357. https:\/\/doi.org\/10.1109\/MIS.2005.57","journal-title":"IEEE Intell Syst"},{"key":"1368_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2021.115909","volume":"189","author":"Y Li","year":"2022","unstructured":"Li Y, Chen MZ, Huo JZ (2022) A hybrid adaptive large neighborhood search algorithm for the large-scale heterogeneous container loading problem. Expert Syst Appl 189:1\u201312. https:\/\/doi.org\/10.1016\/j.eswa.2021.115909","journal-title":"Expert Syst Appl"},{"issue":"C","key":"1368_CR54","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.cie.2015.10.007","volume":"90","author":"XP Li","year":"2015","unstructured":"Li XP, Zhang KK (2015) A hybrid differential evolution algorithm for multiple container loading problem with heterogeneous containers. Comput Ind Eng 90(C):305\u2013313. https:\/\/doi.org\/10.1016\/j.cie.2015.10.007","journal-title":"Comput Ind Eng"},{"key":"1368_CR55","doi-asserted-by":"publisher","unstructured":"Piyachayawat T, Mungwattana A (2017) A hybrid algorithm application for the multi-size pallet loading problem case study: lamp and lighting factory. In: 2017 4th International Conference on Industrial Engineering and Applications :100\u2013105. https:\/\/doi.org\/10.1109\/iea.2017.7939187","DOI":"10.1109\/iea.2017.7939187"},{"key":"1368_CR56","unstructured":"Han QW (2015) Optimization and visualization of multiple 3D container loading problem with non-identical items. Dalian University of Technology"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01368-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01368-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01368-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T18:21:52Z","timestamp":1715883712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01368-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,1]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["1368"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01368-5","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,1]]},"assertion":[{"value":"25 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2024","order":3,"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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}