The purpose of this thesis is to develop a heuristic algorithm evaluating the layout to maximize number of boxes when a single-box-type is packed into a container. Actually because three-dimensional problems are involved in NP-complete, much study has been focused on heuristic algorithms. The basic concept of this study is as follows. The problem is solved as palletizing problems with each side of the container respectively. By using the height of boxes, the problem is extended to a three-dimensional problem. Consequently, through this thesis, we can get good solution and the result is displayed by three-dimensional computer graphic.

• 김영민 | Kim, Young-Min
• 이준희 | Lee, Jun-Hee