한국해양대학교

Detailed Information

Metadata Downloads

컨테이너 화물 적재에 관한 연구

Title
컨테이너 화물 적재에 관한 연구
Alternative Title
A Study on Container Packing Problem
Author(s)
배민주
Issued Date
2004
Publisher
한국해양대학교 대학원
URI
http://kmou.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000002176042
http://repository.kmou.ac.kr/handle/2014.oak/10377
Abstract
Using of a container brought to reducing handling time and increasing rotation rate of ship service. Also, it improved efficiency of traditional ships and helped a high level of industrial structure by distribution system which is changed into the mass production-consumption.

Through the influence of such containers, minimized total logistics cost and attainment of multimodal transport will be achieved.

Specially, The container makes possible door-to-door services and has some advantages such as damage protection and lost reduction of freights, but it needs the capital of large scale and requires an expert knowledge and high level technology. Consequently, we need special techniques which consider the total logistics cost for container.

In this paper, we propose a new heuristic solution for 3D container packing problem for the variable sizes and types of freight.

First of all, we consider the total cost of container charge i.e., handling, loading and transportation, where each freight will be specifically identified. The types of containers and its number to be loaded can be selected automatically by minimizing the total cost of container charge. Maximization of loading space can be achieved efficiently by operating the palletizing and/or depalletizing of freight. By considering these factors we can determine the position of freight in the container and the loading sequence to be pacing into the container.

In container packing simulation, we can verify that the proposed heuristic algorithm indicate more efficiency space utilization and show the possibility of using on commercial business.
Appears in Collections:
물류시스템공학과 > Thesis
Files in This Item:
000002176042.pdf Download

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

Browse