• Journal of Navigation and Port Research
• /
• v.29 no.6 s.102
• /
• pp.573-581
• /
• 2005

The outbound containers in a container terminal are classified into a few groups by their weights and stacked separately in a yard for easy and efficient handling. In order to maintain the balance of a ship during loading, containers of heavier weight groups should be fetched out of a yard and loaded onto the ship before those of lighter weight groups. However, the weight information used to determine the weight group is usually imprecise. Therefore stacks will actually be filled with mixture of different weight groups and rehandlings are unavoidable during loading operation. This paper presents a method for estimating the number of rehandlings caused by imprecise information and a scheme for generating a simple but efficient slot assignment rule. Experiments have shown that a rule generated by the proposed method can reduce the number of rehandlings by about $20\%$ compared to the traditional slot assignment method which stacks only the containers of the same weight group in a single stack.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.29 no.1
• /
• pp.391-398
• /
• 2005

The outbound containers in a container terminal are classified into a few groups by their weights and stocked separately in a yard for easy and efficient handling. In order to maintain the balance of a ship during loading, containers of heavier weight groups should be fetched out of a yard and loaded onto the ship before those of lighter weight groups. However, the weight information used to determine the weight group is usually imprecise. Therefore stacks will actually be filled with mixture of different weight groups and rehandlings are unavoidable during loading operation. This paper presents a method for estimating the number of rehandlings caused by imprecise information and a scheme for generating a simple but efficient slot assignment rule. Experiments have shown that a rule generated by the proposed method can reduce the number of rehandlings by about 20%compared to the traditional slot assignment method which stacks only the containers of the same weight group in a single stack.

• Journal of Intelligence and Information Systems
• /
• v.12 no.1
• /
• pp.125-137
• /
• 2006

One of the important tactical problems for the efficient operation of container terminals is to determine the usage of storage space There are two different strategies for stacking containers; mixing strategy, in which outbound containers and inbound containers are mixed in the same block, and segregating strategy, in which outbound containers and inbound containers are stacked in blocks different from each other The performance of space allocation strategies also depends on the types of handling equipment in the yard and the number of handling equipment allocated to each block. A simulation model is developed considering various handling characteristics of yard cranes. Performances of various space and equipment allocation strategies are evaluated by using the simulation model.

• 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 Korean Society of Transportation
• /
• v.17 no.1
• /
• pp.159-171
• /
• 1999

This Paper aims to develop container terminal simulation models for medium and long term decision makings. It first undertakes in-depth survey of literature. finds its shortcomings and suggests some directions for improvement. It then proposes detailed design for the simulation models. Based on this it finally developes several simulation models and applies them to a hypothetical situation of a container terminal development. The results reveal that basic design questions such as length of quay, number of quay crane, size of storage area are well produced through the models.

• Journal of Navigation and Port Research
• /
• v.36 no.8
• /
• pp.665-671
• /
• 2012

A remarshalling is studied as an important operational strategy in an automated container terminal to enhance the productivity of container handling. This means the rearrangements of the containers scattered at a vertical yard block. The dispatching problem for remarshalling is selecting the remarshalling operation considering the available operation time and deciding the operation sequencing to maximize the effectiveness of remarshalling. This study develops the optimal mathematical model for yard crane dispatching problem with mixed integer program and explains dispatching problem using an example. However it is difficult to apply this model to a field problem because of its computational time. Therefore, we compare the representative 5 dispatching rules for real world adaption. In a numerical experiment, maximum weight ratio(MR) rule shows an overall outstanding performance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.11
• /
• pp.3163-3169
• /
• 2009

To secure superiority in keen competition among ports and to satisfy demands of shippers and shipping companies who are a main customer of ports, logistics service should be improved. However, most of dissatisfaction for logistics service arises from frequent transportation changes of shippers and inaccuracy of cargo-working information offered from shipping companies and inaccuracy of cargo information carried in from carriers. Therefore, the study embodied BPR and yard management prototype system on the basis of the process of business flow in yard to settle the above problems. The study also checked that information of booking list in a yard-allocated plan could be applied to forming efficient collaborative supply networking in yard management by supplementing insufficient cargo.

• Journal of Korea Port Economic Association
• /
• v.23 no.2
• /
• pp.121-144
• /
• 2007

In general, the design of container yard and container handling system on container terminal are focused on operation of shipside than service about chassis from outside(C/O). It is not efficient for chassis from outside. The purpose of this paper is functional assessment of efficient container terminal and for higher performance of container terminal. first, the items which are concerned with container handling at the planning of container terminal are investigated and extracted through the practical data analysis of container terminal. Also, verified problems of planning and present condition through the functional assessment. Secondly, the improvements for container throughput in container yard are proposed and examined the effectiveness of improvements about queuing time of chassis from outside and service time of transfer crane by the evaluation decision model based upon multi criteria objectives.

• Journal of Navigation and Port Research
• /
• v.30 no.6 s.112
• /
• pp.457-464
• /
• 2006

Remarshalling operation is one of the operations considered important in an automated container terminal to perform quickly loading operations and delivery operations. It arranges the containers scattered at a verticla yard block in order to reduce the transfer time and the rehandling time of ATC(Automated Transfer Crane)s. This paper deals with the remarshalling planning problem minimizing the weighted operation time. This problem can be decomposed into 2 subproblems, storage space assignment problem and operation sequencing problem Storage space assignment problem decides to where containers are transported in terms of transportation time cost.. With results of a previous subproblem, operation sequence problem determines the ATC operation sequence, which minimizes the dead-heading of ATC This study formulates each subproblem with mixed integer program and dynamic program. To illustrate the proposed model, we propose an instance to explain the process of remarshalling planning.

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

Intra-block remarshalling is the task of rearranging into some target bays those containers whim are scattered around the block, so that the containers can be loaded onto the ship ffficiently. Howeuer, if we rearrange the containers without considering the container larding sequence, too mud! rehandling work will be required at the time rf larding to fetch the right containers whim are stacked under the wrong ones. Therefore, the remarshalling should be done by moving the relevant containers in an appropriate order. This paper presents an efficient heuristic search technique for finding an appropriate container moving order during remarshalling to avoid rehandling at the time of larding. Simulation experiments have shown that the proposed method can generate rehandling-free solutions in a real time.