基于混合搜索算法的包装箱尺寸与托盘装载协同优化研究

杨益华; 向巧玲; 徐梦晨; 贺跃悦; 杨江龙

doi:10.19554/j.cnki.1001-3563.2026.13.029

PDF(1184 KB)

包装工程（技术栏目） ›› 2026, Vol. 47 ›› Issue (13) : 269-279. DOI: 10.19554/j.cnki.1001-3563.2026.13.029

绿色包装与循环经济

基于混合搜索算法的包装箱尺寸与托盘装载协同优化研究

杨益华^a, 向巧玲^b, 徐梦晨^a, 贺跃悦^a, 杨江龙^a*

作者信息 +

Collaborative Optimization of Packaging Box Dimensions and Pallet Loading Based on the Hybrid Search Algorithm

YANG Yihua^a, XIANG Qiaoling^b, XU Mengchen^a, HE Yueyue^a, YANG Jianglong^a*

Author information +

文章历史 +

摘要

目的针对包装箱与托盘匹配度低导致的装载效率问题,本文提出面向开放尺寸同构物品的托盘装载优化方法,在既定托盘规格下最大化托盘面积利用率,为包装箱尺寸设计与装载方案优化提供决策依据。方法将三维托盘码垛问题转化为二维装箱问题,构建以托盘面积利用率最大化为目标的混合整数规划模型,并设计包含扩展装载点、广度优先树搜索、网格搜索及稳定支撑的四阶段混合搜索算法进行求解。为验证本文模型及算法的有效性,分别在固定尺寸与尺寸浮动2种场景下进行了算例实验。结果在固定包装箱尺寸场景下,2种托盘上的平均面积利用率分别为84.03%和87.28%;在±5%尺寸浮动的优化场景下,2种产品型号的面积利用率最高分别达到94.85%和88.41%,且所有方案均满足压缝稳定性约束。结论本文方法能够有效提升托盘面积利用率,实现包装箱尺寸与托盘装载方案的协同优化,可为包装箱尺寸设计提供决策依据。

Abstract

To solve the problem of low loading efficiency caused by the poor matching between packaging boxes and pallets, the work aims to propose a pallet loading optimization method for isomorphic items with open dimensions, which maximizes the pallet area utilization under given pallet specifications and provides a decision-making basis for packaging box dimension design and loading scheme optimization. The 3D pallet stacking problem was transformed into a 2D packing problem. A mixed-integer programming model aiming at maximizing pallet area utilization was constructed, and a four-stage hybrid search algorithm including extended loading points, breadth-first tree search, grid search and stable support was designed for solving the model. To verify the effectiveness of the proposed model and the algorithm, numerical experiments were conducted under two scenarios of fixed dimension and variable dimension respectively. In the fixed packaging box dimension scenario, the average area utilization rates on the two types of pallets were 84.03% and 87.28%, respectively. In the optimization scenario with a ±5% dimension variation, the maximum area utilization rates of the two product models reached 94.85% and 88.41%, respectively, and all schemes satisfied the staggered stacking stability constraint. The proposed method can effectively improve pallet area utilization, realize the collaborative optimization of packaging box dimension and pallet loading scheme, and provide a decision-making basis for packaging box dimension design.

导出引用

杨益华, 向巧玲, 徐梦晨, 贺跃悦, 杨江龙. 基于混合搜索算法的包装箱尺寸与托盘装载协同优化研究[J]. 包装工程. 2026, 47(13): 269-279 https://doi.org/10.19554/j.cnki.1001-3563.2026.13.029

YANG Yihua, XIANG Qiaoling, XU Mengchen, HE Yueyue, YANG Jianglong. Collaborative Optimization of Packaging Box Dimensions and Pallet Loading Based on the Hybrid Search Algorithm[J]. Packaging Engineering. 2026, 47(13): 269-279 https://doi.org/10.19554/j.cnki.1001-3563.2026.13.029

中图分类号： TB485.3

参考文献

[1] YI J M, LI M M, LU Y P.On the Multiple Optimal Solutions and Patterns of the Pallet Loading Problem[J]. Computers & Operations Research, 2025, 183: 107182.
[2] SEBBE N P V, SILVA F J G, BARREIRAS A M S, et al. Pallet Loading Problem: A Case Study in the Automotive Industry Applying a Simplified Mathematical Model[J]. Mathematics, 2024, 12(7): 984.
[3] PASAD S A, KRISHNAKUMAR P.Higher order block heuristics for 2D pallet loading problems with multiple box inputs[J]. Materials Today: Proceedings, 2021, 46: 4625-4633.
[4] ALMASARWAH N, ABDELALL E, SUER G, et al.Pallet Loading Optimization Considering Storage Time and Relative Humidity[J]. Journal of Industrial Engineering and Management, 2023, 16(2): 453.
[5] GZARA F, ELHEDHLI S, YILDIZ B C.The Pallet Loading Problem: Three-Dimensional Bin Packing with Practical Constraints[J]. European Journal of Operational Research, 2020, 287(3): 1062-1074.
[6] ŠVACO M, ŠULIGOJ F, ŠEKORANJA B, et al. Solving Pallet Loading Problem with Real-World Constraints[PP/OL]. V2. arXiv (2023-08-03)[J]. https://doi.org/10.48550/arXiv.2307.11531.
[7] ALONSO M T, MARTINEZ-SYKORA A, ALVAREZ-VALDES R, et al.The Pallet-Loading Vehicle Routing Problem with Stability Constraints[J]. European Journal of Operational Research, 2022, 302(3): 860-873.
[8] CALZAVARA G, IORI M, LOCATELLI M, et al.Mathematical Models and Heuristic Algorithms for Pallet Building Problems with Practical Constraints[J]. Annals of Operations Research, 2025, 350(1): 5-36.
[9] YAO S W, ZHANG T, ZHANG H, et al.The Semi-Online Robotic Pallet Loading Problem[J]. Computers & Operations Research, 2025, 174: 106889
[10] ZHU W B, FU Y, ZHOU Y.3D Dynamic Heterogeneous Robotic Palletization Problem[J]. European Journal of Operational Research, 2024, 316(2): 584-596.
[11] TIAN T, ZHU W B, ZHU Y, et al.A Two-Phase Constructive Algorithm for the Single Container Mix-Loading Problem[J]. Annals of Operations Research, 2024, 332(1): 253-275.
[12] BARROS H, PEREIRA T, RAMOS A G, et al.Complexity Constraint in the Distributor’s Pallet Loading Problem[J]. Mathematics, 2021, 9(15): 1742.
[13] LAYEB S B, OMRI O.Solving the Pallet Loading Problem with Deep Reinforcement Learning[M]//Handbook of Formal Optimization. Singapore: Springer, 2024: 807-825.
[14] HAJLAOUI Y, JAOUA A, LAYEB S B.Deep Reinforcement Learning for Solving the Single Container Loading Problem[J]. Engineering Optimization, 2023, 55(4): 668-684.
[15] ALI S, RAMOS A G, CARRAVILLA M A, et al.On-Line Three-Dimensional Packing Problems: A Review of Off-Line and On-Line Solution Approaches[J]. Computers & Industrial Engineering, 2022, 168: 108122.
[16] DAIOS A, KLADOVASILAKIS N, KOSTAVELIS I.Mixed Palletizing for Smart Warehouse Environments: Sustainability Review of Existing Methods[J]. Sustainability, 2024, 16(3): 1278.
[17] WEI L J, OON W C, ZHU W B, et al.A Skyline Heuristic for the 2D Rectangular Packing and Strip Packing Problems[J]. European Journal of Operational Research, 2011, 215(2): 337-346.
[18] MARTINS G H A, DELL R F. Solving the Pallet Loading Problem[J]. European Journal of Operational Research, 2008, 184(2): 429-440.
[19] ALVAREZ-VALDES R, PARREÑO F, TAMARIT J M. A Tabu Search Algorithm for the Pallet Loading Problem[J]. OR Spectrum, 2005, 27(1): 43-61.