3차원 복수 컨테이너 적재 문제를 위한 발견적 해법

• 영문명: A Heuristic for the Multiple Container Loading Problem
• 발행기관: 한국산업경영시스템학회
• 저자명: 장창식(Chang-Sik Jang) 강맹규(Maing-Kyu Kang)
• 간행물 정보: 『산업경영시스템학회지』제28권 제4호, 142~153쪽, 전체 12쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2005.12.01

영문 초록

A new heuristic algorithm for the heterogeneous MCLP(Multiple Container Loading Problem) is proposed in this paper. In order to solve MCLP, this algorithm generates an initial solution by applying the new SCLP(Single Container Loading Problem) algorithm to given boxes with sequential loading strategy. An improvement algorithm improves the initial solution by reducing the total number of containers of the solution. The SCLP algorithm generates single container by filling empty spaces with the homogeneous load-blocks of identically oriented boxes and splits residual space into three sub spaces starting with an empty container. A loading pattern of the container is built by applying this approach recursively until all boxes are exhausted or no empty spaces are left in the container. Numerical experiments with 47 test cases show the good performance of this new algorithm.

목차

Abstract

1. 서론

2. 단수 컨테이너 혼합 적재 문제의 해법

3. 복수 컨테이너 혼합 적재 문제의 해법

4. 수치 실험

5. 결론

참고문헌