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问题类别。我们提出了一种基于分支定界算法求解托盘装载问题的新方法，该方法考虑了运输单元的装载顺序。所推导的算法仅对运输单元可能位置中启发式有利的子集进行寻优，从而有效提升了可计算性。此外，本方法确保托盘构型满足真实世界约束，例如在运输惯性力与重力作用下运输单元位置的稳定性。