• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.1
• /
• pp.21-28
• /
• 2005

This paper proposes a new method for accelerating the search speed of genetic algorithms by taking derivative evaluation and conditional random selection into account in their evolution process. Derivative evaluation makes genetic algorithms focus on the individuals whose fitness is rapidly increased. This accelerates the search speed of genetic algorithms by enhancing exploitation like steepest descent methods but also increases the possibility of a premature convergence that means most individuals after a few generations approach to local optima. On the other hand, derivative evaluation under a premature convergence helps genetic algorithms escape the local optima by enhancing exploration. If GAs fall into a premature convergence, random selection is used in order to help escaping local optimum, but its effects are not large. We experimented our method with one combinatorial problem and five complex function optimization problems. Experimental results showed that our method was superior to the simple genetic algorithm especially when the search space is large.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.4
• /
• pp.439-447
• /
• 2003

This paper proposes a proportional-integral-derivative (PID) evaluation method for enhancing performance of genetic algorithms. In PID evaluation, the fitness of individuals is evaluated by not only the fitness derived from an evaluation function, but also the parents fitness of each individual and the minimum and maximum fitness from initial generation to previous generation. This evaluation decreases the probability that the genetic algorithms fall into a premature convergence phenomenon and results in enhancing the performance of genetic algorithms. We experimented our evaluation method with typical numerical function optimization problems. It was found from extensive experiments that out evaluation method can increase the performance of genetic algorithms greatly. This evaluation method can be easily applied to the other types of genetic algorithms for improving their performance.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.4
• /
• pp.310-315
• /
• 2005

This paper proposes a fast optimization method by combining queen-bee evolution and derivative evaluation in genetic algorithms. These two operations make it possible for genetic algorithms to focus on highly fitted individuals and rapidly evolved individuals, respectively. Even though the two operations can also increase the probability that genetic algorithms fall into premature convergence phenomenon, that can be controlled by strong mutation rates. That is, the two operations and the strong mutation strengthen exploitation and exploration of the genetic algorithms, respectively. As a result, the genetic algorithm employing queen-bee evolution and derivative evaluation finds optimum solutions more quickly than those employing one of them. This was proved by experiments with one pattern matching problem and two function optimization problems.

• Journal of Animal Science and Technology
• /
• v.65 no.6
• /
• pp.1180-1193
• /
• 2023

Most carcass and meat quality traits are moderate to highly heritable, indicating that they can be improved through selection. Genetic evaluation for these types of traits is performed using performance data obtained from commercial and progeny testing evaluation. The performance data from commercial farms are available in large volume, however, some drawbacks have been observed. The drawback of the commercial data is mainly due to sorting of animals based on live weight prior to slaughter, and this could lead to bias in the genetic evaluation of later measured traits such as carcass traits. The current study has two components to address the drawback of the commercial data. The first component of the study aimed to estimate genetic parameters for carcass and meat quality traits in Korean Hanwoo cattle using a large sample size of industry-based carcass performance records (n = 469,002). The second component of the study aimed to describe the impact of sorting animals into different contemporary groups based on an early measured trait and then examine the effect on the genetic evaluation of subsequently measured traits. To demonstrate our objectives, we used real performance data to estimate genetic parameters and simulated data was used to assess the bias in genetic evaluation. The results of our first study showed that commercial data obtained from slaughterhouses is a potential source of carcass performance data and useful for genetic evaluation of carcass traits to improve beef cattle performance. However, we observed some harvesting effect which leads to bias in genetic evaluation of carcass traits. This is mainly due to the selection of animal based on their body weight before arrival to slaughterhouse. Overall, the non-random allocation of animals into a contemporary group leads to a biased estimated breeding value in genetic evaluation, the severity of which increases when the evaluation traits are highly correlated.

• Plant Resources
• /
• v.1 no.1
• /
• pp.26-32
• /
• 1998

This paper describes the variations in eight agronomic traits in three unadapted local landraces and an inbred cultivar of corn. To compare the agronomic traits in field evaluation with molecular marker evaluation the genotypes of the plant introduction were also checked by 4 microsatellite-SSR loci. The variations of the eight agronomic traits were higher in the local landrades than in the inbred line. which was substantiated by the high genetic variation in the landrades with microsatellite-SSR loci. The level of genetic variation was also different between landraces. Since the genetic evaluation can be easily quantified by the analysis of microsatellite-SSR loci. the threshold level of genetic homogeneity in the population for parental lines in breeding program can be determined and the effort of maintaining the landrace population would be alleviated. As an example in our analysis. the entry from Whachon should not need the same number of selfing generations as the other two landraces to get the level of inbred state. Since this line showed lowest intra-genetic variation within the population.

• Journal of Industrial Technology
• /
• v.20 no.B
• /
• pp.27-34
• /
• 2000

The definition of flatness is given by ISO, ANSI, KS, etc. but those standards don't mention about the specific methods for the flatness. So various solution models that are based on the Minimum Zone Method have been proposed as an optimization problem for the minimax curve fitting. But it has been rare to compare some optimization algorithms to make a guideline for choosing better algorithms in this field. Hence this paper examined and compared Genetic Algorithm and Simplex Method to the evaluation of flatness. As a result, Genetic Algorithm gave the better or equal flatness than Simplex Method but it has the inefficiency caused from the large number of iteration. Therefore, in the future, another researches about alternative algorithms including Hybrid Genetic Algorithm should be achieved to improve the efficiency of Genetic Algorithm for the evaluation of flatness.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2002.10a
• /
• pp.40-44
• /
• 2002

선박 설계시 최적화에 있어 종래에는 Random search Parametric study, Hook&Jeeves Method등이 사용되어져 왔으나 1960년대 Genetic algorithm이 소개되고 꾸준히 발전함과 함께 선박 설계에서도 Genetic algorithm이 사용되기 시작하였다. 본 논문에서는 이러한 Genetic algorithm 중 Simple Genetic algorithm(SGA), Micro Genetic algorithm(MGA), Threshold Genetic algorithm(TGA), Hybrid Genetic algorithm(HGA)을 선박 설계에 적용하여 그 성능을 비교 검토해 보았다. MGA는 계산 부담을 줄이기 위해 작은 개체로 효율적인 탐색을 하며, TGA는 local optimum에서 쉽게 벗어나게 할 수 있는 특징이 있다. HGA는 Hook&Jeeves Method를 Genetic algorithm과 병합되어 있다. 이를 바탕으로 본 논문에서 망간단괴 수송선의 경제성을 평가한다. 평가 방법은 연간 300만톤을 생산한다고 가정하여 연간 운송 용적을 동호제약으로 해서 최적화를 한 뒤, 이를 이용하여 몇가지 Case로 나누어서 초기 자본, 연간 비용, 20년간 총 비용을 계산하여 가장 경제적인 선박을 선택한다.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.8
• /
• pp.360-367
• /
• 2002

In this paper, genetic algorithm based adaptive image enhancement filtering scheme is proposed and Implemented on FPGA board. Conventional filtering methods require a priori noise information for image enhancement. In general, if a priori information of noise is not available, heuristic intuition or time consuming recursive calculations are required for image enhancement. Contrary to the conventional filtering methods, the proposed filter system can find optimal combination of filters as well as their sequent order and parameter values adaptively to unknown noise types using structured genetic algorithms. The proposed image enhancement filter system is mainly composed of two blocks. The first block consists of genetic algorithm part and fitness evaluation part. And the second block consists of four types of filters. The first block (genetic algorithms and fitness evaluation blocks) is implemented on host computer using C code, and the second block is implemented on re-configurabe FPGA board. For gray scale control, smoothing and deblurring, four types of filters(median filter, histogram equalization filter, local enhancement filter, and 2D FIR filter) are implemented on FPGA. For evaluation, three types of noises are used and experimental results show that the Proposed scheme can generate optimal set of filters adaptively without a pioi noise information.

• Proceedings of the Korea Environmental Mutagen Society Conference
• /
• 2002.11a
• /
• pp.196-196
• /
• 2002

• Proceedings of the Korean Society of Toxicology Conference
• /
• 2002.11b
• /
• pp.196-196
• /
• 2002

p16INK4a tumor suppressor gene transfer in the non-small cell lung cancer cells by transduction of recombinant adenovirus (Ad5CMV-p16) resulted in significant inhibition of cancer cell growth (Anticancer Res., 1998, 18:3257-3261). As a safety concern, we have investigated gene and protein expression after transduction of adenoviral vector (Ad5CMV-p16) in human non-small cell lung cancer (A549) cells by using microarray and 2D gel electrophoresis/ MALDI-TOF.(omitted)