This thesis presents a heuristic solution for the three dimensional container loading problem with boxes which are different in size.
The container loading problem is formulated as a zero-one mixed integer programming model whose objective is to maximize the container utilization.
Then a heuristic based on layered loading technique is proposed. Also, this study presents a way to achieve the weighting balance of the stacked boxes obtained.
In addition, micro-computer based software is developed which generates container loading pattern provided by the proposed heuristic.
To evaluate the performance of the proposed heuristic, computational experiments are performed. The results show that the proposed heuristic is better than an existing heuristic in terms of the volume utilization.
