• Title/Summary/Keyword: Simple genetic algorithm

Search Result 299, Processing Time 0.024 seconds

Crack Identification Based on Synthetic Artificial Intelligent Technique (통합적 인공지능 기법을 이용한 결함인식)

  • Sim, Mun-Bo;Seo, Myeong-Won
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.25 no.12
    • /
    • pp.2062-2069
    • /
    • 2001
  • It has been established that a crack has an important effect on the dynamic behavior of a structure. This effect depends mainly on the location and depth of the crack. To identify the location and depth of a crack in a structure, a method is presented in this paper which uses synthetic artificial intelligent technique, that is, Adaptive-Network-based Fuzzy Inference System(ANFIS) solved via hybrid learning algorithm(the back-propagation gradient descent and the least-squares method) are used to learn the input(the location and depth of a crack)-output(the structural eigenfrequencies) relation of the structural system. With this ANFIS and a continuous evolutionary algorithm(CEA), it is possible to formulate the inverse problem. CEAs based on genetic algorithms work efficiently for continuous search space optimization problems like a parameter identification problem. With this ANFIS, CEAs are used to identify the crack location and depth minimizing the difference from the measured frequencies. We have tried this new idea on a simple beam structure and the results are promising.

Crack identification based on synthetic artificial intelligent technique (통합적 인공지능 기법을 이용한 결함인식)

  • Shim, Mun-Bo;Suh, Myung-Won
    • Proceedings of the KSME Conference
    • /
    • 2001.06c
    • /
    • pp.182-188
    • /
    • 2001
  • It has been established that a crack has an important effect on the dynamic behavior of a structure. This effect depends mainly on the location and depth of the crack. To identify the location and depth of a crack in a structure, a method is presented in this paper which uses synthetic artificial intelligent technique, that is, Adaptive-Network-based Fuzzy Inference System(ANFIS) solved via hybrid learning algorithm(the back-propagation gradient descent and the least-squares method) are used to learn the input(the location and depth of a crack)-output(the structural eigenfrequencies) relation of the structural system. With this ANFIS and a continuous evolutionary algorithm(CEA), it is possible to formulate the inverse problem. CEAs based on genetic algorithms work efficiently for continuous search space optimization problems like a parameter identification problem. With this ANFIS, CEAs are used to identify the crack location and depth minimizing the difference from the measured frequencies. We have tried this new idea on a simple beam structure and the results are promising.

  • PDF

An efficient procedure for lightweight optimal design of composite laminated beams

  • Ho-Huu, V.;Vo-Duy, T.;Duong-Gia, D.;Nguyen-Thoi, T.
    • Steel and Composite Structures
    • /
    • v.27 no.3
    • /
    • pp.297-310
    • /
    • 2018
  • A simple and efficient numerical optimization approach for the lightweight optimal design of composite laminated beams is presented in this paper. The proposed procedure is a combination between the finite element method (FEM) and a global optimization algorithm developed recently, namely Jaya. In the present procedure, the advantages of FEM and Jaya are exploited, where FEM is used to analyze the behavior of beam, and Jaya is modified and applied to solve formed optimization problems. In the optimization problems, the objective aims to minimize the overall weight of beam; and fiber volume fractions, thicknesses and fiber orientation angles of layers are selected as design variables. The constraints include the restriction on the first fundamental frequency and the boundaries of design variables. Several numerical examples with different design scenarios are executed. The influence of the design variable types and the boundary conditions of beam on the optimal results is investigated. Moreover, the performance of Jaya is compared with that of the well-known methods, viz. differential evolution (DE), genetic algorithm (GA), and particle swarm optimization (PSO). The obtained results reveal that the proposed approach is efficient and provides better solutions than those acquired by the compared methods.

Multiobjective PI/PID Control Design Using an Iterative Linear Matrix Inequalities Algorithm

  • Bevrani, Hassan;Hiyama, Takashi
    • International Journal of Control, Automation, and Systems
    • /
    • v.5 no.2
    • /
    • pp.117-127
    • /
    • 2007
  • Many real world control systems usually track several control objectives, simultaneously. At the moment, it is desirable to meet all specified goals using the controllers with simple structures like as proportional-integral (PI) and proportional-integral-derivative (PID) which are very useful in industry applications. Since in practice, these controllers are commonly tuned based on classical or trial-and-error approaches, they are incapable of obtaining good dynamical performance to capture all design objectives and specifications. This paper addresses a new method to bridge the gap between the power of optimal multiobjective control and PI/PID industrial controls. First the PI/PID control problem is reduced to a static output feedback control synthesis through the mixed $H_2/H_{\infty}$ control technique, and then the control parameters are easily carried out using an iterative linear matrix inequalities (ILMI) algorithm. Numerical examples on load-frequency control (LFC) and power system stabilizer (PSS) designs are given to illustrate the proposed methodology. The results are compared with genetic algorithm (GA) based multiobjective control and LMI based full order mixed $H_2/H_{\infty}$ control designs.

Image Recognition by Fuzzy Logic and Genetic Algorithms (퍼지로직과 유전 알고리즘을 이용한 영상 인식)

  • Ryoo, Sang-Jin;Na, Chul-Hoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.5
    • /
    • pp.969-976
    • /
    • 2007
  • A fuzzy classifier which needs various analyses of features using genetic algorithms is proposed. The fuzzy classifier has a simple structure, which contains a classification part based on fuzzy logic theory and a rule generation part using genetic algorithms. The rule generation part determines optimal fuzzy membership functions and inclusion or exclusion of each feature in fuzzy classification rules. We analyzed recognition rate of a specific object, then added finer features repetitively, if necessary, to the object which has large misclassification rate. And we introduce repetitive analyses method for the minimum size of string and population, and for the improvement of recognition rates. This classifier is applied to two examples of the recognition of iris data and the recognition of Thyroid Gland cancer cells. The fuzzy classifier proposed in this paper has recognition rates of 98.67% for iris data and 98.25% for Thyroid Gland cancer cells.

A Genetic Algorithm with Local Competing (지역적으로 경정하는 유전자 알고리즘)

  • Kang, Tae-Won
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.6
    • /
    • pp.396-406
    • /
    • 2002
  • On the whole, the simple GAs with just one population set is effective in finding one optimal solution. However, many real world problems have a lot of optimal solutions, and often it is important to find all of them. In this paper, we propose a GA that has a population set containing multiple optimal solutions. In the proposed GA, each of the individuals in population set has its own geological neighbors, and they exchange their genes globally as well as compete with others locally. The paper then evaluates the proposed GA along with many multimodal problems including a 30bit, order-six bipolar-deceptive function. Finally, we present some improvement directions of the proposed GA.

Wavelength selection by loading vector analysis in determining total protein in human serum using near-infrared spectroscopy and Partial Least Squares Regression

  • Kim, Yoen-Joo;Yoon, Gil-Won
    • Proceedings of the Korean Society of Near Infrared Spectroscopy Conference
    • /
    • 2001.06a
    • /
    • pp.4102-4102
    • /
    • 2001
  • In multivariate analysis, absorbance spectrum is measured over a band of wavelengths. One does not often pay attention to the size of this wavelength band. However, it is desirable that spectrum is measured at only necessary wavelengths as long as the acceptable accuracy of prediction can be met. In this paper, the method of selecting an optimal band of wavelengths based on the loading vector analysis was proposed and applied for determining total protein in human serum using near-infrared transmission spectroscopy and PLSR. Loading vectors in the full spectrum PLSR were used as reference in selecting wavelengths, but only the first loading vector was used since it explains the spectrum best. Absorbance spectra of sera from 97 outpatients were measured at 1530∼1850 nm with an interval of 2 nm. Total protein concentrations of sera were ranged from 5.1 to 7.7 g/㎗. Spectra were measured by Cary 5E spectrophotometer (Varian, Australia). Serum in the 5 mm-pathlength cuvette was put in the sample beam and air in the reference beam. Full spectrum PLSR was applied to determine total protein from sera. Next, the wavelength region of 1672∼1754 nm was selected based on the first loading vector analysis. Standard Error of Cross Validation (SECV) of full spectrum (1530∼l850 nm) PLSR and selected wavelength PLSR (1672∼1754 nm) was respectively 0.28 and 0.27 g/㎗. The prediction accuracy between the two bands was equal. Wavelength selection based on loading vector in PLSR seemed to be simple and robust in comparison to other methods based on correlation plot, regression vector and genetic algorithm. As a reference of wavelength selection for PLSR, the loading vector has the advantage over the correlation plot since the former is based on multivariate model whereas the latter, on univariate model. Wavelength selection by the first loading vector analysis requires shorter computation time than that by genetic algorithm and needs not smoothing.

  • PDF

Budget Estimation Problem for Capacity Enhancement based on Various Performance Criteria (다중 평가지표에 기반한 도로용량 증대 소요예산 추정)

  • Kim, Ju-Young;Lee, Sang-Min;Cho, Chong-Suk
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.5
    • /
    • pp.175-184
    • /
    • 2008
  • Uncertainties are unavoidable in engineering applications. In this paper we propose an alpha reliable multi-variable network design problem under demand uncertainty. In order to decide the optimal capacity enhancement, three performance measures based on 3E(Efficiency, Equity, and Environmental) are considered. The objective is to minimize the total budget required to satisfy alpha reliability constraint of total travel time, equity ratio, and total emission, while considering the route choice behavior of network users. The problem is formulated as the chance-constrained model for application of alpha confidence level and solved as a lexicographic optimization problem to consider the multi-variable. A simulation-based genetic algorithm procedure is developed to solve this complex network design problem(NDP). A simple numerical example ispresented to illustrate the features of the proposed NDP model.

Optical Interconnection Applied by Genetic Algorithm (유전 알고리즘을 적용한 광 상호연결)

  • Yoon, Jin-Seon;Kim, Nam
    • Journal of the Korean Institute of Telematics and Electronics D
    • /
    • v.36D no.7
    • /
    • pp.56-65
    • /
    • 1999
  • In this paper, a pixelated binary phase grating to generate $5{\times}5$ spots in designed using simple Genetic Algorithm(sGA) composed of selection, crossover, and mutation operators, and it can be applied for the optical interconnection. So as to adapt that GA is a robust and efficient schema, a chromosome is coded as a binary integer of length $32{\times}32$, the ranking method for decreasing the stochastic sampling error is performed, and a single-point crossover having $16{\times}16$ block size is used. A designed grating when the probabillty of mutation is 0.001, the probability of crossover is 0.75 and the population size is 300 has a 74.7[%] high diffraction efficiency and a $1.73{\times}10^{-1}$ uniformity quantitatively.

  • PDF

Enhanced Processor-Architecture for the Faster Processing of Genetic Algorithm (유전 알고리즘 처리속도 향상을 위한 강화 프로세서 구조)

  • Yoon, Han-Ul;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.2
    • /
    • pp.224-229
    • /
    • 2005
  • Generally, genetic algorithm (GA) has too much time and space complexity when it is running in the typical processor. Therefore, we are forced to use the high-performance and expensive processor by this reason. It also works as a barrier to implement real device, such a small mobile robot, which is required only simple rules. To solve this problem, this paper presents and proposes enhanced processor-architecture for the faster GA processing. A typical processor architecture can be enhanced and specialized by two approaches: one is a sorting network, the other is a residue number system (RNS). A sorting network can improve the time complexity of which needs to compare the populations' fitness. An RNS can reduce the magnitude of the largest bit that dictates the speed of arithmetic operation. Consequently, it can make the total logic size smaller and innovate arithmetic operation speed faster.