• Journal of the Korean Society for Precision Engineering
• /
• v.19 no.2
• /
• pp.41-48
• /
• 2002

• Journal of Intelligence and Information Systems
• /
• v.11 no.3
• /
• pp.25-43
• /
• 2005

In modern automated container terminals, automated guided vehicle (AGV) systems are considered a viable option for the horizontal tansportation of containers between the stacking yard and the quayside cranes. AGVs in a container terminal move rather freely and do not follow fixed guide paths. For an efficient operation of such AGVs, however, a sophisticated traffic management system is required. Although the flexible routing scheme allows us to find the shortest possible routes for each of the AGVs, it may incur many coincidental encounters and path intersections of the AGVs, leading to collisions or deadlocks. However, the computational cost of perfect prediction and avoidance of deadlocks is prohibitively expensive for a real time application. In this paper, we propose a traffic control method that predicts and avoids some simple, but at the same time the most frequently occurring, cases of deadlocks between two AGVs. More complicated deadlock situations are not predicted ahead of time but detected and resolved after they occur. Our method is computationally cheap and readily applicable to real time applications. The efficiency and effectiveness of our proposed methods have been validated by simulation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.11
• /
• pp.1106-1110
• /
• 2010

This paper proposes a method of optimizing a stacking strategy for an automated container terminal using multi-objective evolutionary algorithms (MOEAs). Since the yard productivities of seaside and landside are conflicting objectives to be optimized, it is impossible to maximize them simultaneously. Therefore, we derive a Pareto optimal set instead of a single best solution using an MOEA. Preliminary experiments showed that the population is frequently stuck in local optima because of the difficulty of the given problem depending on the yard occupancy rate. To cope with this problem, we propose another method of simultaneously optimizing two problems with different difficulties so that diverse solutions can be preserved in the population. Experimental results showed the proposed method can derive better stacking policies than the compared method solving a single problem given the same computational costs.

• Journal of Navigation and Port Research
• /
• v.31 no.10
• /
• pp.869-877
• /
• 2007

This paper proposes a realtime scheduling method using local search algorithm for non-crossable yard cranes in automated container terminal. To take into consideration the dynamic property of yard crane operation and satisfy the real time constraint, the proposed method repeatedly builds crane schedule for the jobs in a fixed length look-ahead horizon whenever a new job is requested In addition, the proposed method enables the co-operation between yard cranes through prior re-handling and re-positioning in order to resolve the workload imbalance problem between the two cranes, which is one of the primary causes that lower the performance of yard cranes. Simulation-based experiments have shown that the proposed method outperforms the heuristic based methods, and the cooperation scheme contributes a lot to the performance improvement.

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

The recent spread of the corona pandemic and a temporary surge in demand for consumer goods have resulted in an increase in port cargo volume, and the resulting port congestion is coupled with a shortage of labor in the port, exacerbating the global supply chain chaos. Supply chain disruptions will increase logistics costs and ultimately increase global inflationary pressures. In this situation, the role of the port, which is the nodal point between land and sea, is gradually becoming more important. And fully automated ports that are operated unmanned are evaluated as being able to respond stably and flexibly by reducing operational risks in situations such as COVID-19. Therefore, this study compared the operational performance of fully automated and non-fully automated terminals within the same port before and after the corona outbreak, and analyzed the fully automated terminal was stable in actual operation. As a result of the analysis, the fully automated terminal showed stable operating efficiency in all aspects of operational performance compared to the non-fully automated terminal even under severe port congestion due to COVID-19.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 1999.10a
• /
• pp.357-361
• /
• 1999

Currently, many research projects are focusing on automation of various equipment such as cranes and AGV's for automated container terminals. However, for more productivity of these terminals, integration of the required equipment is most crucial as proved in Computer Integrated Manufacturing (CIM). The integration requires information exchange via a type of network interconnecting various pisces of equipment. In order to better design such networks, this paper presents the requirements, available protocols, and basic network structure for an communication network in an automated crane terminal

• Journal of Navigation and Port Research
• /
• v.30 no.6 s.112
• /
• pp.457-464
• /
• 2006

Remarshalling operation is one of the operations considered important in an automated container terminal to perform quickly loading operations and delivery operations. It arranges the containers scattered at a verticla yard block in order to reduce the transfer time and the rehandling time of ATC(Automated Transfer Crane)s. This paper deals with the remarshalling planning problem minimizing the weighted operation time. This problem can be decomposed into 2 subproblems, storage space assignment problem and operation sequencing problem Storage space assignment problem decides to where containers are transported in terms of transportation time cost.. With results of a previous subproblem, operation sequence problem determines the ATC operation sequence, which minimizes the dead-heading of ATC This study formulates each subproblem with mixed integer program and dynamic program. To illustrate the proposed model, we propose an instance to explain the process of remarshalling planning.

• The KIPS Transactions:PartA
• /
• v.10A no.5
• /
• pp.513-518
• /
• 2003

The quantity of container transportation of the world habors is constantly increasing by 8.8 per year until 2011. Present port facilities will not satisfy it. So facility expansion is necessary. Because the processing cost in the harbor becomes to 30% of total transportation expense, major pors inthe world are making an effort in the automation facilities to solve the problems of higher labor costs and indufficient labor and to maximize the efficiency of the work and use of the land. Especially, the automation of the gate, which is the place of cargo's appearance and disappearance, the node which creates the information, is now rising as the important issue. In this study suggest more efficient design for port gate automation. First, calculate scale of gate complex, and compare of 1 step gate and 2 step, and optimal design for automated operation method of gate process.

• Journal of Navigation and Port Research
• /
• v.36 no.8
• /
• pp.665-671
• /
• 2012

A remarshalling is studied as an important operational strategy in an automated container terminal to enhance the productivity of container handling. This means the rearrangements of the containers scattered at a vertical yard block. The dispatching problem for remarshalling is selecting the remarshalling operation considering the available operation time and deciding the operation sequencing to maximize the effectiveness of remarshalling. This study develops the optimal mathematical model for yard crane dispatching problem with mixed integer program and explains dispatching problem using an example. However it is difficult to apply this model to a field problem because of its computational time. Therefore, we compare the representative 5 dispatching rules for real world adaption. In a numerical experiment, maximum weight ratio(MR) rule shows an overall outstanding performance.

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

In case of inappropriate stacking position of the container taking in container yard, the working time for the container would be delayed in taking out because of the occurrence of the re-handle and the increase of the crane moving time. We have to take into account a variety of elements like the crane interference, the container group and stacking height in order to determine the optimal stacking position and decide the weight reflecting the importance of these criteria. We propose the dynamic weight adjustment algorithm for the stacking policy criteria employing the online search in this research.