• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.225-228
• /
• 2001

DNA computing has been applied to the problem of getting an optimal solution since Adleman's experiment. DNA computing uses strings with various length and four-type bases that makes more useful for finding a global optimal solutions of the complex multi-modal problems. This paper presents DNA coding method for finding optimal solution of the multi-modal function and compares the efficiency of this method with the genetic algorithms (GA). GA searches effectively an optimal solution via the artificial evolution of individual group of binary string and DNA coding method uses a tool of calculation or Information store with DNA molecules and four-type bases denoted by the symbols of A(Ademine), C(Cytosine), G(Guanine) and T(Thymine). The same operators, selection, crossover, mutation, are applied to the both DNA coding algorithm and genetic algorithms. The results show that the DNA based algorithm performs better than GA.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.04a
• /
• pp.112-117
• /
• 1997

This paper presents a GA(Genetic Algorithms)-Optical control strategy for the control of the swing motion and the transverse position of the overhead crane. The overhead crane system is defined uncertain due to unknown system parameters such as payload and trolly mass. To control the overhead crane. the GA-Optimal control scheme is suggested. which transfers a trolly to a desired place as fast as possible and minimizes the swing of the payload during the transfer. The genetic algorithms are applied to fine digital optimal feedback gains. A computer simulation demonstrate the performance of the proposed the GA-digital optimal controller for the overhead crane.

• Proceedings of the KIEE Conference
• /
• 1995.11a
• /
• pp.71-73
• /
• 1995

This paper presents an optimization technique using genetic algorithms(GA) for loss minimization in the distribution network reconfiguration. Determining switch position to be opened for loss minimization in the radial distribution system is a discrete optimization problem. GA is appropriate to solve the multivariable optimization problem and it uses population, not a solution. For this reason, GA is attractive to solve this problem. In this paper, we aimed at finding appropriate open sectionalizing switch position using GA, which can lead to minimum transmission losses.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.488-490
• /
• 1995

This paper presents an optimization technique using genetic algorithms(GA) for loss minimization in the distribution network reconfiguration. Determining switch position to be opened for loss minimization in the radial distribution system is a discrete optimization problem. GA is appropriate to solve the multivariable optimization problem and it uses population, not a solution. For this reason, GA is attractive to solve this problem. In this paper, we aimed at finding appropriate open sectionalizing switch position using GA, which can lead to minimum transmission losses.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.16 no.4
• /
• pp.407-417
• /
• 2003

Enen though several GA-based optimization algorithms have been successfully applied to complex optimization problems in various engineering fields, GA-based optimization methods are computationally too expensive for practical use in the field of structural optimization, particularly for large- scale problems. Furthermore, a successful implementation of GA-based optimization algorithm requires a cumbersome and trial-and-error routine related to setting of parameters dependent on a optimization problem. Therefore, to overcome these disadvantages, a high-performance GA is developed in the form of distributed hybrid genetic algorithm for structural optimization on a cluster of personal computers. The distributed hybrid genetic algorithm proposed in this paper consist of a simple GA running on a master computer and multiple μ-GAs running on slave computers. The algorithm is implemented on a PC cluster and applied to the minimum weight design of steel structures. The results show that the computational time required for structural optimization process can be drastically reduced and the dependency on the parameters can be avoided.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.49 no.5
• /
• pp.212-219
• /
• 2000

This paper deals with a systematic approach to GA-PI controller design for static VAR compensator(SVC) using genetic algorithms(GAs) which are search algorithms based on the mechanics of natural of natural selection and natural genetics, to improve system stability. A SVC, one of the Flexible AC Transmission System(FACTS), constructed by a fixed capacitor(FC) and a thyristor controlled reactor(TCR), is designed and implemented to improve the damping of a synchronous generator, as well as controlling the system voltage. To verify the robustness of the proposed method, considered dynamic response of generator used deviation and generator terminal voltage by applying a power fluctuation and three-phase fault at heavy load, normal load and light load. Thus, we proved usefulness of GA-PI controller design to improve the stability of single machine-infinite bus with SVC system.

• Journal of Aerospace System Engineering
• /
• v.7 no.1
• /
• pp.8-18
• /
• 2013

Recently, the advanced condition monitoring methods such as the model-based method and the artificial intelligent method have been applied to maximize the availability as well as to minimize the maintenance cost of the aircraft gas turbines. Among them the non-linear GPA(Gas Path Analysis) method and the GA(Genetic Algorithms) have lots of advantages to diagnose the engines compared to other advanced condition monitoring methods such as the linear GPA, fuzzy logic and neural networks. Therefore this work applies both the non-linear GPA and the GA to diagnose AE3007 turbofan engine for an aircraft, and in case of having sensor noise and bias it is confirmed that the GA is better than the GPA through the comparison of two methods.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.326-334
• /
• 1999

There are the fault tolerance technology and the fault avoidance technology to analyze and evaluate the performance of computer system. To improve the relibility of software The N-Version Programming (NVP) technology is known to be the most objective and quantitive. However, when discrete probability distribution is used as estimation model, the values of it's component reliability should be same. In this paper, to resolve this problem, we adapted the genetic algorithms to NVP technology and implement the optimized simulate. and the results were analyzed and estimated. Through this study, we could optimize the reliability of each component and estimate the optimum count in the system reliability.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.4
• /
• pp.597-605
• /
• 2010

This paper presents a contribution to parameter identification of a non-linear system using a new strategy to improve the genetic algorithm (GA) method. Since cost function plays an important role in GA-based parameter identification, we propose to improve the simple version of GA, where weights of the cost function are not taken as constant values, but varying along the procedure of parameter identification. This modified version of GA is applied to the induction motor (IM) as an example of nonlinear system. The GA cost function is the weighted sum of stator current and rotor speed errors between the plant and the model of induction motor. Simulation results show that the identification method based on improved GA is feasible and gives high precision.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.383-386
• /
• 2002

In this paper, we investigated the pattern recognition performance of the numeric patterns (from 0 to 9) using DNA coding method. The pattern recognition performance of the DNA coding method is compared to the that of the GA(Genetic Algorithm). GA searches effectively an optimal solution via the artificial evolution of individual group of binary string using binary coding, while DNA coding method uses four-type bases denoted by A(Adenine), C(Cytosine), G(Guanine) and T(Thymine), The pattern recognition performance of GA and DNA coding method is evaluated by using the same genetic operators(crossover and mutation) and the crossover probability and mutation probability are set the same value to the both methods. The DNA coding method has better characteristics over genetic algorithms (GA). The reasons for this outstanding performance is multiple possible solution presentation in one string and variable solution string length.