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

• Journal of Navigation and Port Research
• /
• v.29 no.1 s.97
• /
• pp.83-90
• /
• 2005

Intra-block remarshalling is the task of rearranging into some target bays those containers which are scattered around within the block, so that the containers can be loaded onto the ship efficiently. However, if we rearrange the containers without considering the container loading sequence, excessive rehandling work will be required at the time of loading because the containers to be fetched are often stacked under other containers. 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 loading. Simulation experiments have shown that the proposed method can generate rehandling-free solutions in real time.

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