Abstract
The paper deals with the (standard orthogonal) two-dimensional pallet loading problem (PLP) of finding a maximal layout for identical small rectangles (pieces, boxes) on a larger rectangle (pallet). This problem often arises in distribution when many items of a small product must be transported. An increase in the number of items on a pallet leads directly to a decrease in transportation cost. For that reason the PLP is of considerable economic importance. Therefore a lot of work dealing with the PLP is published (cf. [1], [3]). A comprehensive state of the art of handling PLP is given in [7]. Since so far there is not known any efficient exact algorithm for the PLP most of the work is connected with heuristic approaches.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
