A bottleneck assignment approach to the multiple container loading problem

The container loading problem addresses the question of how to store several three dimensional, rectangular items (e.g. boxes) in one or more containers in such a way that maximum use is made of the container space. The multiple container problem concentrates on the situation where the consignment to be loaded cannot be accommodated in a single container. To minimize the number of required containers the repeated application of a single container approach is often suggested in the literature. In contrast, in this paper an approach based on a set partitioning formulation of the problem is presented. Within this approach a single container algorithm issued to produce alternative loading patterns. This approach easily allows introducing additional aspects, e.g. separation of boxes or complete shipment of boxes.