• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2003.05a
• /
• pp.242-248
• /
• 2003

In this paper, we propose a new heuristic solution for 3D container packing problem for the variable size and the variable kind of freights. First we consider the total cost of container charges, i.e., loading, transportation and handling charges, where the priority of each frights are dealt. By minimizing the total cost of container charges, the kinds of container and its number can be decided automatically. From these factors, we con determine the position in the container and the loading sequence into the container. Finally, by equivalence of freight's weight in container, we can prevent the freight's damage on the handling.

• Journal of Navigation and Port Research
• /
• v.28 no.6
• /
• pp.531-539
• /
• 2004

In this paper, we propose a new heuristic solution for 3D container packing problem for the variable sizes and types of freight. Frist of all, we consider the total cost of container charge i.e., handling, loading and transportation, where each freight will be specifically identified The types of containers and its number to be loaded am be selected automatically by minimizing the total cost of container charge. Maximization of loading space am be achieved efficiently by operating the palletizing and/or depalletizing of freight. By considering these factors we can determine the position of freight in the container and the loading sequence to be packing into the container. In container packing simulation, we can verify that the proposed heuristic algorithm indicates more efficiency space utilization and shows the possibility of using on commercial business.