• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2000년도 봄 학술발표회논문집
• /
• 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.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.773-774
• /
• 2005

The knapsack problem (KP) is one of the traditional optimization problems. Specially, multiconstrained knapsack problem (MKP) is well-known NP-hard problem. Many heuristic algorithms and evolutionary algorithms have tackled this problem and shown good performance. This paper presents a novel genetic algorithm for the multiconstrained knapsack problem. The proposed algorithm is called 'Adaptive Link Adjustment'. It is based on integer random key representation and uses additional ${\alpha}$ and ${\beta}$-process as well as selection, crossover and mutation. The experiment results show that it can be archive good performance.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1997년도 추계학술대회발표논문집; 홍익대학교, 서울; 1 Nov. 1997
• /
• pp.166-169
• /
• 1997

For parallel processing, the compiler partitions a loaded program into a set of tasks and makes a schedule for the tasks that will minimize parallel processing time for the loaded program. Building an optimal schedule for a given set of partitioned tasks of a program has known to be NP-complete. In this paper we introduce a GA(Genetic Algorithm)-based scheduling method in which a chromosome consists of two parts of a string which decide the number and order of tasks on each processor. An additional computation is used for feasibility constraint in the chromosome. By granularity theory, a partitioned program is categorized into coarse-grain or fine-grain types. There exist good heuristic algorithms for coarse-grain type partitioning. We suggested another GA adaptive to the coarse-grain type partitioning. The infeasibility of chromosome is overcome by the encoding and operators. The number of processors are decided while the GA find the minimum parallel processing time.

• 전자공학회논문지B
• /
• 제32B권12호
• /
• pp.1680-1686
• /
• 1995

GAs, effective stochastic search algorithms based on the model of natural evolution and genetics, have been successfully applied to various optimization problems. When population size is not large, GAs often suffer from the phenomenon of premature convergence in which all chromosomes in the population lose the diversity of genes before they find the optimal solution. In this paper, we propose that a new heuristic that maintains the diversity of genes by adding some chromosomes with random mutation and selective mutation into population during evolution. And population size changes dynamically with supplement of new chromosomes. Experimental results for several test functions show that when population size is rather small and the length of chromosome is not long, this method is effective.

• 대한전기학회논문지:전력기술부문A
• /
• 제49권5호
• /
• pp.205-211
• /
• 2000

This paper presents an optimal design method for fuzzy logic controller (FLC) of HVDC using an Adaptive Evolutionary Algorithm(AEA). We have proposed the AEA which uses a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner in order to take merits of two different evolutionary algorithms. The AEA is used for tuning fuzzy membership functions and scaling constants. Simulation results show that disturbances are well damped and the dynamic performances of FLC have better responses than those of PD controller when AC system load changes suddenly.

• 제어로봇시스템학회논문지
• /
• 제8권2호
• /
• pp.126-135
• /
• 2002

The study is concerned with an approach to the design of new architectures of fuzzy neural networks and the discussion of comprehensive design methodology supporting their development. We propose an Adaptive Fuzzy Polynomial Neural Networks(APFNN) based on Fuzzy Neural Networks(FNN) and Self-organizing Networks(SON) for model identification of complex and nonlinear systems. The proposed AFPNN is generated from the mutually combined structure of both FNN and SON. The one and the other are considered as the premise and the consequence part of AFPNN, respectively. As the premise structure of AFPNN, FNN uses both the simplified fuzzy inference and error back-propagation teaming rule. The parameters of FNN are refined(optimized) using genetic algorithms(GAs). As the consequence structure of AFPNN, SON is realized by a polynomial type of mapping(linear, quadratic and modified quadratic) between input and output variables. In this study, we introduce two kinds of AFPNN architectures, namely the basic and the modified one. The basic and the modified architectures depend on the number of input variables and the order of polynomial in each layer of consequence structure. Owing to the specific features of two combined architectures, it is possible to consider the nonlinear characteristics of process system and to obtain the better output performance with superb predictive ability. The availability and feasibility of the AFPNN are discussed and illustrated with the aid of two representative numerical examples. The results show that the proposed AFPNN can produce the model with higher accuracy and predictive ability than any other method presented previously.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 추계학술대회 학술발표 논문집
• /
• pp.361-367
• /
• 1998

The main two applications of the Genetic Algorithms(GA) are the optimization and the machine learning. Machine Learning has two objectives that make the complex system learn its environment and produce the proper output of a system. The machine learning using the Genetic Algorithms is called GA machine learning or genetic-based machine learning (GBML). The machine learning is different from the optimization problems in finding the rule set. In optimization problems, the population of GA should converge into the best individual because optimization problems, the population of GA should converge into the best individual because their objective is the production of the individual near the optimal solution. On the contrary, the machine learning systems need to find the set of cooperative rules. There are two methods in GBML, Michigan method and Pittsburgh method. The former is that each rule is expressed with a string, the latter is that the set of rules is coded into a string. Th classifier system of Holland is the representative model of the Michigan method. The classifier systems arrange the strength of classifiers of classifier list using the message list. In this method, the real time process and on-line learning is possible because a set of rule is adjusted on-line. A classifier system has three major components: Performance system, apportionment of credit system, rule discovery system. In this paper, we solve the food search problem with the learning and evolution of an artificial ant using the learning classifier system.

• Smart Structures and Systems
• /
• 제23권1호
• /
• pp.1-14
• /
• 2019

Control algorithms are the most important aspects in successful control of structures against earthquakes. In recent years, intelligent control methods rather than classical control methods have been more considered by researchers, due to some specific capabilities such as handling nonlinear and complex systems, adaptability, and robustness to errors and uncertainties. However, due to lack of learning ability of fuzzy controller, it is used in combination with a genetic algorithm, which in turn suffers from some problems like premature convergence around an incorrect target. Therefore in this research, the introduction and design of the Fuzzy Cooperative Coevolution (Fuzzy CoCo) controller and Adaptive Neural-Fuzzy Inference System (ANFIS) have been innovatively presented for semi-active seismic control. In this research, in order to improve the seismic behavior of structures, a semi-active control of building using Magneto Rheological (MR) damper is proposed to determine input voltage of Magneto Rheological (MR) dampers using ANFIS and Fuzzy CoCo. Genetic Algorithm (GA) is used to optimize the performance of controllers. In this paper, the design of controllers is based on the reduction of the Park-Ang damage index. In order to assess the effectiveness of the designed control system, its function is numerically studied on a 9-story benchmark building, and is compared to those of a Wavelet Neural Network (WNN), fuzzy logic controller optimized by genetic algorithm (GAFLC), Linear Quadratic Gaussian (LQG) and Clipped Optimal Control (COC) systems in terms of seismic performance. The results showed desirable performance of the ANFIS and Fuzzy CoCo controllers in considerably reducing the structure responses under different earthquakes; for instance ANFIS and Fuzzy CoCo controllers showed respectively 38 and 46% reductions in peak inter-story drift ($J_1$) compared to the LQG controller; 30 and 39% reductions in $J_1$ compared to the COC controller and 3 and 16% reductions in $J_1$ compared to the GAFLC controller. When compared to other controllers, one can conclude that Fuzzy CoCo controller performs better.

• 센서학회지
• /
• 제20권3호
• /
• pp.151-155
• /
• 2011

A variety of pattern recognition algorithms including neural networks may be applicable to the identification of odors. In this paper, an identification technique for an electronic odor sensing system applicable to wound state monitoring is presented. The performance of the radial basis function(RBF) network is highly dependent on the choice of centers and widths in basis function. For the fine tuning of centers and widths, those parameters are initialized by an ill-conditioned genetic fuzzy c-means algorithm, and the distribution of input patterns in the very first stage, the stochastic gradient(SG), is adapted. The adaptive RBF network with singular value decomposition(SVD), which provides additional adaptation capabilities to the RBF network, is used to process data from array-based gas sensors for early detection of wound infection in burn patients. The primary results indicate that infected patients can be distinguished from uninfected patients.

• 한국경영과학회지
• /
• 제32권2호
• /
• pp.109-121
• /
• 2007

This paper focuses on algorithms based on the evolution, which is applied to various optimization problems. Especially, among these algorithms based on the evolution, we investigate the simple genetic algorithm based on Darwin's evolution, the Lamarckian algorithm based on Lamark's evolution and the Baldwin algorithm based on the Baldwin effect and also Investigate the difference among them in the biological and engineering aspects. Finally, through this comparison, we suggest a new algorithm to find more various solutions changing the genotype or phenotype search space and show the performance of the proposed method. Conclusively, the proposed method showed superior performance to the previous method which was applied to the constrained minimum spanning tree problem and known as the best algorithm.