• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.1
• /
• pp.158-166
• /
• 2003

The paper describes the development and application of advanced evolutionary computing techniques referred to as micro genetic algorithms ($\mu$GA) in the context of engineering design optimization. The basic concept behind $\mu$GA draws from the use of small size of population irrespective of the bit string length in the representation of design variable. Such strategies also demonstrate the faster convergence capability and more savings in computational resource requirements than simple genetic algorithms (SGA). The paper first explores ten-bar truss design problems to see the optimization performance between $\mu$GA and SGA. Subsequently, $\mu$GA is applied to a realistic engineering design problem in the injection molding process optimization.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.11
• /
• pp.1665-1674
• /
• 2013

In this paper, we propose a genetic algorithm(GA) based locomotion method of a quadruped robot with waist joint, which makes a quadruped robot walk on the slop efficiently. In the proposed method, we first derive the kinematic model of a quadruped robot with waist joint and then set the gene and the fitness function for GA. In addition, we determine the best attitude for a quadruped robot and the landing point of a foot in the walk space, which has the optimal energy stability margin(ESM). Finally, we verify the effectiveness of the proposed method by comparing with the performance of the previous method through the computer simulations.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.11
• /
• pp.117-126
• /
• 2003

GA(genetic algorithm) has a powerful searching ability and is comparatively easy to use and to apply as well. By that reason, GA is in the spotlight these days as an optimization skill for mechanical systems.$^1$However, GA has a low efficiency caused by a huge amount of repetitive computation and an inefficiency that GA meanders near the optimum. It also can be shown a phenomenon such as genetic drifting which converges to a wrong solution.$^{8}$ These defects are the reasons why GA is not widdy applied to real world problems. However, the low efficiency problem and the meandering problem of GA can be overcomed by introducing parallel computation$^{7}$ and gray code$^4$, respectively. Standard GA(SGA)$^{9}$ works fine on small to medium scale problems. However, SGA done not work well for large-scale problems. Large-scale problems with more than 500-bit of sere's have never been tested and published in papers. In the result of using the SGA, the powerful searching ability of SGA doesn't have no effect on optimizing the problem that has 96 design valuables and 1536 bits of gene's length. So it converges to a solution which is not considered as a global optimum. Therefore, this study proposes ExpGA(experience GA) which is a new genetic algorithm made by applying a new probability parameter called by the experience value. Furthermore, this study finds the solution throughout the whole field searching, with applying ExpGA which is a optimization technique for the structure having genetic drifting by the standard GA and not making a optimization close to the best fitted value. In addition to them, this study also makes a research about the possibility of GA as a optimization technique of large-scale design variable problems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.2
• /
• pp.132-140
• /
• 2008

본 논문은 시간 제약을 갖는 차량 라우팅 문제를 해결하기 위해 유전자 알고리듬과 부분 최적화 알고리듬을 적용한 방법을 소개한다. 유전자 알고리듬에서의 염색체는 노드를 나타내는 정수의 순열로 표현되어 직접적인 해를 나타내지 않지만, 경험적 방법에 의한 해석을 통해 유효한 해로 변형되도록 하였다. 유전자 알고리듬에 의해 생성된 주어진 수의 우수한 해들에는 세 부분 최적화 방법이 순차적으로 적용되어 보다 좋은 해를 생성하도록 하였다. 부분 최적화 방법들에 의한 해는 다시 유전자 알고리듬의 해로 바뀌지 않도록 하여 두 알고리듬은 느슨하게 연결되도록 하였다. 솔로몬의 데이터를 이용한 실험에서 본 연구에서의 방법이 모든 문제에 대해 우수한 해를 생성함을 나타내었다. 특히, 지금까지 알려진 가장 우수한 경험적 방법에 비교될 만한 결과를 가져옴을 보였다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.8 no.5
• /
• pp.534-544
• /
• 1997

The permittivity distribution of a two-dimensional high-contrast object with large size, which leads to the global minimum of cost function, is reconstructed by iteratively using the hybrid algorithm of Levenberg-magquardt algorithm(LMA) plus Genetic Algorithm(GA). The scattered fields calculated in a cost function are expanded in angular spectral modes, of which only effective propagating modes are used. The definition of cost function based on the effective propagating modes enables us to formulate the minimum number of incident waves for the reconstruction of object. It is numerically shown that LMA has an advantage of fast convergence but can't reconstruct a high-contrast object with large size and GA can reconstruct a high-contrast object with large size but has an disadvantage of slow convergence, whereas an inverse scattering technique using the hybrid algorithm adopts only advantages of LMA and GA.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.12
• /
• pp.2556-2564
• /
• 2002

The design of airfoil had practiced by repeat tests in its first stage, though an airfoil has as been designed based on simulations according to techniques of computational fluid dynamics. Here, using of traditional optimization is unsuitable because a state of flux is hypersensitive to the shape of airfoil. Therefore the paper optimized the shape of airfoil in transonic region using a genetic algorithm (GA). Response surfaces are based on back propagation neural network (BPN) and regression model. Training data of BPN and regression model were obtained by computational fluid dynamic analysis using CFD-ACE, and each analysis has been designed by design of experiments.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.3
• /
• pp.89-97
• /
• 1997

A genetic algorithm (GA) is a stochastic direct search strategy that mimics the process of genetic evolution. The GA applied herein works on a population of structural designs at any one time, and uses a structured information exchange based on the principles of natural selection and wurvival of the fittest to recombine the most desirable features of the designs over a sequence of generations until the process converges to a "maximum fitness" design. Principles of genetics are adapted into a search procedure for structural optimization. The methods consist of three genetics operations mainly named selection, cross- over and mutation. In this study, a method of finding the optimum topology of truss/beam structure is pro- posed by using the GA. In order to use GA in the optimum topology problem, chromosomes to FEM elements are assigned, and a penalty function is used to include constraints into fitness function. The results show that the GA has the potential to be an effective tool for the optimal design of structures accounting for sizing, geometrical and topological variables.variables.

• Proceedings of the Korean Statistical Society Conference
• /
• 2000.11a
• /
• pp.173-179
• /
• 2000

Genetic algorithm(GA) is applied for detecting multiple outliers. GA is a heuristic optimization tool solving for near optimal solution. We compare the performance of GA and the other diagnostic measures commonly used for detecting outliers in regression model. The results show that GA seems to have better performance than the others for the detection of multiple outliers.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.5
• /
• pp.373-378
• /
• 2001

The optimization method based on an enhanced genetic algorithms is for multimodal function optimization in this paper. This method is consisted of two main steps. The first step is a global search step using the genetic algorithm(GA) and function assurance criterion(FAC). The belonging of an population to initial solution group is decided according to the FAC. The second step is to decide the similarity between individuals, and to research the optimum solutions by single point method in reconstructive search space. Four numerical examples are also presented in this papers to comparing with conventional methods.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.3
• /
• pp.289-295
• /
• 2000

The triangulation problem is to make triangles using the given points on the space. The Minimum Weight Triangulation(MWT) is the problem of finding a set of triangles with the minimum weight among possible set of the triangles. In this paper, a modified genetic algorithm(GA) based on an existing genetic algorithm and multispace smoothing technique is proposed. Through the computational results, we can find the tendency that the proposed GA finds good solutions though it needs longer time than the existing GA does as the problem size increases.