한국해양대학교

Detailed Information

Metadata Downloads

방문순서를 고려한 적재 문제에 관한 발견적 해법

Title
방문순서를 고려한 적재 문제에 관한 발견적 해법
Alternative Title
A Heuristic Method for Container Loading on Considering Routing Sequence
Author(s)
이정우
Publication Year
2007
Publisher
한국해양대학교 대학원
URI
http://kmou.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000002174950
http://repository.kmou.ac.kr/handle/2014.oak/9088
Abstract
The Three-Dimensional Bin packing problem (3BP) consists of allocating, without overlapping, a given set of three dimensional rectangular items to the minimum number of three dimensional identical finite bins. This paper presents a heuristic solution for the three dimensional container loading problem on considering routing sequence. The container loading problem on considering routing sequence is formulated as a zero-one mixed integer programming model whose objective is to minimize number of vehicle. Due to its problem complexity, I propose a heuristic algorithm based on tower loading technique.
Appears in Collections:
동북아물류시스템학과 > Thesis
Files in This Item:
000002174950.pdf Download

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

Browse