Research of a Heuristic Algorithm for 3D Container Loading Based on Combination

Container loading belongs to a sort of resource optimal problems with various constraints. The concept behind the problem can be extended to many applying areas, such as cargo loading of airplane and shipment, as well as computer memory allocation. A new combination-based heuristic algorithm is proposed, which combines the items by backtracking procedure. The efficient loading strategy is devised. The representation of remaining space for the description of loading procedure and the principle of integrated small remaining spaces are defined. The computational experiment indicated that the algorithm can enhance the space utilization of the container. Compared with the algorithm published, the algorithm suits the practical applications that there are the variety types and the difference size of the items.