방문순서를 고려한 적재 문제에 관한 발견적 해법

Abstract

The Three-Dimensional Bin packing problem (3BP) consists of allocating, without overlapping, a given set of three dimensional rectangular items to the minimum number of three dimensional identical finite bins. This paper presents a heuristic solution for the three dimensional container loading problem on considering routing sequence. The container loading problem on considering routing sequence is formulated as a zero-one mixed integer programming model whose objective is to minimize number of vehicle. Due to its problem complexity, I propose a heuristic algorithm based on tower loading technique.