• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.2
• /
• pp.105-116
• /
• 2018

In this study, we consider the assembly line balancing (ALB) problem which is known as an very important decision dealing with the optimal design of assembly lines. We consider ALB problems with soft constraints which are expected to be fulfilled, however they are not necessarily to be satisfied always and they are difficult to be presented in exact quantitative forms. In previous studies, most researches have dealt with hard constraints which should be satisfied at all time in ALB problems. In this study, we modify the mixed integer programming model of the problem introduced in the existing study where the problem was first considered. Based on the modified model, we propose a new algorithm using the genetic algorithm (GA). In the algorithm, new features like, a mixed initial population selection method composed of the random selection method and the elite solutions of the simple ALB problem, a fitness evaluation method based on achievement ratio are applied. In addition, we select the genetic operators and parameters which are appropriate for the soft assignment constraints through the preliminary tests. From the results of the computational experiments, it is shown that the proposed algorithm generated the solutions with the high achievement ratio of the soft constraints.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.8
• /
• pp.48-53
• /
• 2001

In order to increase productivity and efficiency, high-speed rotating machines become popular these days. The high-speed rotating machine is likely to vibrate and cause machine failure even though it has small unbalance. Therefore, a balancing technique is studied in this paper. Off-line balancing methods are inadequate to solve unbalance vibration problem occurring in the field due to flexible rotor effect, faster tool change, and shorter spin-up and down, etc. An active balancing is suggested to allow re-balancing of the entire rotating assembly in the machine when a tool is changed. This paper shows how to identify the dynamics of the system using influence coefficient and suggest an active balancing technique based on influence coefficient method for high-speed spindle system.

• International Journal of Contents
• /
• v.3 no.1
• /
• pp.9-13
• /
• 2007

This paper proposes a policy on efficient load balancing that can reduce the network game server load burdened by surging number of users. The study adopted a contents-based clustering technique. Recently, skyrocketing number of clients in on-line games causes overloads on specific game servers, and the consequent server-instability brings the worst situation: a server failure. To cope with this problem, one can install more high-powered servers or be equipped with back-up servers, which is often inefficient in terms of cost performance. To solve this problem, the present study examined the technology enhancing the performance and efficiency of game servers by reducing the loads of specific game servers. In doing this, this study used the clustering technology to compose game servers classified by their contents and carried out appropriate load balancing to numerous clients with load balancers in each region.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.2
• /
• pp.217-228
• /
• 1994

This paper presents a new integer formulation (Type III ALB) for a single model assembly line balancing problem. The objective of the formulation is to minimize the total idle time, which is defined as the product of the number of work stations and the cycle times minus the total work content. This formulation considers currently existing Type I (minimizing the number of work stations for a given cycle time) and type II (minimizing the cycle time for a given number of work stations) formulations as its special cases and provides the global minimum solutions of the cycle time and the number of work stations. This information would be of great value to line designers involved in designing new assembly lines and rebalancing old lines under flexible conditions. Solution methods based on combination of Type I and Type II approaches are also suggested and compared.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.83-101
• /
• 1998

Assembly U-lines are increasingly accepted in industry, especially just-in-time production systems, for the efficient utilization of workforce. In this paper, we present an integer programming formulation and a branch-and-bound method for balancing the U-line with the objective of minimizing the number of workstations with a fixed cycle time. In the mathematical model, we provide the method that can reduce the number of variables and constraints. The proposed branch-and-bound method searches the optimal solution based on a depth-first-search. To efficiently search for the optimal solutions to the problems, an assignment rule is used in the method. Bounding strategies and dominance rules are also utilized. Some problems require a large amount of computation time to find the optimal solutions. For this reason. some heuristic fathoming rules are also proposed. Extensive experiments with test-bed problems in the literature are carried out to show the performance of the proposed method. The computational results show that our method is promising in solution quality.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.39.2-39
• /
• 2002

This paper presents adaptive add-on control algorithms for theconventional mode of operation of MEMS z-axis gyroscopes. This scheme is realized by adding an outer loop to a conventional force-balancing scheme that includes a parameter estimation algorithm. The parameter adaptation algorithm estimates the angular rate, identifies and compensates the quadrature error, and may permit on-line automatic mode tuning. The convergence and resolution analysis show that the proposed adaptive add-on control scheme prevents the angular rate estimate from being contaminated by the quadrature error, while keeping ideal resolution performance of a conventional force-balancing scheme.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.4
• /
• pp.157-162
• /
• 2010

The cart-pole balancing problem is a pseudo-standard benchmark problem from the field of control methods including genetic algorithms, artificial neural networks, and reinforcement learning. In this paper, we propose a novel approach by using online reinforcement learning(OREL) to solve this cart-pole balancing problem. The objective is to analyze the learning method of the OREL learning system in the cart-pole balancing problem. Through experiment, we can see that approximate faster the optimal value-function than Q-learning.

• Journal of Power Electronics
• /
• v.12 no.4
• /
• pp.567-577
• /
• 2012

This paper introduces a new scheme to balance the DC bus voltages of a cascaded H-bridge converter which is used as a Distribution Static Synchronous Series Compensator (D-SSSC) in electrical distribution network. The aim of D-SSSC is to control the power flow between two feeders from different substations. As a result of different cell losses and capacitors tolerance the cells DC bus voltage can deviate from their reference values. In the proposed scheme, by individually modifying the reference PWM signal for each cell, an effective balancing procedure is derived. The new balancing procedure needs only the line current sign and is independent of the main control strategy, which controls the total DC bus voltages of cascaded H-bridge. The effect of modulation index variation on the capacitor voltage is analytically derived for the proposed strategy. The proposed method takes advantages of phase shift carrier based modulation and can be applied for a cascaded H-bridge with any number of cells. Also the system is immune to loss of one cell and the presented procedure can keep balancing between the remaining cells. Simulation studies and experimental results validate the effectiveness of the proposed method in the balancing of DC bus voltages.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12B
• /
• pp.811-817
• /
• 2005

Efficient bandwidth management is necessary in order to provide high quality service to users in a multimedia wireless/mobile network. In this paper, I propose an on-line load balancing algorithm with preemption. This technique is able to balance the traffic load among cells accommodating heterogeneous multimedia services while ensuring efficient bandwidth utilization. The most important features of my algorithm are its adaptability, flexibility and responsiveness to current network conditions. In addition, my online scheme to control bandwidth adaptively is a cell-oriented approach. This approach has low complexity making it practical for real cellular networks. Simulation results indicate the superior performance of my algorithm.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.9
• /
• pp.1681-1688
• /
• 2009

This paper proposes a new fault restoration method which adopts the recloser as top agent to release the problems of the data concentration and fault processing delay of the existing DAS(distribution Automation System) under the ubiquitous distribution system. In proposed method, top agent collects the data based on the multi-casting communication with the tie switches of the interconnection point, and then selects a closed switch(tie switch) to transfer the sound outage load to other feeders based on the heuristic search strategy step by step until the load transfer work is finished. Here, a new heuristic rule is developed which can guarantee the relational load balancing and line loss from the collected voltage data. Finally, the several faults are simulated for typical multi-section and multi-interconnection distribution system to prove the effectiveness of the proposed strategy, in particular, for each simulation cases, the load balancing index and line loss index of the obtained solution from the proposed method is compared with those of all of feasible solutions.