• Title/Summary/Keyword: Multiple cranes scheduling

Search Result 5, Processing Time 0.02 seconds

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.

A Genetic Algorithm for the Container Pick-Up Problem (컨테이너 픽업문제를 위한 유전자 알고리듬)

  • Lee, Shi-W.
    • IE interfaces
    • /
    • v.24 no.4
    • /
    • pp.362-372
    • /
    • 2011
  • Container pick-up scheduling problem is to minimize the total container handling time, which consists of the traveling distance and the setup time of yard cranes in a container yard. Yard cranes have to pick-up the containers which are stacked in the yard-bays to satisfy the work schedule requirement of quay crane, which loads and unloads containers on or from container ships. This paper allows the movement of multiple yard cranes among storage blocks. A mixed integer programming model has been formulated and a genetic algorithm (GA) has been proposed to solve problems of large sizes. Computational results show that the proposed GA is an effective method.

Real Time Scheduling for Multiple Yard Cranes in an Automated Container Terminal (자동화 컨테이너 터미널의 복수 장치장 크레인을 위한 실시간 작업 계획 수립)

  • Park, Tae-Jin;Choe, Ri;Ryu, Kwang-Ryel
    • Journal of Navigation and Port Research
    • /
    • v.31 no.10
    • /
    • pp.869-877
    • /
    • 2007
  • This paper proposes a realtime scheduling method using local search algorithm for non-crossable yard cranes in automated container terminal. To take into consideration the dynamic property of yard crane operation and satisfy the real time constraint, the proposed method repeatedly builds crane schedule for the jobs in a fixed length look-ahead horizon whenever a new job is requested In addition, the proposed method enables the co-operation between yard cranes through prior re-handling and re-positioning in order to resolve the workload imbalance problem between the two cranes, which is one of the primary causes that lower the performance of yard cranes. Simulation-based experiments have shown that the proposed method outperforms the heuristic based methods, and the cooperation scheme contributes a lot to the performance improvement.

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.