Abstract
Loading pooled shipment in containers is a complex procedure that has relied largely on the workers’ experience. It often takes days to allocate the pooled goods into a number of containers and then load the allocated goods into the containers. Sometimes the workers have to unload some containers and then reload them in different patterns so as to squeeze some more goods in the containers. Because of the aging experienced workers and the raising labor cost, local transportation companies have been losing their competitive advantages. The container-packing problem has important industrial and commercial application. Only a few approaches, however, have been developed to deal with the container packing problem. In this paper we aimed to design computer-based procedures for determining container packing patterns and to develop a single container-packing system to increase the loading efficiency and container utility. We reviewed the existing studies on container loading, cutting and packing problems, and knapsack problems. We developed new methods on the basis of three-dimensional cutting techniques so as to minimize the waste of container space. We used numerical examples to illustrate the proposed methods. On the basis of our methods, we develop a container-packing system that includes the computational algorithms and input/output interfaces. We also developed a simulation program for illustrating the container packing process in steps with real data from local freight transportation company. This paper concludes with a discussion of future research. Keywords: Container Packing, Decision Support System, Cutting & Packing Problems, Knapsack Problems, Heuristics, Combination Problem