Efficient cargo packing and transport unit stacking play a vital role in enhancing logistics efficiency and reducing costs in the field of logistics. This article focuses on the challenging problem of loading transport units onto pallets, which belongs to the class of NP-hard problems. We propose a novel method for solving the pallet loading problem using a branch and bound algorithm, where there is a loading order of transport units. The derived algorithm considers only a heuristically favourable subset of possible positions of the transport units, which has a positive effect on computability. Furthermore, it is ensured that the pallet configuration meets real-world constraints, such as the stability of the position of transport units under the influence of transport inertial forces and gravity.

翻译：高效的货物装箱和运输单元堆叠在提升物流效率、降低物流成本方面至关重要。本文聚焦于将运输单元装载至托盘这一具有挑战性的问题，该问题属于NP-hard问题范畴。我们提出了一种新颖的基于分支定界算法求解托盘装载问题的方法，其中运输单元存在加载顺序。所推导的算法仅考虑运输单元可能位置中一个启发式优选的子集，这对可计算性产生了积极影响。此外，该方法确保了托盘配置满足现实世界的约束条件，例如在运输惯性力和重力影响下运输单元位置的稳定性。