• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.11
• /
• pp.599-609
• /
• 2000

The new design methodology of a hybrid fuzzy controller by means of the genetic algorithms is presented. First, a hybrid fuzzy controller(HFC) related to the optimal estimation of control parameters is proposed. The control input for the system in the HFC combined PID controller with fuzzy controller is a convex combination of the FLC's output and PID's output by a fuzzy variable, namely, membership function of weighting coefficient. Second, an auto-tuning algorithms utilizing the simplified reasoning method and genetic algorithms is presented to automatically improve the performance of hybrid fuzzy controller. Especially, in order to auto-tune scaling factors and PID parameters of HFC using GA, three kinds of estimation modes such as basic, contraction, and expansion mode are effectively utilized. The proposed HFC is evaluated and discussed to show applicability and superiority with the and of three representative processes.

• The KIPS Transactions:PartA
• /
• v.10A no.1
• /
• pp.15-24
• /
• 2003

In this paper, an optimization model for the clustered node allocation systems in the distributed computing environment is presented. In the presented model with a distributed file system framework, the dynamics of system behavior over times is carefully thought over the nodes and hence the functionality of the cluster monitor node to check the feasibility of the current set of clustered node allocation is given. The cluster monitor node of the node allocation system capable of distributing the parallel modules to clustered nodes provides a good allocation solution using Genetic Algorithms (GA). As a part of the experimental studies, the solution quality and computation time effects of varying GA experimental parameters, such as the encoding scheme, the genetic operators (crossover, mutations), the population size, and the number of node modules, and the comparative findings are presented.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.3
• /
• pp.63-69
• /
• 2002

Detailed routing is a problem assigning each net to a track after global routing. The most popular algorithms for detailed routing include left-edge algorithm, dogleg algorithm, and greedy channel routing algorithm. In this paper we propose a genetic algorithm searching solution space for the detailed routing problem. We compare the performance of proposed genetic algorithm(GA) for detailed routing with that of greedy channel routing algorithm by analyzing the results of each implementation.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.1
• /
• pp.76-86
• /
• 2002

In this paper, we suggest a hybrid genetic algorithm reinforced by a fuzzy logic controller (flc-HGA) to overcome weaknesses of conventional genetic algorithms: the problem of parameter fine-tuning, the lack of local search ability, and the convergence speed in searching process. In the proposed flc-HGA, a fuzzy logic controller is used to adaptively regulate the fine-tuning structure of genetic algorithm (GA) parameters and a local search technique is applied to find a better solution in GA loop. In numerical examples, we apply the proposed algorithm to a simple test problem and two complex combinatorial optimization problems. Experiment results show that the proposed algorithm outperforms conventional GAs and heuristics.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.2
• /
• pp.89-95
• /
• 2002

Global routing is to assign each net to routing regions to accomplish the required interconnections. The most popular algorithms for global routing inlcude maze routing algorithm, line-probe algorithm, shortest path based algorithm, and Steiner tree based algorithm. In this paper we propose weighted network heuristic(WNH) as a minimal Steiner tree search method in a routing graph and a genetic algorithm based on WNH for the global routing. We compare the genetic algorithm(GA) with simulated annealing(SA) by analyzing the results of each implementation.

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

• Korean Journal of Construction Engineering and Management
• /
• v.21 no.1
• /
• pp.50-60
• /
• 2020

Estimates of project costs in the early stages of a construction project have a significant impact on the operator's decision-making in important matters, such as the site's decision or the construction period. However, it is difficult to carry out the initial stage with confidence because information such as design books and specifications is not available. In previous studies, case-based reasoning was used to predict initial construction costs, and genetic algorithms were used to calculate the weight of the inquiry phase among them. However, some say that it is difficult to perform better than the current year because existing genetic algorithms are calculated in random numbers. To overcome these limitations, correlation numbers using correlation analysis rather than random numbers are reflected in the genetic algorithm by method of local search, and weights are calculated using a hybrid genetic algorithm that combines local search and genetic algorithms. A case-based reasoning model was developed using the weights calculated and validated with the data. As a result, it was found that the hybrid GA-CBR applied with local search performed better than the existing GA-CBR.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2000.04b
• /
• pp.449-457
• /
• 2000

The paper describes the study of global approximate optimization utilizing soft computing techniques such as genetic algorithms (GA's), neural networks (NN's), and fuzzy inference systems(FIS). GA's provide the increasing probability of locating a global optimum over the entire design space associated with multimodality and nonlinearity. NN's can be used as a tool for function approximations, a rapid reanalysis model for subsequent use in design optimization. FIS facilitates to handle the quantitative design information under the case where the training data samples are not sufficiently provided or uncertain information is included in design modeling. Properties of soft computing techniques affect the quality of global approximate model. Evolutionary fuzzy modeling (EFM) and adaptive neuro-fuzzy inference system (ANFIS) are briefly introduced for structural optimization problem in this context. The paper presents the success of EFM depends on how optimally the fuzzy membership parameters are selected and how fuzzy rules are generated.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.1
• /
• pp.115-125
• /
• 1999

Simple Genetic Algorithm(SGA) proposed by J. H. Holland is a population-based optimization method based on the principle of the Darwinian natural selection. The theoretical foundations of GA are the Schema Theorem and the Building Block Hypothesis. Although GA does well in many applications as an optimization method, still it does not guarantee the convergence to a global optimum in some problems. In designing intelligent systems, specially, since there is no deterministic solution, a heuristic trial-and error procedure is usually used to determine the systems' parameters. As an alternative scheme, therefore, there is a growing interest in a co-evolutionary system, where two populations constantly interact and co-evolve. In this paper we review the existing co-evolutionary algorithms and propose co-evolutionary schemes designing intelligent systems according to the relation between the system's components.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.123-125
• /
• 2005

Many researchers conducted the effort for improving the classification accuracy of satellite image. Most of the study has used optical spectrum information of each pixel for image classification. By applying this method for high resolution satellite image, number of class becomes increase. This situation is remarkable for house, because the roof of house has variety of many colors. Even if the classification is carried out for many classes, roof color information of each house is not necessary. Most of the case, we need the information that object is house or not. In this study, we propose the method for detecting the object by using Genetic Algorithms (GA). Aircraft was selected as object. It is easy for this object to detect in the airport. An aircraft was taken as a template. Object image was taken from QuickBird. Target image includes an aircraft and Haneda Airport. Chromosome has four or five parameters which are composed of number of template, position (x,y), rotation angle, rate of enlarge. Good results were obtained in the experiment.