On the Pallet Loading Problem.

In this paper the two-dimensional pallet loading problem is considered: that is, the problem of loading a rectangular pallet of size 'L' by 'W', drawing from a set of 'n' rectangular boxes. The objective is to maximize the area covered on the pallet by the boxes loaded. The problem is approached using a combination of Dynamic Programming and heuristics. The structured solutions resulting from the application of the 'dynamic program' have two serendipitous characteristics: any item may be placed on the periphery of the pallet for easy access, and some control may be retained over the center of gravity of the pallet. Ways of using the procedure to load three-dimensional pallets are discussed. Computational results are given. (Author)