The Distributor's or Multi-Pallet Loading Problem is considered in this paper. This problem is to load a set of distinct products with given quantities on pallets (or in containers) and to minimize the number of pallets needed. The theoretical objective of finding the best space utilization is restricted by a list of practical aspects (technological constraints, weight distribution over the pallet, stability aspects, etc.). Keeping in mind a general branch and bound framework an efficient heuristic for the considered multi-pallet loading problem is developed. The three-dimensional solution approach uses in the kernel a layer-wise loading strategy with optimal two-dimensional loading patterns. Computational experiments show the efficiency of the proposed algorithms. 1 Introduction In this paper the problem of optimal loading of small rectangular-shaped boxes (pieces) on a minimal number of rectangular pallets is considered. Thereby several restrictions have to be taken into account, su...

We consider the Distributer's Pallet Packing Problem. This problem is to pack a set of distinct products with given quantities in greater volumes (pallets, containers) and to minimize the number of used volumes. The theoretical objective of finding the best space utilization is restricted by a list of practical aspects (technological constraints, weight distribution over the pallet, stability aspects, etc.). Keeping in mind a general branch and bound framework an efficient heuristic for the considered multi-pallet packing problem is developed. The three-dimensional solution approach uses in the kernel a layer-wise packing strategy with optimal two-dimensional packing patterns. Linear Programming lower bounds for the number of pallets needed to pack the total consignment are developed. Computational experiments show the efficiency of the proposed algorithms. 1 Introduction In this paper we consider the problem of optimal packing of small rectangular-shaped boxes (so-called pieces) on...