• Title/Summary/Keyword: Container terminal Storage yard

Search Result 36, Processing Time 0.019 seconds

Estimating the Expected Number of Re-handles for Empty Containers during Loading Operation (적하작업을 위한 공 컨테이너 기대 재취급 횟수 추정)

  • Lee, Hoon;Kim, Kap-Hwan
    • Journal of Navigation and Port Research
    • /
    • v.43 no.3
    • /
    • pp.197-208
    • /
    • 2019
  • This paper assessed the impacts of the specification of the yard, handling equipment, and operation approaches on the expected number of re-handles during the loading operation for empty containers. When the various types of empty containers from multiple shipping liners are placed in separate spaces from each other, then the storage space cannot be fully utilized. So as to increase the utilization of the storage space, empty containers from multiple vessel liners are stored together incurring additional re-handles during the loading operation. Several formulas are derived for the estimation of the expected number of handles, including re-handles, for empty container retrieval from a bay. Transfer cranes and top handlers are utilized as handling equipment and various retrieval strategies are examined. Numerical analysis was conducted to assess the effects of various designs and operational parameters of the container stacking yard on the expected number of handles.

A Study On Optimized Design of Decision Support Systems for Container Terminal Operations (컨테이너 터미널 운영을 위한 의사결정시스템 설계의 최적화에 관한 연구)

  • Hong, Dong-Hee;Chung, Tae-Choong
    • The KIPS Transactions:PartA
    • /
    • v.10A no.5
    • /
    • pp.519-528
    • /
    • 2003
  • Container terminals need decisions in the course of daily-24 hour and 365 day - operations, and all these decisions are inter-related. The ultimate goal of Decision Support System is to minimize ship loading/unloading time, resources used to handle the workload, and congestion on the roads inside the terminal. It is also to make the best possible use of the storage space available. Therefore, the necessity of decision support tools are emphasized to enhance the operational efficiency of container shipping terminals more, because of limits and complexity of these decisions. So, in thia paper, we draw evaluation items for Decision Support Systems and suggest optimization strategy of evaluation items which have the greatest influence on Decision Support system, that is, yard stacking allocation, RTGC deployment among blocks, and YT allocation to QCs. We also estimate the efficiency of Decision Support System design by simulation using G2 language, comparing ship loading/unloading time.

A Study on Yard Operation in Container Terminal (컨테이너 터미널에서의 장치장 운용 계획에 관한 연구)

  • Kim Kap-Hwan;Kim Jae-Joong;Ryu Kwang-Ryel;Park Nam-Kyu;Choi Hyung-Rim;Jeon Su-Min
    • Journal of Intelligence and Information Systems
    • /
    • v.12 no.1
    • /
    • pp.125-137
    • /
    • 2006
  • One of the important tactical problems for the efficient operation of container terminals is to determine the usage of storage space There are two different strategies for stacking containers; mixing strategy, in which outbound containers and inbound containers are mixed in the same block, and segregating strategy, in which outbound containers and inbound containers are stacked in blocks different from each other The performance of space allocation strategies also depends on the types of handling equipment in the yard and the number of handling equipment allocated to each block. A simulation model is developed considering various handling characteristics of yard cranes. Performances of various space and equipment allocation strategies are evaluated by using the simulation model.

  • PDF

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.

A Study to Solve Empty Container Return Problems in Gyeongin Province - Focusing on Uiwang ICD and Incheon Port - (경인지역 내 효율적인 공 컨테이너 반납처리 방안 연구 - 의왕ICD와 인천항을 중심으로 -)

  • Shin, Chul-Hwan;Moon, Ha-Yeon;Park, Jin-Hee
    • Journal of Navigation and Port Research
    • /
    • v.40 no.6
    • /
    • pp.459-468
    • /
    • 2016
  • The decreasing number of import and export containers is causing a problem with container circulation. In particular, this problem has reached a serious level in the Gyeongin area. Empty containers are accumulating in the Gyeongin container yard, where most of the returned containers are stored. In order to improve the empty container return problem at Gyeonhin, this study analyzes the actual situation and the empty container return process. A preference survey was conducted to suggest solutions from the perspective of users rather than shippers. A logistics company's data was analyzed to identify the inefficient cost structure in the Gyeongin area. The results show that the empty container return problem in Gyeongin is becoming more and more serious. To solve this problem, this paper proposes reestablishing functions at the Incheon Port, and securing a third new storage terminal in the Gyeongin area. Finally, an efficient empty container circulation system is presented. It will also be necessary to prepare laws and institutions to ensure these solutions.

A Heuristic Algorithm of an Efficient Berth Allocation for a Public Container Terminal (공공 컨테이너 터미널의 효율적인 선석할당을 위한 발견적 알고리즘 개발에 관한 연구)

  • Keum, J.S.
    • Journal of Korean Port Research
    • /
    • v.11 no.2
    • /
    • pp.191-202
    • /
    • 1997
  • As the suitability of berth allocation will ultimately have a significant influence on the performance of a berth, a great deal of attention should be given to berth allocation. Generally, a berth allocation problem has conflicting factors between servers and users. In addition, there is uncertainty in great extent caused by various factors such as departure delay, inclement weather on route, poor handling equipment, a lack of storage space, and other factors contribute to the uncertainty of arrival and berthing time. Thus, it is necessary to establish berth allocation planning which reflects the positions of interested parties and the ambiguity of parameters. For this, a berth allocation problem is formulated by fuzzy 0-1 integer programming introducing the concept of maximum Position Shift(MPS). But, the above approach has limitations in terms of computational time and computer memory when the size of problem is increased. It also has limitations with respect to the integration of other sub-systems such as ship planning system and yard planning system. For solving such problem, this paper focuses particularly on developing an efficient heuristic algorithm as a new technique of getting an effective solution. And also the suggested algorithm is verified through the illustrative examples and empirical appalicaton to BCTOC.

  • PDF