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

• The KIPS Transactions:PartB
• /
• v.11B no.1
• /
• pp.63-70
• /
• 2004

Port operation is largely divided into gate operation, yard operation and berth operation. Operation strategy and optimal resource allocation for three parts are important in the productivity of the port operation.. Especially the resource allocation planning in berth operation needs optimization, because it is directly connected with the processing time in shipping. Berth planning is not independent on recourse allocation but interrelated with yard stacking area allocation. Therefore, we design the optimized module of berth planning and give priority to interrelationship with yard space allocation, while existing studies design independent resource allocation in berth planning. We suggest constraints by mathematical method, and they are related to yard stacking area allocation with existing constraints. Then we look for solutions, use tabu search to optimize them, and design optimized the berth planning module. In the performance test of optimized module design of berth planning, we find that the berth planning with yard stacking area allocation takes less processing time than without yard stacking area allocation.

• Journal of Intelligence and Information Systems
• /
• v.8 no.2
• /
• pp.71-89
• /
• 2002

In this paper, an integrated planning system is introduced for the efficient operation of container terminal. It consists of discharging and loading planning, yard planning, and berth scheduling subsystem. This interface of this system is considered for user's convenience, and the rule-based system is suggested and developed in order to make planning with automatic procedures, warning functions for errors.

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

• Journal of Intelligence and Information Systems
• /
• v.14 no.4
• /
• pp.31-46
• /
• 2008

A stacking yard of a container terminal is a space for temporarily storing the containers that are carried in or imported until they are carried out or exported. If the containers are stacked in an inappropriate way, the efficiency of operation at the time of loading decreases significantly due to the rehandlings. The remarshaling is the task of rearranging containers during the idle time of transfer crane for the effective loading operations. This paper proposes a method of planning for remarshaling in a yard block of an automated container terminal. Our method conducts a search in two stages. In the first stage, the target stacking configuration is determined in such a way that the throughput of loading is maximized. In the second stage, the crane schedule is determined so that the remarshaling task can be completed as fast as possible in moving the containers from the source configuration to the target configuration. Simulation experiments have been conducted to compare the efficiency of loading operations before and after remarshaling. The results show that our remarshaling plan is really effective in increasing the efficiency of loading operation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1483-1490
• /
• 2009

This parer is presented multiple path-planning of unmanned autonomous forklift using modified genetic algorithm and fuzzy inference system. There are a task-level feedback method and a method that path is dynamically replaned in realtime while the autonomous vehicles are moving by means of an optimal algorithm for existing multiple path-planning. However, such methods cause malfunctions and inefficiency in the sense of time and energy, and path-planning should be dynamically replanned in realtime. To solve these problems, we propose multiple path-planning using modified genetic algorithm and fuzzy inference system and show the performance with autonomous vehicles. For experiment, we designed and built two autonomous mobile vehicles that equipped with the same driving control part used in actual autonomous forklift, and test the proposed multiple path-planning algorithm. Experimental result that actual autonomous mobile vehicle, we verified that fast optimized path-planning and efficient collision avoidance are possible.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.3
• /
• pp.381-387
• /
• 2009

This paper is presented simultaneous localization and mapping (SLAM) based on feature map and path-planning using modified genetic algorithm for efficient driving of autonomous vehicle. The biggest problem for autonomous vehicle from now is environment adaptation. There are two cases that its new location is recognized in the new environment and is identified under unknown or new location in the map related kid-napping problem. In this paper, SLAM based on feature map using ultrasonic sensor is proposed to solved the environment adaptation problem in autonomous driving. And a modified genetic algorithm employed to optimize path-planning. We designed and built an autonomous vehicle. The proposed algorithm is applied the autonomous vehicle to show the performance. Experimental result, we verified that fast optimized path-planning and efficient SLAM is possible.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.22 no.6
• /
• pp.92-101
• /
• 2023

The increasing use of personal mobility has led to a rise in traffic accidents and social issues. Consequently, the government is continually revising laws and regulations to address the problems associated with personal mobility. This study conducted a survey that reflects user characteristics and public perceptions based on the law revised in May 2021. The personal characteristics, legal awareness, usage patterns, risk characteristics, and risk factors were analyzed. The analysis indicated that driving on roads without separate sidewalks, speeding, and carrying passengers are hazardous practices. Moreover, Poor awareness of the legal framework governing personal mobility results in law violations. These results are significant as they highlight the need for policy measures regarding institutional and legal improvements, and they underscore the importance of enhancing social awareness about safety as personal mobility become more widespread.

• Journal of Intelligence and Information Systems
• /
• v.5 no.1
• /
• pp.145-166
• /
• 1999

오늘날의 컨테이너 터미널의 실정은 예산 및 부지확보의 어려움, 그리고 환경문제 등에 부딪혀 시설 확충 및 신설이 거의 불가능하다. 따라서, 경쟁력이 있는 터미널이 되기 위해서는 터미널의 운영방법을 개선하고 자동화하여 컨테이너 트럭, 선박 등 운송수단의 대기시간과 취급장비의 사용을 줄여줌으로써 물류비용을 감소시키는 동시에 소비자에 대한 서비스 수준을 높이고, 결과적으로는 항만의 국제 경쟁력을 높일 수 있기 때문에 효율적인 운영방법에 대한 연구가 더욱 요구되고 있다. 본 논문에서는 터미널의 운영방법의 중요한 요소인 컨테이너 장치위치 결정법에 출고지역, 출고 날짜, 무게 등의 복합 결정요소를 적용하여 이를 자동화하는 계획(planning) 시스템을 구현하고자 하며, 계획자의 구현에 초점을 두고있다.

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

The productivity of container terminal is usually regarded same as the productivity of quay crane. Operation of quay crane for the export is started from picking up a container in yard block. In doing so, smooth flow of container is vital to maximize the productivity of quay crane. Improvement of quay crane's productivity means improvement of entire productivity in container terminal, which reinforces the competitiveness of terminal consequently. Setting effective plan is essential to improve work flow from yard to quay crane. For optimal plan, it is necessary to gather information about exact time schedule of come-and-go containers for loading, amount of containers that will be come to terminal. Generally, the arrival time of containers and the amount of containers are definite and predictable. However, in the case of export container, the arrival time of containers is random and unpredictable. This study examines the pattern of coming-in containers as time goes in container yard and provides the solution to how to plan export yard considering the change of state in terminal and adapt it to container yard plan