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

• 발행기관: 한국산업경영시스템학회
• 저자명: 장창식(Chang-Sik Jang) 강맹규(Maing-Kyu Kang)
• 간행물 정보: 『한국산업경영시스템학회 학술대회』2005년 춘계학술대회 논문집, 255~266쪽, 전체 12쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2005.05.01

영문 초록

  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. 제안하는 해법
3. 수치 실험
4. 결론
참고문헌

키워드

Container Loading Problem Packing Heuristic