Abstract:

This paper focuses on the container loading problem:how to pack as more identical rectangular boxes as possible into a rectangular container.Layer patterns are used,i.e.three layers are used according to the length,width,and height of the box.A dynamic programming procedure is used to determine the optimal layouts of the boxes on the layers,and a knapsack problem is solved to obtain the optimal combination of the layers in the container.The algorithm has low complexity and the loading pattern is simple.

Key words: container loading;container transport;dynamic programming