• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.317-323
• /
• 2006

The objective of this study is to test and modify the gantry travel mechanism of an ALV(automated lifting vehicle) as a main technology of development of ALV. For the purpose of the improvement of container terminal productivity, this study performed to develop the ALV as a part of R&D. In order to verify the design data and detect the errors of detailed drawings, we performed the various limited weight test under load and unload conditions. Through the reflect of final drawing based on the this test, we could use to produce the more complete vehicle.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2007.12a
• /
• pp.253-254
• /
• 2007

오늘날 자동화 컨테이너 터미널은 대부분 AGV(Automated Guided Vehicle) 기반의 무인이송시스템을 운영하고 있다. AGV는 컨테이너의 상하차 작업 시 타장비의 도움을 필요로 한다. 이로 인하여 장비 간 대기시간이 발생하며, 이는 생산성을 떨어뜨리는 요인이 된다. 이와 같은 문제점을 해결한 무인이송장비로 ALV(Automated Lifting Vehicle)가 있다. ALV는 자가하역기능이 있어 타장비의 도움 없이 상하차 작업이 가능하다. 본 연구에서는 시뮬레이션을 통하여 각 이송시스템의 생산성을 비교하였다. 시뮬레이션은 이송시스템의 배차 방식과 안벽장비의 종류를 다양하게 설정하고, 무인이송장비의 가감속 운동 및 충돌을 고려하였다. 시뮬레이션 결과 소수의 경우를 제외하고는 ALV 기반의 이송시스템이 AGV 기반의 이송시스템보다 높은 생산성을 보여주었다.

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

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.29-39
• /
• 2008

Recently, an ALV (Automated Lifting Vehicle) is studied as an efficient transporter, which can reduce the waiting time during ship operation in a container terminal. There are little of studies on an ALV system considering dynamic factors after analysing the cooperation between equipments. The performance of an ALV depends on self-loading & unloading of an ALV, vehicle’s interference, and occupancy of an available transfer point under dynamic environment. So, it is very difficult to evaluate the productivity of a container terminal with an ALV system. Therefore the simulation model with operational rules that be apt for an ALV system must be developed. Also the model has to consider the characteristics of interface operations and vehicle traffic. Supposing an container terminal with perpendicular layout, this study analyses the process of container handling operation and proposes operational rules such as the ALV dispatching, routing algorithm and so on for a model. We developed a simulation model for a container terminal with an ALV system using object-oriented simulation software, Anylogic.

• Industrial Engineering and Management Systems
• /
• v.9 no.2
• /
• pp.178-194
• /
• 2010

To improve the ship operation in automated container terminals, it is important to schedule different types of handling equipment to operate synchronously. For example, a vehicle with container receiving and lifting capabilities is used to transport containers from a storage yard to a vessel and vice versa, while a triple quay crane (QC) can handle up to three 40-ft containers simultaneously. This paper discusses the manner in which vehicles should be assigned to containers to support such multi-lifts of QCs by using information about the locations and times of deliveries. A mixed-integer programming model is introduced to optimally assign delivery tasks to vehicles. This model considers the constraint imposed by the limited buffer space under each QC. A procedure for converting buffer-space constraints into time window constraints and a heuristic algorithmfor overcoming the excessive computational time required for solving the mathematical model are suggested. A numerical experiment is conducted to compare the objective values and computational times of the heuristic algorithm with those of the optimizing method to evaluate the performance of the heuristic algorithm.