A new heuristic algorithm for the heterogeneous single container loading problem is proposed in this paper. This algorithm fills empty spaces with the homogeneous load-blocks of identically oriented boxes and splits residual space into three sub spaces starting with an empty container. An initial loading pattern is built by applying this approach recursively until all boxes are exhausted or no empty spaces are left. In order to generate alternative loading patterns, the load-blocks of pattern determining spaces are replaced with the alternatives that were generated on determining the load-blocks. An improvement algorithm compares these alternatives with the initial pattern to find improved one. Numerical experiments with 715 test cases show the good performance of this new algorithm, above all for problems with strongly heterogeneous boxes.

1. 서론
 2. 제안하는 해법
  2.1 초기 적재패턴 생성
  2.2 적재패턴의 개선
 3. 수치 실험
  3.1 Bischoff과 Ratcliff 데이터의 실험 결과
  3.2 Loh와 Nee 데이터의 실험 결과
 4. 결론
 참고문헌

• 장창식(한양대학교 산업공학과) | Chang-Sik Jang
• 강맹규(한양대학교 산업공학과) | Maing-Kyu Kang