• Journal of Korean Association for Spatial Structures
• /
• v.2 no.3 s.5
• /
• pp.93-102
• /
• 2002

The objective of this study is the development of size, shape and topology discrete optimum design algorithm which is based on the genetic algorithms. The algorithm can perform both shape and topology optimum designs of trusses. The developed algorithm was implemented in a computer program. For the optimum design, the objective function is the weight of trusses and the constraints are stress and displacement. The basic search method for the optimum design is the genetic algorithms. The algorithm is known to be very efficient for the discrete optimization. The genetic algorithm consists of genetic process and evolutionary process. The genetic process selects the next design points based on the survivability of the current design points. The evolutionary process evaluates the survivability of the design points selected from the genetic process. The efficiency and validity of the developed size, shape and topology discrete optimum design algorithms were verified by applying the algorithm to optimum design examples

• 한국공간정보시스템학회:학술대회논문집
• /
• 2004.05a
• /
• pp.43-52
• /
• 2004

The objective of this study is the development of size, shape and topology discrete optimum design algorithm which is based on the genetic algorithms. The algorithm can perform both shape and topology optimum designs of trusses. The developed algerian was implemented in a computer program. For the optimum design, the objective function is the weight of trusses and the constraints are stress and displacement. The basic search method for the optimum design is the genetic algorithms. The algorithm is known to be very efficient for the discrete optimization. The genetic algorithm consists of genetic process and evolutionary process. The genetic process selects the next design points based on the survivability of the current design points. The evolutionary process evaluates the survivability of the design points selected from the genetic process. The efficiency and validity of the developed size, shape and topology discrete optimum design algorithms were verified by applying the algorithm to optimum design examples

• Journal of Electrical Engineering and Technology
• /
• v.6 no.2
• /
• pp.182-191
• /
• 2011

Genetic algorithms (GA) and particle swarm optimization (PSO) are the most famous optimization techniques among various modern heuristic optimization techniques. These two approaches identify the solution to a given objective function, but they employ different strategies and computational effort; therefore, a comparison of their performance is needed. This paper presents the application and performance comparison of the PSO and GA optimization techniques for a static synchronous series compensator-based controller design. The design objective is to enhance power system stability. The design problem of the FACTS-based controller is formulated as an optimization problem, and both PSO and GA optimization techniques are employed to search for the optimal controller parameters.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.2925-2948
• /
• 2019

In order to improve the utilization of irrigation water resources of greenhouse tomatoes, a water-saving irrigation decision-making model based on genetic optimization T-S fuzzy neural network is proposed in this paper. The main work are as follows: Firstly, the traditional genetic algorithm is optimized by introducing the constraint operator and update operator of the Krill herd (KH) algorithm. Secondly, the weights and thresholds of T-S fuzzy neural network are optimized by using the improved genetic algorithm. Finally, on the basis of the real data set, the genetic optimization T-S fuzzy neural network is used to simulate and predict the irrigation volume for greenhouse tomatoes. The performance of the genetic algorithm improved T-S fuzzy neural network (GA-TSFNN), the traditional T-S fuzzy neural network algorithm (TSFNN), BP neural network algorithm(BPNN) and the genetic algorithm improved BP neural network algorithm (GA-BPNN) is compared by simulation. The simulation experiment results show that compared with the TSFNN, BPNN and the GA-BPNN, the error of the GA-TSFNN between the predicted value and the actual value of the irrigation volume is smaller, and the proposed method has a better prediction effect. This paper provides new ideas for the water-saving irrigation decision in greenhouse tomatoes.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.1 no.1
• /
• pp.87-94
• /
• 2001

Silicon nitride films grown by plasma-enhanced chemical vapor deposition (PECVD) are useful for a variety of applications, including anti-reflecting coatings in solar cells, passivation layers, dielectric layers in metal/insulator structures, and diffusion masks. PECVD systems are controlled by many operating variables, including RF power, pressure, gas flow rate, reactant composition, and substrate temperature. The wide variety of processing conditions, as well as the complex nature of particle dynamics within a plasma, makes tailoring SiN film properties very challenging, since it is difficult to determine the exact relationship between desired film properties and controllable deposition conditions. In this study, SiN PECVD modeling using optimized neural networks has been investigated. The deposition of SiN was characterized via a central composite experimental design, and data from this experiment was used to train and optimize feed-forward neural networks using the back-propagation algorithm. From these neural process models, the effect of deposition conditions on film properties has been studied. A recipe synthesis (optimization) procedure was then performed using the optimized neural network models to generate the necessary deposition conditions to obtain several novel film qualities including high charge density and long lifetime. This optimization procedure utilized genetic algorithms, hybrid combinations of genetic algorithm and Powells algorithm, and hybrid combinations of genetic algorithm and simplex algorithm. Recipes predicted by these techniques were verified by experiment, and the performance of each optimization method are compared. It was found that the hybrid combinations of genetic algorithm and simplex algorithm generated recipes produced films of superior quality.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.1
• /
• pp.29-35
• /
• 2012

This paper introduces an adaptive control method of strong mutation rate and probability for queen-bee genetic algorithms. Although the queen-bee genetic algorithms have shown good performances, it had a critical problem that the strong mutation rate and probability should be selected by a trial and error method empirically. In order to solve this problem, we employed the measure of convergence and used it as a control parameter of those. Experimental results with four function optimization problems showed that our method was similar to or sometimes superior to the best result of empirical selections. This indicates that our method is very useful to practical optimization problems because it does not need time consuming trials.

• Proceedings of the Korea Electromagnetic Engineering Society Conference
• /
• 2003.11a
• /
• pp.428-431
• /
• 2003

In this paper, distances between elements are optimized for low sidelobe level (SLL) microstrip patch array using Genetic Algorithms. Genetic Algorithms are "global" numerical-optimization methods, it's advantages are very simple coding and fast optimization. This paper show how to optimize the maximum SLL using Genetic Algorithms. In the results, although mutual coupling is neglected, it's maximum SLL is 3.5 dB lower than Uniformly Spaced Array(distance=$0.5{\lambda}$).

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.13 no.2
• /
• pp.25-32
• /
• 2004

This paper presents a new optimization technique of acceleration curve for dynamic structure's movement in which high speed and low vibration are desirable. This technique is based on a genetic algerian with a penalty function for acceleration optimization under the assumption that an initial profile of acceleration curves constitutes the first generation of the genetic algorithm. Especially the penalty function consists of the violation of constraints and the number of violated constraints. The optimized acceleration of the crane through the genetic algorithm and commercial dynamic analysis software has shown to have accurate movement and low vibration compared to the conventional accelerations with jerk discontinuity.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.6
• /
• pp.767-772
• /
• 2018

Recently, some meta-heuristic algorithms, such as GA(Genetic Algorithm) and GP(Genetic Programming), have been used to optimize CNN(Convolutional Neural Network). The CNN, which is one of the deep learning models, has seen much success in a variety of computer vision tasks. However, designing CNN architectures still requires expert knowledge and a lot of trial and error. In this paper, the recent attempts to automatically construct CNN architectures are investigated and analyzed. First, two GA based methods are summarized. One is the optimization of CNN structures with the number and size of filters, connection between consecutive layers, and activation functions of each layer. The other is an new encoding method to represent complex convolutional layers in a fixed-length binary string, Second, CGP(Cartesian Genetic Programming) based method is surveyed for CNN structure optimization with highly functional modules, such as convolutional blocks and tensor concatenation, as the node functions in CGP. The comparison for three approaches is analysed and the outlook for the potential next steps is suggested.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.120-122
• /
• 2006

The paper concerns the hybrid optimization of fuzzy inference systems that is based on Hierarchical Fair Competition-based Parallel Genetic Algorithms (HFCGA) and information data granulation. The granulation is realized with the aid of the Hard C-means clustering and HFCGA is a kind of multi-populations of Parallel Genetic Algorithms (PGA), and it is used for structure optimization and parameter identification of fuzzy model. It concerns the fuzzy model-related parameters such as the number of input variables to be used, a collection of specific subset of input variables, the number of membership functions, the order of polynomial, and the apexes of the membership function. In the hybrid optimization process, two general optimization mechanisms are explored. Thestructural optimization is realized via HFCGA and HCM method whereas in case of the parametric optimization we proceed with a standard least square method as well as HFCGA method as well. A comparative analysis demonstrates that the proposed algorithm is superior to the conventional methods.