![Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5933/TOC-Subject-Sample-2021-Engineering-Tech.jpg"})
Abstract
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. Computational results are given.
