• Title/Summary/Keyword: Optimum selection

검색결과 735건 처리시간 0.025초

유전자 알고리즘에 의한 드릴싱 머신의 설계 최적화 연구 (The Optimization of Sizing and Topology Design for Drilling Machine by Genetic Algorithms)

  • 백운태;성활경
    • 한국정밀공학회지
    • /
    • 제14권12호
    • /
    • pp.24-29
    • /
    • 1997
  • Recently, Genetic Algorithm(GA), which is a stochastic direct search strategy that mimics the process of genetic evolution, is widely adapted into a search procedure for structural optimization. Contrast to traditional optimal design techniques which use design sensitivity analysis results, GA is very simple in their algorithms and there is no need of continuity of functions(or functionals) any more in GA. So, they can be easily applicable to wide area of design optimization problems. Also, owing to multi-point search procedure, they have higher porbability of convergence to global optimum compared to traditional techniques which take one-point search method. The methods consist of three genetics opera- tions named selection, crossover and mutation. In this study, a method of finding the omtimum size and topology of drilling machine is proposed by using the GA, For rapid converge to optimum, elitist survival model,roulette wheel selection with limited candidates, and multi-point shuffle cross-over method are adapted. And pseudo object function, which is the combined form of object function and penalty function, is used to include constraints into fitness function. GA shows good results of weight reducing effect and convergency in optimal design of drilling machine.

  • PDF

입체 트러스구조물의 최적설계를 위한 SA기법 (Simulated Annealing Algorithm for Optimum Design of Space Truss Structures)

  • 정제원;박효선
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 1999년도 봄 학술발표회 논문집
    • /
    • pp.102-109
    • /
    • 1999
  • Two phase simulated annealing algorithm is presented as a structural optimization technique and applied to minimum weight design of space trusses subjected to stress and displacement constraints under multiple loading conditions. Univariate searching algorithm is adopted for automatic selection of initial values of design variables for SA algorithm. The proper values of cooling factors and reasonable stopping criteria for optimum design of space truss structures are proposed to enhance the performance of optimization process. Optimum weights and design solutions are presented for two well-blown example structures and compared with those reported in the literature.

  • PDF

An Evolutionary Algorithm preventing Consanguineous Marriage

  • Woojin Oh;Oh, Se-Young
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2002년도 ICCAS
    • /
    • pp.110.2-110
    • /
    • 2002
  • Evolutionary Algorithm is the general method that can search the optimum value for the various problems. Evolutionary method consists of random selection, crossover, mutation, etc. Since the next generation is selected based on the fitness values, the crossover between chromosomes does not have any restrictions. Not only normal marriage but also consanguineous marriage will take place. In human world, consanguineous marriage was reported to cause various genetic defects, such as poor immunity about new diseases and new environment disaster, These problems translate into searching for the local optimum, not the global optimum. So, a new evolutionary algorithm is needed that prevents traps to...

  • PDF

자동설계 프로그램을 이용한 급속성형에 관한 연구 (A Study on the Rapid Prototyping using Automatic Design Program)

  • 이승수;김민주;전언찬
    • 한국공작기계학회논문집
    • /
    • 제11권5호
    • /
    • pp.15-22
    • /
    • 2002
  • A study is the selection of optimum forming condition for RP system. We develop the Automatic design program for machine element using visual LISP program in AutoCAD. Automatic design program reduces the required time for feedback between design and manufacturing of workpiece. Also we investigate the relationship between circularity of 3D solid model and circularity of rapid prototype using RP system and we will find optimum forming condition in RP system.

자동설계 프로그램을 이용한 급속성형에 관한 연구 (A Study on the Rapid Prototyping using Automatic Design Program)

  • 김세민;이승수;김민주;주만식;전언찬
    • 한국공작기계학회:학술대회논문집
    • /
    • 한국공작기계학회 2001년도 춘계학술대회 논문집(한국공작기계학회)
    • /
    • pp.365-370
    • /
    • 2001
  • This study is the selection of optimum forming condition for RP system using ADS. Program using ADS reduces the required time for feedback between design and manufacturing of workpiece. When we produce rapid prototype using RP system, we investigate the relationship between Facetres in system variable number of AutoCAD and circularity of rapid prototype, and we will find optimum forming condition in RP system.

  • PDF

미곡종합처리장(米穀綜合處理場)의 적정입지분석(適正立地分析) (The Analysis of Optimum Locations of Rice Processing Complex)

  • 장홍희;장동일;김동철
    • Journal of Biosystems Engineering
    • /
    • 제18권4호
    • /
    • pp.390-401
    • /
    • 1993
  • This study was conducted to analyze the optimum capacity of Rice Processing Complex (RPC) and to select the optimum location of RPC based on the analysis of rice production and its commercializing rate for each county of major area of paddy field nationally. The study results showed that 500 of RPC having a drying capacity of 3,000 tons of rice would be needed nationally based on the selection analysis.

  • PDF

진화 연산의 성능 개선을 위한 하이브리드 방법 (A Hybrid Method for Improvement of Evolutionary Computation)

  • 정진기;오세영
    • 한국지능시스템학회논문지
    • /
    • 제12권4호
    • /
    • pp.317-322
    • /
    • 2002
  • The major operations of Evolutionary Computation include crossover, mutation, competition and selection. Although selection does not create new individuals like crossover or mutation, a poor selection mechanism may lead to problems such as taking a long time to reach an optimal solution or even not finding it at all. In view of this, this paper proposes a hybrid Evolutionary Programming (EP) algorithm that exhibits a strong capability to move toward the global optimum even when stuck at a local minimum using a synergistic combination of the following three basic ideas. First, a "local selection" technique is used in conjunction with the normal tournament selection to help escape from a local minimum. Second, the mutation step has been improved with respect to the Fast Evolutionary Programming technique previously developed in our research group. Finally, the crossover and mutation operations of the Genetic Algorithm have been added as a parallel independent branch of the search operation of an EP to enhance search diversity.

Evaluation of Optimum Genetic Contribution Theory to Control Inbreeding While Maximizing Genetic Response

  • Oh, S.H.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • 제25권3호
    • /
    • pp.299-303
    • /
    • 2012
  • Inbreeding is the mating of relatives that produce progeny having more homozygous alleles than non-inbred animals. Inbreeding increases numbers of recessive alleles, which is often associated with decreased performance known as inbreeding depression. The magnitude of inbreeding depression depends on the level of inbreeding in the animal. Level of inbreeding is expressed by the inbreeding coefficient. One breeding goal in livestock is uniform productivity while maintaining acceptable inbreeding levels, especially keeping inbreeding less than 20%. However, in closed herds without the introduction of new genetic sources high levels of inbreeding over time are unavoidable. One method that increases selection response and minimizes inbreeding is selection of individuals by weighting estimated breeding values with average relationships among individuals. Optimum genetic contribution theory (OGC) uses relationships among individuals as weighting factors. The algorithm is as follows: i) Identify the individual having the best EBV; ii) Calculate average relationships ($\bar{r_j}$) between selected and candidates; iii) Select the individual having the best EBV adjusted for average relationships using the weighting factor k, $EBV^*=EBV_j(1-k\bar{{r}_j})$ Repeat process until the number of individuals selected equals number required. The objective of this study was to compare simulated results based on OGC selection under different conditions over 30 generations. Individuals (n = 110) were generated for the base population with pseudo random numbers of N~ (0, 3), ten were assumed male, and the remainder female. Each male was mated to ten females, and every female was assumed to have 5 progeny resulting in 500 individuals in the following generation. Results showed the OGC algorithm effectively controlled inbreeding and maintained consistent increases in selection response. Difference in breeding values between selection with OGC algorithm and by EBV only was 8%, however, rate of inbreeding was controlled by 47% after 20 generation. These results indicate that the OGC algorithm can be used effectively in long-term selection programs.