• Title/Summary/Keyword: intra-block remarshalling

Search Result 5, Processing Time 0.017 seconds

Searching for an Intra-block Remarshalling Plan for Multiple Transfer Cranes (복수 트랜스퍼 크레인을 활용하는 블록 내 재정돈 계획 탐색)

  • Oh Myung-Seob;Kang Jae-Ho;Ryu Kwang-Ryel;Kim Kap-Hwan
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.7
    • /
    • pp.624-635
    • /
    • 2006
  • This paper applies simulated annealing algorithm to the problem of generating a plan for intra-block remarshalling with multiple transfer cranes. Intra-block remarshalling refers to the task of rearranging containers scattered around within a block into certain designated target areas of the block so that they can be efficiently loaded onto a ship. In generating a remarshalling plan, the predetermined container loading sequence should be considered carefully to avoid re-handlings that may delay the loading operations. In addition, the required time for the remarshalling operation itself should be minimized. A candidate solution in our search space specifies target locations of the containers to be rearranged. A candidate solution is evaluated by deriving a container moving plan and estimating the time needed to execute the plan using two cranes with minimum interference. Simulation experiments have shown that our method can generate efficient remarshalling plans in various situations.

Sequencing Container Moves for Intra-Block Remarshalling in a Container Terminal Yard (컨테이너 터미널 장치장에서 블록 내 이적을 위한 컨테이너 이동 순서 계획)

  • Kang Jaeho;Oh Myung-Seob;Ryu Kwang Ryel;Kim Kap Hwan
    • 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.

  • PDF

Sequencing Container Moves for Intra-Block Remarshalling in a Container Terminal Yard (컨테이너 터미널 장치장에서 블록 내 이적을 위한 컨테이너 이동 순서 계획)

  • Kang Jaeho;Oh Myung-Seob;Ryu Kwang Ryel;Kim Kap Hwan
    • 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.

A Heuristic Approach to Scheduling Multiple Cranes for Intra-Block Remarshalling (복수 크레인을 활용한 블록 내 컨테이너 이적 계획)

  • Oh, Myung-Seob;Kang, Jae-Ho;Ryu, Kwang-Ryel;Kim, Kap-Hwan
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.29 no.1
    • /
    • pp.413-421
    • /
    • 2005
  • Intra-block remarshalling is the task of rearranging into some target bays those containers which are scattered within around the block. If multiple transfer cranes installed in the block are all used together we may be able to complete the remarshalling task as early as possible. However, when multiple cranes are used simultaneously, there may occur significant delays if we do not carefully consider interferences between the cranes at the time of scheduling. Especially, delays caused by interferences occur more frequently in case of using non-crossing cranes. This paper presents an efficient heuristics method for assigning moves of containers to each crane and for determining an appropriate container moving order in a manner sensitive to the interferences. Simulation experiments have shown that the proposed method can effectively reduce delays in various environments.

  • PDF

A Heuristic Approach to Scheduling Multiple Cranes for Intra-Block Remarshalling (복수 크레인을 활용한 블록 내 컨테이너 이적 계획)

  • Oh Myung-Seob;Kang Jaeho;Ryu Kwang Ryel;Kim Kap Hwan
    • Journal of Navigation and Port Research
    • /
    • v.29 no.5 s.101
    • /
    • pp.447-455
    • /
    • 2005
  • Intra-block remarshalling is the task of rearranging into some target bays those containers which are scattered within around the block. If multiple transfer cranes installed in the block are all used together we may be able to complete the remarshalling task as early as possible. However, when multiple cranes are used simultaneously, there may occur significant delays if we do not carefully consider interferences between the cranes at the time of scheduling. Especially, delays caused by interferences occur more frequently in case of using non-crossing cranes. This paper presents an efficient heuristic method for assigning moves of containers to each crane and for determining an appropriate container moving order in a manner sensitive to the interferences. Simulation experiments have shown that the proposed method can effectively reduce delays in various environments.