This paper presents a new heuristic for the container loading problem. This problem arrives when one wants to load a subset of rectangular boxes into a rectangular container such that the volume of the packed boxes is maximized. The basic idea consists to form a lot of blocs composed of identical boxes. A series of blocs are stacked to form piles which are loaded side by side in a section of the container. The container is filled with these sections. Four optimization procedures are utilized along the heuristic: to form the blocs, the piles, the sections and finally to fill the container. The performance of the method is shown by numerical tests over already published data.
Paru en octobre 2005 , 24 pages