• Title/Summary/Keyword: 컨테이너 적하계획

Search Result 37, Processing Time 0.024 seconds

Decision Support System for Efficient Ship Planning of Container Terminals (효율적인 컨테이너 터미널 선적 계획을 위한 의사결정지원시스템)

  • 신재영;곽규석;남기찬
    • Journal of Korean Port Research
    • /
    • v.13 no.2
    • /
    • pp.255-266
    • /
    • 1999
  • The purpose of this paper is to describe the design of the decision support system for container terminal ship planning and to introduce the implemented system. The ship planning in container terminals consists of three major decision processes -the working schedule of gantry cranes the discharging sequence of inbound containers the loading position and sequence of outbound containers. For making these decision the proposed system can provide two ship planning modes the interactive planning mode with user-friendly GUI and the automated planning made. To implement the automated planning routine we acquired the planning rules from the expert planner in container terminals and developed an expert system based on the rules. Finally we evaluated the system developed and the potential for commercialization by using container terminal data.

  • PDF

Generating a Slot Assignment Rule for Outbound Containers Having Imprecise Weight Information (부정확한 무게 정보를 가진 수출 컨테이너를 위한 장치 위치 결정 규칙 생성 방법)

  • Kang Jae-Ho;Ryu Kwang-Ryel;Kim Kap-Hwan
    • 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.

Generating a Slot Assihnment Rule for Outbound Containers Having Imprecise Weight Information (부정확한 무게 정보를 가진 수출 컨테이너를 위한 장치 위치 결정 규칙 생성 방법)

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

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

Remarshalling Plan Using Neighboring Bay in Container Terminal (컨테이너 터미널에서 이웃 베이를 활용한 컨테이너 재정돈 계획)

  • Park, Young-Kyu
    • Journal of Navigation and Port Research
    • /
    • v.40 no.3
    • /
    • pp.113-120
    • /
    • 2016
  • If there are containers stacked upon the container to be fetched out of a container yard to vessel, rehandling which moves those containers to other places temporarily is needed. In order to avoid such rehandling, remarshalling which rearranges containers should be done before the vessel arrives. The remarshalling plan is commonly generated within a bay. It happens, however, that the generation of the intra-bay remarshalling plan within the permitted time is not possible because of bad stacking conditions. This paper presents the remarshalling algorithm which uses the empty slots of the neighboring bay as a temporary storage space. Simulation experiments have shown that the presented algorithm can generate the remarshalling plan within the permitted time under any staking conditions.

Dual Cycle Plan for Efficient Ship Loading and Unloading in Container Terminals (컨테이너 터미널의 효율적인 선적 작업을 위한 Dual Cycle 계획)

  • Chung, Chang-Yun;Shin, Jae-Young
    • Journal of Navigation and Port Research
    • /
    • v.33 no.8
    • /
    • pp.555-562
    • /
    • 2009
  • At container terminals, a major measurement of productivity can be work-efficiency in quay-side. At the apron, containers are loaded onto the ship and unloaded to apron by Q/C(Quay Crane). For improving the productivity of quay crane, the more efficient Y/T(Yard Tractor) operation method is necessary in container terminals. Between quay-side and yard area, current transferring methods is single-cycling which doesn't start loading unless it finishes unloading. Dual-cycling is a technique that can be used to improve the productivity of quay-side and utility of yard tractor by ship loading and unloading simultaneously. Using the dual-cycling at terminals only necessitates an operational change without purchasing extra equipment. Exactly, Y/T operation method has to be changed the dedicate system to pooling system. This paper presents an efficient ship loading and unloading plan in container terminals, which use the dual-cycling. We propose genetic and tabu search algorithm for this problem.

A Priority Analysis of Equipment Operation Plan for Container Terminal in Gwangyang Port (광양항 컨테이너터미널의 장비 작업계획 우선순위 분석)

  • Yeun, Dong-Ha;Choi, Yong-Seok
    • Journal of Korea Port Economic Association
    • /
    • v.27 no.1
    • /
    • pp.75-94
    • /
    • 2011
  • This paper is concerned about applying the AHP(Analytic Hierarchy Process) for a priority analysis of equipment operation plan to improve productivity of the container terminal in Gwangyang port. In this study, main elements of container terminal are assumed as into yard equipment area, transport equipment area, berth equipment area and C/Center area. A questionnaire is used to collect the opinions of equipment operating department and operational planning department. On the whole, the result of the analyses reveals that the most important area is yard equipment area. Examining each department is responses, equipment operating department preferred the C/Center area to other areas, on the other hand, operational planning department preferred yard equipment area. The result of this study suggests some guidelines for deciding priority of operation plan in the container terminal.

A Study on Ship Planning System for Container Terminal Using Multi-Distributed Method (다중분산기법을 이용한 컨테이너터미널 본선작업계획 수립에 관한 연구)

  • Choi, Hyung-Rim;Shin, Gae-Hyun;Kwon, Hae-Kyoung;Shon, Jung-Rock;Park, Sang-Hun;Joo, Yi-Don
    • Journal of Navigation and Port Research
    • /
    • v.33 no.10
    • /
    • pp.723-734
    • /
    • 2009
  • Container Vessel is becoming larger and faster thanks to the rapid growth of global trade and development of technology. Therefore, 15,000TEU vessel is expected to be ordered in near future. Every nations in north-east Asia are facing strong competition to be logistics hub to get the initiatives of logistics in response to the rapid change of logistics environment. According to the globalization of economy and major ports in this region also are trying to catch big shipping line for their survival. Considering above circumstances of the advent of ultra-large container vessel and spoke-and-hub strategy, it is inevitably necessary to make a fast and accurate vessel job in the terminal in order to be a leading port To meet this objective, current vessel planning system has to be improved innovatively. Therefore, this thesis propose multi distributed vessel planning system which enables multi loading/discharging planning with several planner simultaneously for faster and more accurate than existing planning and enhances quality of planning through information sharing among planners. Also this thesis uses simulation through Arena to verify the efficiency of this multi-distributed vessel planning system.

Deep Q-Learning Network Model for Container Ship Master Stowage Plan (컨테이너 선박 마스터 적하계획을 위한 심층강화학습 모형)

  • Shin, Jae-Young;Ryu, Hyun-Seung
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.24 no.1
    • /
    • pp.19-29
    • /
    • 2021
  • In the Port Logistics system, Container Stowage planning is an important issue for cost-effective efficiency improvements. At present, Planners are mainly carrying out Stowage planning by manual or semi-automatically. However, as the trend of super-large container ships continues, it is difficult to calculate an efficient Stowage plan with manpower. With the recent rapid development of artificial intelligence-related technologies, many studies have been conducted to apply enhanced learning to optimization problems. Accordingly, in this paper, we intend to develop and present a Deep Q-Learning Network model for the Master Stowage planning of Container ships.