• Title/Summary/Keyword: 항만터미널

Search Result 564, Processing Time 0.021 seconds

The strategy of Co-opetition in accordancd with the rapid changes of the environments of global port competition (글로벌 항만경쟁 환경의 급변에 따른 코피티션(Co-opetition) 전략 활용 방안)

  • Yun, Hee-Sook
    • Journal of Korea Port Economic Association
    • /
    • v.23 no.3
    • /
    • pp.79-101
    • /
    • 2007
  • The purpose of this study is to identify key factors of Co-opetition through examining the environmental and structural changes in the ports industry and suggest a few Co-opetition strategies for enhancing our ports capabilities in the long-term. In recent years, the trend toward market liberalization and globalization in ports industry has made rapid progress and it made the competition fiercer. To survive in this rapid changes, the ports have traditionally pursed a competitive strategy. However, an alternative strategy replacing the traditional strategy was introduced: namely, 'Co-opetition' a buzzword combining competition and co operation. Policy proposals this study suggests are the construction of a database regarding costs and benefits of ports for more effective analysis and improving the competitive power of a shipping company operating national flag carriers for achieving the purpose of Co-opetition and adoption of selection and concentration strategy for increasing the possibility of Co-opetition success.

  • PDF

Deadlock-free Routing of an AGV in Accelerated Motion (가감속을 고려한 교착없는 AGV 주행경로설정)

  • Choe, Ri;Park, Tae-Jin;Ryu, Kwang-Ryel
    • Journal of Navigation and Port Research
    • /
    • v.30 no.10 s.116
    • /
    • pp.855-860
    • /
    • 2006
  • In the environment where multiple AGVs(Automated Guided Vehicles) operate concurrently in limited space, collisions, deadlocks, and livelocks which have negative effect on the productivity of AGVs occure more frequently. The accelerated motion of an AGV is also one of the factors that make the AGV routing more difficult because the accelerated motion makes it difficult to estimate the vehicle's exact travel time. In this study, we propose methods of avoiding collisions, deadlocks, and livelocks using OAR(Occupancy Area Reservation) table, and selecting best route by estimating the travel time of an AGV in accelerated motion. A set of time-driven simulation works validated the effectiveness of the proposed methods.

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

The use of Local API(Anomaly Process Instances) Detection for Analyzing Container Terminal Event (로컬 API(Anomaly Process Instances) 탐지법을 이용한 컨테이너 터미널 이벤트 분석)

  • Jeon, Daeuk;Bae, Hyerim
    • The Journal of Society for e-Business Studies
    • /
    • v.20 no.4
    • /
    • pp.41-59
    • /
    • 2015
  • Information systems has been developed and used in various business area, therefore there are abundance of history data (log data) stored, and subsequently, it is required to analyze those log data. Previous studies have been focusing on the discovering of relationship between events and no identification of anomaly instances. Previously, anomaly instances are treated as noise and simply ignored. However, this kind of anomaly instances can occur repeatedly. Hence, a new methodology to detect the anomaly instances is needed. In this paper, we propose a methodology of LAPID (Local Anomaly Process Instance Detection) for discriminating an anomalous process instance from the log data. We specified a distance metric from the activity relation matrix of each instance, and use it to detect API (Anomaly Process Instance). For verifying the suggested methodology, we discovered characteristics of exceptional situations from log data. To demonstrate our proposed methodology, we performed our experiment on real data from a domestic port terminal.

Residual Settlement Behavior in Soft Ground Improved by PBD during Operating Facilities (PBD공법이 적용된 연약지반에서 운용 중인 시설물의 잔류침하거동)

  • Kang, Gichun;Kim, Taehyung;Jeong, Choonggi
    • Journal of the Korean GEO-environmental Society
    • /
    • v.15 no.8
    • /
    • pp.13-21
    • /
    • 2014
  • The Plastic Board Drain is used to improve soft soils deposited in container terminal area at a port. This paper describes settlement behavior of soft ground in this area from PBD installation to the time of operating facilities. Previous researches focused on soil improvement effect of PBD, that is, the settlement occurred during ground improvement period. The residual settlement occurred during operating the facility is very important from the maintenance and management point of view. However, the study of this residual settlement has been rarely conducted. In this study, by analyzing the measured settlement data obtained from the container terminal area at the port, it was verified that the residual settlement induced during operating facilities occurred in a layer with PBD improvement. In addition, by comparison the settlement predicted by a numerical analysis with the settlement measured in the field, it was confirmed that the actual settlement is in the range of predicted settlement.

Comparing Expected Numbers of Re-Handles for Empty Containers During Gate-Out Operation (공 컨테이너 반출 시 발생하는 재취급 횟수 비교)

  • Lee, Hoon;Kim, Kap-Hwan
    • Journal of Navigation and Port Research
    • /
    • v.42 no.3
    • /
    • pp.207-216
    • /
    • 2018
  • If empty containers from multiple shipping liners are mixed together in the same bay, then the space utilization increases; however, the expected number of re-handles also increases. Formulas for estimating the expected number of re-handles are derived for various storage strategies and two types of handling equipment. The expected number of re-handles is compared, through numerical experiments, among those cases. The results of the numerical experiments are used to analyze the change in the number of expected re-handles according to the change in the retrieval ratio and repair ratio. The impacts of the change in the bay size and the distribution of the storage and retrieval ratio of containers among multiple vessel liners on the expected number of re-handles are analyzed. It is necessary to study efficient operational strategies considering the expected number of re-handles for empty containers.

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 Cooperative Coevolutionary Algorithm for Optimizing Remarshaling Plan in an Automated Stacking Yard (자동화 장치장의 재정돈 계획 최적화를 위한 협력적 공진화 알고리즘)

  • Park, Ki-Yeok;Park, Tae-Jin;Ryu, Kwang-꾜디
    • Journal of Navigation and Port Research
    • /
    • v.33 no.6
    • /
    • pp.443-450
    • /
    • 2009
  • In this paper, we propose optimizing a remarshaling plan in an automated stacking yard using a cooperative coevolutionary algorithm (CCEA). Remarshaling is the preparation task of rearranging the containers in such a way that the delay are minimized at the time of loading. A plan for remarshaling can be obtained by the following steps: first determining the target slots to which the individual containers are to be moved and then determining the order of movement of those containers. Where a given problem can be decomposed into some subproblems, CCEA efficiently searches subproblems for a solution. In our CCEA, the remarshaling problem is decomposed into two subproblems: one is the subproblem of determining the target slots and the other is that of determining the movement priority. Simulation experiments show that our CCEA derives a plan which is better in the efficiency of both loading and remarshaling compared to other methods which are not based on the idea of problem decomposition.

Iterative Container Reselection Methods for Remarshaling in a Container Terminal (컨테이너 터미널의 재정돈 대상 컨테이너 주기적 재선택 방안)

  • Park, Ki-Yeok;Park, Tae-Jin;Ryu, Kwang-Ryel
    • Journal of Navigation and Port Research
    • /
    • v.34 no.6
    • /
    • pp.503-509
    • /
    • 2010
  • Remarshaling is referred to a preparatory task of rearranging containers piled up in a stacking yard to improve the efficiency of loading. Selective remarshaling is required because the time for remarshaling known as large time-consuming task is not enough to remarshal all containers. In this research, we compare two previous researches in more objectively way: heuristic and genetic algorithm based approaches. In addition, we prove the effect of iterative reselection method on dwindling the gap between plan and execution due to the uncertainty of crane operation during execution. Simulation experiments under realistic uncertainty model show that heuristic approaches which have few computational complexity can cope with the uncertainty well when reselection interval is short, but genetic algorithm based approach has advantages when reselection interval that can ensure appropriate number of evolutions is given because of computational complexity for search.

Routing of ALVs under Uncertainty in Automated Container Terminals (컨테이너 터미널의 불확실한 환경 하에서의 ALV 주행 계획 수립방안)

  • Kim, Jeongmin;Lee, Donggyun;Ryu, Kwang Ryel
    • Journal of Navigation and Port Research
    • /
    • v.38 no.5
    • /
    • pp.493-501
    • /
    • 2014
  • An automated lifting vehicle(ALV) used in an automated container terminal is a type of unmanned vehicle that can self-lift a container as well as self-transport it to a destination. To operate a fleet of ALVs efficiently, one needs to be able to determine a minimum-time route to a given destination whenever an ALV is to start its transport job. To find a route free from any collision or deadlock, the occupation time of the ALV on each segment of the route should be carefully scheduled to avoid any such hazard. However, it is not easy because not only the travel times of ALVs are uncertain due to traffic condition but also the operation times of cranes en route are not predicted precisely. In this paper, we propose a routing method based on an ant colony optimization algorithm that takes into account these uncertainties. The result of simulation experiment shows that the proposed method can effectively find good routes under uncertainty.