Container Packing Problem with Guillotine Cutting and Complete-Shipment Constraints

Abstract

This paper presents a tree search algorithm for the three-dimensional container packing problem (3D-CPP). There are many practical requirements for the 3D-CPP, and this paper considers the orientation, guillotine cutting, and complete-shipment constraints. A wall-building approach and the tabu search algorithm are used to maximize the volume utilization of the container. The famous Bischoff and Ratcliff test data from 1995 are used for testing the algorithm. This algorithm can quickly find an appropriate container packing plan with high volume utilization. Furthermore, it can offer a packing pattern that satisfies the complete-shipment constraint. It is easy and intuitive for staff to understand and can be quickly implemented.