• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.201-208
• /
• 2005

Recently, the container terminal requires the study of method to increase efficiency through change of its operation method. Loading plan is a very important part to increase the efficiency of container terminal. Loading Plan is largely divided into two cases, deciding loading location and loading scheduling and this Paper proposes a more efficient method of container loading scheduling. Container loading scheduling is a problem of combination optimization to consider several items of loading location and operation equipments. etc. An existing method of cluster composition that decides the order of container loading scheduling has a restriction to increase the efficiency of work owing to rehandling problem. Therefore, we Propose a more efficient method of container loading scheduling which composes containers with identical attribution, based on ship loading list and yard map, into stack units of cluster, applying to hierarchical clustering method, and defines the restriction of working order. In this process, we can see a possible working path among clusters by defining the restriction of working order and search efficiency will be increased because of restricted search for working path.

• 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 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.