317 0

Full metadata record

DC FieldValueLanguage
dc.contributor.author강맹규-
dc.date.accessioned2019-11-11T01:27:32Z-
dc.date.available2019-11-11T01:27:32Z-
dc.date.issued2005-12-
dc.identifier.citation산업경영시스템학회지, v. 28, No. 4, Page. 142~153en_US
dc.identifier.issn2005-0461-
dc.identifier.urihttp://scholar.dkyobobook.co.kr/searchDetail.laf?barcode=4010017623325-
dc.identifier.urihttps://repository.hanyang.ac.kr/handle/20.500.11754/112033-
dc.description.abstractA 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.en_US
dc.language.isoko_KRen_US
dc.publisher한국산업경영시스템학회en_US
dc.title3차원 복수 컨테이너 적재 문제를 위한 발견적 해법en_US
dc.typeArticleen_US
dc.relation.journal한국산업경영시스템학회지-
dc.contributor.googleauthor장창식-
dc.contributor.googleauthor강맹규-
dc.relation.code2012211772-
dc.sector.campusE-
dc.sector.daehakCOLLEGE OF ENGINEERING SCIENCES[E]-
dc.sector.departmentDEPARTMENT OF INDUSTRIAL AND MANAGEMENT ENGINEERING-
dc.identifier.piddockang-
Appears in Collections:
COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > INDUSTRIAL AND MANAGEMENT ENGINEERING(산업경영공학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE