[Home]     [Equivalence Classes]     [Minimum Size Instance]     [Algorithms]     [Solving PLP]

Under Construction


{small pallet}

The Pallet Loading Page

This page is dedicated to the discussion of the Pallet Loading Problem. This is one of the "Open Problems" in the literature.


The PLP is encountered when trying to maximize the number of identical boxes with dimensions a x b , loaded in a pallet with dimensions X x Y where each box has a "this side up" restriction.

Even without the "this side up" restriction, operational considerations may dictate the use of vertical layers with the same height. Considerations regarding stability and safety of the boxes imply the use of orthogonal packing. PLP is also present in some cutting stock and floor design settings.

Although it seems a easy problem to solve, the work required to generate the best possible packing with the exact algorithms available today is daunting.

Fortunatly, good solutions can be obtained using heuristics. The picture below represents solutions obtained with four heuristics for instance (56, 52, 12, 5):


{pallet loading solution}

Questions?