• Industrial Engineering and Management Systems
• /
• 제3권1호
• /
• pp.22-37
• /
• 2004

An integrated heuristic approach based on genetic algorithms (GAs) is proposed for solving the container selection and loading problems. The GA for container selection solves a two-dimensional knapsack problem, determining a set of containers to minimize the transportation or shipment cost. The GA for container loading solves for the weighted coefficients in the evaluation functions that are applied in selecting loading positions and boxes to be loaded, so that the volume utilization is maximized. Several loading constraints such as box orientation, stack priority, stack stability, and container stability are also incorporated into the algorithm. In general, our computational results based on randomly generated data and problems from the literature suggest that the proposed heuristic provides a good solution in a reasonable amount of computational time.

• 한국멀티미디어학회논문지
• /
• 제21권4호
• /
• pp.513-526
• /
• 2018

Container load problems are conventional issues in history. Loading cylindrical or rectangle packages in restricted space is required to be efficient to minimize remaining area. Many people have depended on experience or known simple algorithms for a long time. Recently systematic algorithms are published over the world with developed computer technology. Maximal rectangles algorithm is well known to load arbitrary rectangles in a larger rectangle container with the organized manners. However, this algorithm has significant drawbacks, which are influenced by orientation of input load. We propose post-selective method to complement these orientation effects, which is found out to improve the loading efficiency.

• 산업경영시스템학회지
• /
• 제28권3호
• /
• pp.156-165
• /
• 2005

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.

• 한국해양공학회지
• /
• 제13권2호통권32호
• /
• pp.18-25
• /
• 1999

Western coastal ports of Korea experience severe tidal range with up to 9.7 meter between high and low tides. The significant water level variation implicates many operational difficulties during loading and un-loading from cargo ships. To overcome problems due to tide and to secure the continuous loading operation, a new loading system for container cargo called "container pallet system" is developed and introduced in the paper. Three types of structure forms, offshore structural deck, double bottom structural form and the mixed form, are inverstigated with MSC/NASTRAN software. The results prove that the mixed type structure with truss enforcement is found to be the most appropriate for the region.

• 대한안전경영과학회지
• /
• 제8권3호
• /
• pp.143-157
• /
• 2006

The purpose of this thesis is to develop a heuristic algorithm evaluating the layout to maximize number of boxes when a single-box-type is packed into a container. Actually because three-dimensional problems are involved in NP-complete, much study has been focused on heuristic algorithms. The basic concept of this study is as follows. The problem is solved as palletizing problems with each side of the container respectively. By using the height of boxes, the problem is extended to a three-dimensional problem. Consequently, through this thesis, we can get good solution and the result is displayed by three-dimensional computer graphic.

• 대한조선학회논문집
• /
• 제51권5호
• /
• pp.362-368
• /
• 2014

Container vessel sizes have constantly increased over the past two decades. With increasing ship sizes and higher container loading capacities, the adoption of lashing bridges has also increased. Today's lashing bridge designs range from 1st tier to 3rd tier lashing bridges. Container securing program of the past which is based on two lashing rods and 1st tier lashing bridge has to be improved to be suitable for the present time. The equilibrium equations in this study are established to cover the application of 3~4 lashing rods and 2nd~3rd tier lashing bridges. In addition developed program is improved to be able to calculate the reaction forces and optimum arrangement under the external lashing. An optimization algorithm which is suitable for the container securing problems involved the equality constraint has been also adopted in this study.

• Industrial Engineering and Management Systems
• /
• 제11권1호
• /
• pp.103-113
• /
• 2012

A yard in a container terminal is a temporary storage space before containers are loaded onto the target vessel or delivered to consignees. For improving the utilization of the space in the yard and the efficiency of loading and discharging operations, it is important that operation plans must be carefully constructed in advance. A heuristic method is suggested to solve operation space planning problems considering workloads on handling equipment as well as space availabilities. The operation plans in this paper includes quay crane (QC) schedules and space plans for multiple vessels considering the workload in the container yard of container terminals. This paper evaluates the effectiveness of a space planning method and the performance of a new QC scheduling method using a simulation model.

• 한국멀티미디어학회논문지
• /
• 제13권1호
• /
• pp.17-29
• /
• 2010

생산성은 컨테이너를 취급하는 작업소요시간의 최소화에 의해 극대화된다. 따라서 기존에는 전산시스템의 개선을 통해 생산성 향상을 추구해왔으나 이송장비의 운영 및 이송방식의 문제점으로 인해 한계가 있었다. 즉, 대표적인 이송장비인 Y/T(Yard Tractor)는 한 번의 주행에 양하 또는 적하 작업 중 하나만 가능하기 때문에 한 번의 주행에 양하와 적하를 순차적으로 동시에 수행할 수 있다면 작업소요시간이 단축될 수 있다. 따라서 본 논문에서는 RTLS(Real Time Location System) 기반의 Multi-Cycle System을 통하여 문제점을 해결하고자 하였다. 이를 위해 RTLS기술을 활용하여 Y/T의 실시간 위치파악, GIS기술을 통한 Y/T실시간 위치표시 및 최단거리 알고리즘(다익스트라)을 터미널업무에 활용하여 생산성을 향상시킬 수 있는 시스템을 개발하였다. 시스템에 대한 시뮬레이션 결과, 평균치대비 절감 운전거리율은 9%가 되었고 최대치대비 절감 운전거리율은 19%가 되었음을 확인할 수 있어 결과적으로 컨테이너터미널 생산성이 극대화됨을 알 수 있었다.

• 한국전산구조공학회논문집
• /
• 제25권1호
• /
• pp.27-36
• /
• 2012

모바일하버는 선박의 대형화로 인하여 항만에 접안 및 정박이 불가능하거나 선박의 접안 대기시간이 길어지는 경우 등 항만의 문제점들을 해결하기 위해 제시된 새로운 개념의 시스템이다. 이 새로운 시스템은 해상에 있는 선박에 다가간 후, 모바일하버에 설치된 크레인을 이용하여 선박에 컨테이너를 직접 상, 하역작업을 하도록 고안되었다. 모바일하버용 크레인은 컨테이너를 이송하는 장치로써 그 중요성이 매우 크다. 본 연구에서는 모바일하버용 크레인의 형태들을 제시하고 각 형태에 따른 구조최적설계를 실시하였다. 불안정한 해상으로부터 발생되는 횡동요 및 종동요와 바람에 의한 풍하중을 최적설계의 하중조건으로 하였다. 또 한국선급 및 각각의 규정들을 최적설계의 제한조건으로 하여 규정을 만족하면서 경량화된 크레인 구조를 최적화하였다.

• 한국정보통신학회논문지
• /
• 제24권8호
• /
• pp.1095-1101
• /
• 2020

선박이나 항공기의 안정성 유지를 위하여 컨테이너나 화물의 무게 균형을 유지하도록 적재해야 한다. 컨테이너의 적재 알고리즘은 NP 문제로 알려져 있으며 몇 가지 휴리스틱 방법이 연구되었다. 선박이나 비행기에 보관할 컨테이너는 부피와 무게가 균일하다는 특징이 있는데 이를 이용하면 좀 더 쉬운 적재 방법을 찾을 수 있다. 본 논문에서는 물체의 부피와 무게가 균일할 때 무게 균형을 위한 알고리즘을 제안한다. 적재 공간은 m * n 메쉬의 특수한 구조라고 가정한다 (이때, m과 n은 모두 홀수이다). 이 경우, 본 논문에서는 Greedy 알고리즘을 제안하였고 물체의 개수가 몇 개이든 언제나 무게 균형을 유지하는 적재 장소를 찾을 수 있다는 점에서 그 알고리즘이 최적임을 증명하였다. 제안된 알고리즘은 적재 알고리즘 및 부하 균형 문제와 같은 여러 공학 문제에서 활용될 수 있다.