• Journal of the Korea Society for Simulation
• /
• v.12 no.3
• /
• pp.21-29
• /
• 2003

The operation rules to remarshaling works in yard is very important in automated container terminal (ACT). However, the decision rules for conventional container terminals have some restrictions to be applied to ACT whose block layout Is vortical for berth. The objective of this study is to propose the efficient operations rules for remarshaling works of automated transfer crane (ATC) in ACTs. Then, the various operation rules are simulated to verify the proposed operation rules. The results of the simulation study on various rules are provided and discussed.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2003.06a
• /
• pp.155-160
• /
• 2003

Today, for improvement of container terminal productivity, it is necessary to develop ACT(Automated Container Terminal) But, decision rules for conventional container terminals expose various limitations to be applied to ACT. Specially it is important fact to assignment of containers, because the character of ACT which block layout is vertical for berth. And then there is need which assignment of containers with remarshaling work using ATC(Automated Transfer Crane)s. The objective of this study is to provide the operation rules for remarshaling work in ACT. To analyze the proposed rules, the simulation is performed, and we show efficiency of remarshaling on various remarshaling operation rules.

• Journal of Navigation and Port Research
• /
• v.33 no.6
• /
• pp.443-450
• /
• 2009

In this paper, we propose optimizing a remarshaling plan in an automated stacking yard using a cooperative coevolutionary algorithm (CCEA). Remarshaling is the preparation task of rearranging the containers in such a way that the delay are minimized at the time of loading. A plan for remarshaling can be obtained by the following steps: first determining the target slots to which the individual containers are to be moved and then determining the order of movement of those containers. Where a given problem can be decomposed into some subproblems, CCEA efficiently searches subproblems for a solution. In our CCEA, the remarshaling problem is decomposed into two subproblems: one is the subproblem of determining the target slots and the other is that of determining the movement priority. Simulation experiments show that our CCEA derives a plan which is better in the efficiency of both loading and remarshaling compared to other methods which are not based on the idea of problem decomposition.

• Journal of Navigation and Port Research
• /
• v.33 no.10
• /
• pp.715-722
• /
• 2009

In Automated Container Terminal, the remarshaling is the task of rearranging containers for the effective exporting operations. Since available time for the remarshaling is usually restricted, all containers cannot be remarshaled. Therefore, this paper proposes a method that selects some containers from all export containers and then establishes the remarshaling plan with only the selected containers. The experimental results using simulation system shows that our proposal planning method that plans after selecting remarshaling containers is better than plans with all loading containers and remarshals during the available time.

• Journal of Navigation and Port Research
• /
• v.38 no.2
• /
• pp.155-162
• /
• 2014

In container terminals, stacking yard is the place where import and export containers are temporarily stored before being loaded onto or after being discharged from a ship. Since all the containers go through the stacking yard in their logistic flow, the productivity of the terminal critically depends on efficient operation of stacking yard, which again depends on how well the stacking locations of the incoming containers are determined. However, a good location for stacking an incoming container later can turn out to be a bad one when that container is to be fetched out of the stacking yard, especially if some rehandling is required. This means that good locations for the containers are changing over time. Therefore, in most container terminals, the so-called remarshaling is done to move the containers from bad location to good locations. Although there are many previous works on remarshaling, they all assume that the remarshaling can be done separately from the main jobs when the cranes are idle for rather a long period of time. However, in reality, cranes are hardly available for a period long enough for remarshaling. This paper proposes a crane dispatching strategy that allows remarshaling jobs to be mixed together with the main jobs whenever an opportunity is detected. Experimental results by simulation reveals that the proposed method effectively contributes to the improvement of terminal productivity.

• Journal of Intelligence and Information Systems
• /
• v.14 no.4
• /
• pp.31-46
• /
• 2008

A stacking yard of a container terminal is a space for temporarily storing the containers that are carried in or imported until they are carried out or exported. If the containers are stacked in an inappropriate way, the efficiency of operation at the time of loading decreases significantly due to the rehandlings. The remarshaling is the task of rearranging containers during the idle time of transfer crane for the effective loading operations. This paper proposes a method of planning for remarshaling in a yard block of an automated container terminal. Our method conducts a search in two stages. In the first stage, the target stacking configuration is determined in such a way that the throughput of loading is maximized. In the second stage, the crane schedule is determined so that the remarshaling task can be completed as fast as possible in moving the containers from the source configuration to the target configuration. Simulation experiments have been conducted to compare the efficiency of loading operations before and after remarshaling. The results show that our remarshaling plan is really effective in increasing the efficiency of loading operation.

• Journal of Navigation and Port Research
• /
• v.34 no.6
• /
• pp.503-509
• /
• 2010

Remarshaling is referred to a preparatory task of rearranging containers piled up in a stacking yard to improve the efficiency of loading. Selective remarshaling is required because the time for remarshaling known as large time-consuming task is not enough to remarshal all containers. In this research, we compare two previous researches in more objectively way: heuristic and genetic algorithm based approaches. In addition, we prove the effect of iterative reselection method on dwindling the gap between plan and execution due to the uncertainty of crane operation during execution. Simulation experiments under realistic uncertainty model show that heuristic approaches which have few computational complexity can cope with the uncertainty well when reselection interval is short, but genetic algorithm based approach has advantages when reselection interval that can ensure appropriate number of evolutions is given because of computational complexity for search.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2004.11a
• /
• pp.203-208
• /
• 2004

The objective of this study is to analyze the efficiency of marshalling work using ATC(automated transfer crane) for ACT(automated container terminal). It is important fact to assignment of containers, because the character of ACT which block layout is vertical for berth and there are four other works which are inbound, oubound, loading and unloading in one block. And then there is need which assignment of containers with remarshaling work using ATCs in one block. Therefore, we analyze the efficiency of remarshaling work using simulation and suggest the assignment methodology of containers in yard

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.75-86
• /
• 2008

A remarshalling is one of the operational strategies considered importantly at a port container terminal for the fast ship operations and heighten efficiency of slacking yard. The remarshalling rearranges the containers scattered at a yard block in order to reduce the transfer time and the rehandling time of container handling equipments. This Paper deals with the rearrangement problem, which decides to where containers are transported considering time value of each operations. We propose the mixed integer programming model minimizing the weighted total operation cost. This model is a NP-hard problem. Therefore we develope the heuristic algorithm for rearrangement problem to real world adaption. We compare the heuristic algorithm with the optimum model in terms of the computation times and total cost. For the sensitivity analysis of configuration of storage and cost weight, a variety of scenarios are experimented.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1186-1193
• /
• 2006

이적작업은 하역작업 시간을 단축하고 장치장의 효율을 높이기 위해 최근 중요하게 다루어지는 운영 전략들 중의 하나이다. 자동화 컨테이너 터미널에서 수출 컨테이너 이적작업은 작업영역에 제약을 가진 하역장비를 이용하여 장치장 블록에 산재되어 있는 수출 컨테이너들을 적하작업이 용이한 형태로 재배치하는 것이다. 이 연구는 이적 및 적하작업과 연관된 총비용을 최소화하기 위해 어느 베이의 어떤 컨테이너를 어느 베이로 재배치할 지를 결정하기 위한 이적계획을 정의하고 이를 혼합정수계획법으로 모형화하였다. 또한, 실제 현장에서 사용이 가능한 휴리스틱 알고리즘을 제안하였으며 다양한 시나리오를 구성하여 배치형태 및 비용 가중치 등에 대한 민감도를 분석하였다.