• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.29 no.1
• /
• pp.423-428
• /
• 2005

Due to the fast growing rate of the global container trade, every major port is under the pressure of meeting the projected capacity demand. As a result, alternative solutions have been sought for improving capacity and meeting the growing demand for container storage area and terminal capacity. Moreover, material handling process re-engineering is now a critical issue for logistics and supply chain managers of airline, shipping lines, terminal and warehousing enterprises around the world. Therefore, the purpose of this paper is to develop the 3D simulator for executing performance valuation of port transportation systems. The developed 3D simulator system is to measure the effectiveness of the proposed total system and compare it with existing practices. The performance analysis variables are also defined for these comparisons.

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

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.974-978
• /
• 2002

For the efficient operation of container terminals, it is essential to develop optimal operation rules for marshaling yard and yard cranes. However, derision rules for conventional container terminals expose various limitations to be applied to automated container terminals. This paper introduces a development of a simulation model for evaluating various operation rules for automated transfer cranes (ATCs) and yard operation in the marshaling yard.

• Journal of the Korea Society for Simulation
• /
• v.12 no.3
• /
• pp.21-29
• /
• 2003

The operation rules to remarshaling works in yard is very important in automated container terminal (ACT). However, the decision rules for conventional container terminals have some restrictions to be applied to ACT whose block layout Is vortical for berth. The objective of this study is to propose the efficient operations rules for remarshaling works of automated transfer crane (ATC) in ACTs. Then, the various operation rules are simulated to verify the proposed operation rules. The results of the simulation study on various rules are provided and discussed.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.05a
• /
• pp.36-42
• /
• 2001

This paper presents the operational planning systems of automated container terminals. The proposed system is composed of berth allocation module, yard planning module, resource allocation module, sequencing module, and simulation module. All the sub-modules except resource allocation module are built into integrated simulation model using simulation package AutoMod. Simulation experiments are performed according to the number of AGVs and AGV allocation policies.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.05a
• /
• pp.74-81
• /
• 2005

In this study, we introduce a 3D simulation model to support the design on ACT(Automated Container Terminal) using 3D animation. The developed simulation model simulate virtual operations of ACT and animate the simulated results with real time. We provide several validation points for the design of ACT. And the developed system applied an object-oriented design and C++ programming to increase the reusability and extensibility. We can perform the various simulation experiment and analyze performances to estimate the required number of equipment using developed simulation model.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2022.06a
• /
• pp.432-434
• /
• 2022

자율운항선박 수용에 따른 화물 컨테이너 도착 및 항만에서의 화물 상태에 대한 데이터 흐름을 제공하여 화물 양·적하 및 선박 입출항 지원 서비스 개발을 통해 자율운항선박과 터미널 간의 화물 양·적하 작업과 입출항 작업에 대한 지원 시스템을 제공함으로서 화물의 물동량과 양·적하 효율 및 선석 운영효율을 최대화하고, 이에 더불어 자율운항선박의 선적정보 교환을 통한 양·적하 작업의 오류가능성과 자동화된 양·적하 지원을 통한 선박의 정박비용을 최소화하여 글로벌 공급 체인의 복잡성을 최소화하고 항만물류비용을 감소시키는데 기여하고자 한다.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.29 no.1
• /
• pp.377-382
• /
• 2005

This paper deals with productivity improvement of stevedoring system by pooling opertaions of transport vehicle at automated container terminal. Usually, in traditional container terminals, grouping operations of transport vehicle are applied for container crane because vehicle routing path is simple and vehicle assignment is easy. But this static assignment(SA) operation that arrsign vehicles to container crane ar apron reduces flexibility of vehicles. Therefore, This paper presented 4 dynamic assignment(DA) method to improve efficiency of vehicles. These 4 dynamic assignment method consider present situations of container crane such as sequence(Se), queue time(Qt), productivity(Pr), numeric of vehicle assignment(Nv), numeric of buffer(Nb) at vehicles assignment. At the results, dynamic assignment operation to consider Qt, Nv, Nb is most efficient and by next time, dynamic assignment operation to consider Se is superior more than static assignment operation. but, dynamic assignment operation to consider Pr or Qt of container crane only is inefficient than static assignment operation.

• Journal of Navigation and Port Research
• /
• v.32 no.10
• /
• pp.837-844
• /
• 2008

In an automated container terminal, various factors affect the operation of container handling equipment such as quay cranes and AGVs, and thus calculating the exact operation time is nearly infeasible. This uncertainty makes it difficult to dispatch AGVs well. In this paper, we propose a simulation-based AGV dispatching algorithm When dispatching an AGV to an operation, the proposed algorithm conducts multiple stochastic simulation for the succeeding AGV operations for the predetermined period to collect stochastic samples of the result of the dispatching. In the stochastic simulation, the uncertainty of crane operations is represented as a simple probability distribution and the operation time of a crane is determined according to this. A dispatching option is evaluated by the total delay time of quay cranes which is estimated by averaging the quay crane delay of each simulation In order to collect a sufficient number of samples that guarantee the credibility of the evaluation, we devised a high-speed simulator that simulates AGV operation The effectiveness of the proposed algorithm is validated by simulation experiments.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.75-86
• /
• 2008

A remarshalling is one of the operational strategies considered importantly at a port container terminal for the fast ship operations and heighten efficiency of slacking yard. The remarshalling rearranges the containers scattered at a yard block in order to reduce the transfer time and the rehandling time of container handling equipments. This Paper deals with the rearrangement problem, which decides to where containers are transported considering time value of each operations. We propose the mixed integer programming model minimizing the weighted total operation cost. This model is a NP-hard problem. Therefore we develope the heuristic algorithm for rearrangement problem to real world adaption. We compare the heuristic algorithm with the optimum model in terms of the computation times and total cost. For the sensitivity analysis of configuration of storage and cost weight, a variety of scenarios are experimented.