• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.1
• /
• pp.43-55
• /
• 2009

We consider a Direct Input Output Manufacturing System(DIOMS) which has a number of machine centers placed along a built-in Automated Storage/Retrieval System(AS/RS). The Storage/Retrieval (S/R) machine handles parts placed on pallets for the operational aspect of DIOMS and determines the optimal operating policy by combining computer simulation and genetic algorithm. The operational problem includes: input sequencing control, dispatching rule of the SIR machine, machine center-based part type selection rule, and storage assignment policy. For each operating policy, several different policies are considered based on the known research results. In this paper, using the computer simulation and genetic algorithm we suggest a method which gives the optimal configuration of operating policies within reasonable computation time.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2023.05a
• /
• pp.59-60
• /
• 2023

The automation of container terminals is an important factor that determines port competitiveness, and global advanced ports tend to strengthen their competitiveness through container terminal automation. The operational efficiency of the AGV, which is an essential transport equipment of the automated terminal, can improve the productivity of the automated terminal. The operation of AGVs in automated container terminals differs from that of conventional container terminals, as it is based on an automated system in which AGVs travel along designated paths and operate according to assigned tasks, requiring consideration of factors such as workload, congestion, and collisions. To prevent such problems and improve the efficiency of AGV operations, a more sophisticated model is necessary. Thus, this paper proposes an AGV scheduling model that takes into account the AGV travel path and task assignment within the terminal The model prevent the problem of deadlock and. various cases are generated by changing AGV algebra and number of tasks to create AGV driving situations and evaluate the proposed algorithm through algorithm and optimization analysis.

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

• Journal of Electrical Engineering and Technology
• /
• v.13 no.5
• /
• pp.1778-1790
• /
• 2018

Based on the requirements and characteristics of multi-zone autonomous decision-making in modern power system, fully distributed computing methods are needed to optimize the economic dispatch (ED) problem coordination of multi-regional power system on the basis of constructing decomposition and interaction mechanism. In this paper, four fully distributed methods based on alternating direction method of multipliers (ADMM) are used for solving the ED problem in distributed manner. By duplicating variables, the 2-block classical ADMM can be directly used to solve ED problem fully distributed. The second method is employing ADMM to solve the dual problem of ED in fully distributed manner. N-block methods based on ADMM including Alternating Direction Method with Gaussian back substitution (ADM_G) and Exchange ADMM (E_ADMM) are employed also. These two methods all can solve ED problem in distributed manner. However, the former one cannot be carried out in parallel. In this paper, four fully distributed methods solve the ED problem in distributed collaborative manner. And we also discussed the difference of four algorithms from the aspects of algorithm convergence, calculation speed and parameter change. Some simulation results are reported to test the performance of these distributed algorithms in serial and parallel.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.7_8
• /
• pp.352-358
• /
• 2003

A cluster of servers is the most promising solution to provide highly scalable and highly available network services with low implementation cost. One of popular solutions is using dispatcher as a request distributor. However this solution has the problem that is can be the bottleneck or single-point of failure point of itself. ONE-IP, the previous work, solves this serious problem by using broadcast message for distributing the request packet in LAN. Using simple scheduling technique, in addition, the overhead due to dispatching the request becomes minimal. However, as ONE-IP using very simple static scheduling algorithm, it would spread the request among servers unevenly and downgrades the cluster performance consequently. In this paper, we propose an improved TCP connection scheduling technique solving this unbalanced distributing problem. Using Round-Robin(RR) scheduling instead of hashing clients IP address, proposed technique can more evenly distribute incoming service requests among the servers. Experiments show average 3.8% improved performance in throughput compared to original ONE-IP technique.