• Title/Summary/Keyword: 블록 내 이적

Search Result 14, Processing Time 0.026 seconds

컨테이너 터미널에서 다수 야드 크레인의 이적작업 일정계획

  • Park, Yeong-Man
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2015.07a
    • /
    • pp.169-170
    • /
    • 2015
  • 최근 컨테이너 터미널에서는 환적화물의 증가로 터미널내의 이적작업이 증가함에 따라 효율적인 이적작업 계획을 수립하고자 노력하고 있다. 본 연구는 블록내에서 다수의 야드 크레인이 운영되고 있는 경우에 주어진 시간내에 각 크레인 별 최적 이적작업 계획을 수립하는 문제에 대한 혼합정수법을 이용한 최적 수리모형을 제시하였다. 또한 실제 터미널에서 빠른 시간 안에 이적작업계획을 수립할 수 있는 발견적 기법을 제시하고 다양한 수치예제 실험을 통하여 유용성을 검증하였다.

  • PDF

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.

수직 배치형 블록 내에서 재배치 작업계획을 위한 혼합정수계획모형

  • Park, Yeong-Man;Bae, Jong-Uk
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2015.07a
    • /
    • pp.173-174
    • /
    • 2015
  • 컨테이너 터미널에서 이적작업은 적하작업과 반출작업을 신속하게 처리하기 위해 장치장에 흩어져 있는 컨테이너들을 재배치하는 것이다. 본 연구는 수직 배치형 장치장 블록 내에서 컨테이너 재배치 작업계획 문제를 다룬다. 재배치 작업계획은 대상 컨테이너, 옮겨질 위치 그리고 재배치 작업 순서를 정하는 것이다. 본 연구는 재배치 작업시간, 반출작업, 적하작업의 가중시간 비용을 최소화하면서 재배치 작업동안 공간 가용성이 만족되도록 장치위치와 작업순서를 함께 결정하는 혼합정수계획모형을 개발하였다.

  • PDF

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

자동화 컨테이너 터미널에서 이적작업을 위한 장치장 크레인 작업할당

  • Bae, Jong-Uk;Park, Yeong-Man
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2012.06a
    • /
    • pp.237-239
    • /
    • 2012
  • 이적작업은 자동화 컨테이너 터미널에서 하역작업의 생산성을 높이는 중요한 운영 전략 중의 하나이다. 이는 장치장 크레인의 이동시간과 재작업을 줄이기 위해 장치장 블록 내 컨테이너들의 재배치하는 작업을 의미한다. 이적작업은 주로 크레인의 유휴시간에 수행되며 장치장 크레인의 추가적인 하역 작업을 요구한다. 이적작업계획이 수립된 후 작업할당 문제가 다루어진다. 크레인 작업할당 문제는 작업가능시간에 대한 제약을 고려하여 이적작업의 효과를 최대화시키기 위해 장치장 크레인이 처리할 이적작업을 선정하고 이들의 작업순서를 정하는 것이다. 본 연구는 혼합정수계획법을 이용하여 장치장 크레인의 작업할당 문제를 모형화 하고 실효적인 이용을 위해 수치실험을 통해 여러 작업할당 규칙의 수행도를 비교분석하였다.

  • PDF

A Study on Simulation of Remarshalling Work in an Automated Container Terminal (자동화 컨테이너터미널의 이적작업에 관한 시뮬레이션 연구)

  • Lee Joo-Ho;Choi Yong-Seok
    • 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

  • PDF

Assignment and Operation Sequencing for Remarshalling of a Vertical Yard Block in Automated Container Terminals (자동화 컨테이너 터미널에서 수직형 블록의 이적작업을 위한 할당 및 작업순서)

  • Bae Jong-Wook;Park Young-Man;Kim Kap-Hwan
    • 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.

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.

Remarshalling Planning for Multiple Automated Yard Cranes Considering Slack Time (여유시간을 고려한 다수 자동화 야드 크레인의 이적작업 일정계획)

  • Park, Young-Man
    • Journal of Navigation and Port Research
    • /
    • v.41 no.3
    • /
    • pp.149-154
    • /
    • 2017
  • Recently, container terminal operators have made efforts to develop an efficient remarshalling plan in response to the increase in automation of equipment handling and transport of containers in the terminals. Usually, containers are handled by multiple AYCs(automated yard cranes) in-yard in an automated container terminal, and terminal operators establish a remarshalling plan using slack time to increase the efficiency of ship operation. This study develops the optimal mathematical model through mixed integer programming as a solution to the problem of dispatching multiple AYCs. Considering the difficulty of direct application to the field due to computation time, we analyze the five prototypical dispatching rules for real world adaptation. A numerical experiment found that the maximum weight ratio (MR) rule and the maximum weight (MW) rule are the ideal dispatching solutions to the multiple AYCs dispatching problem.