http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
장창식(Chang-Sik Jang),강맹규(Maing-Kyu Kang) 한국산업경영시스템학회 2005 한국산업경영시스템학회 학술대회 Vol.2005 No.춘계
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.
장창식(Chang-Sik Jang),강맹규(Maing-Kyu Kang) 한국산업경영시스템학회 2005 한국산업경영시스템학회지 Vol.28 No.4
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.
장창식(Chang-Sik Jang),강맹규(Maing-Kyu Kang) 한국산업경영시스템학회 2005 한국산업경영시스템학회지 Vol.28 No.3
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.