• 산업경영시스템학회지
• /
• 제20권41호
• /
• pp.1-14
• /
• 1997

This study proposes a genetic algorithm using Pr(equation omitted)fer number for the traveling salesman problem(PNGATSP). Nearest neighbor nodes are mixed with randomly selected nodes at the stage of generating initial solutions. Proposed PNGATSP adopts a few ideas which are different from traditional genetic algorithms. For instance, an exponential fitness function and elitism are used and Pr(equation omitted)fer number is used for encoding TSP. Genetic operators are selected by experiments, which make a good solution among four combinations of conventional genetic operators and new genetic operators. For respective combinations, robust set of parameters is determined by the experimental designing approach. The feature of Pr(equation omitted)fer number code for TSP and the search power of GA using Pr(equation omitted)fer number is analysed. The best is a combination of OX(order crossover) and swap, which is superior to the other experimented combinations of genetic operators by 1.0%∼12.8% deviation.

• 한국지반공학회:학술대회논문집
• /
• 한국지반공학회 1999년도 가을 학술발표회 논문집
• /
• pp.415-422
• /
• 1999

This paper describes a new optimum design approach for piled raft foundations using the genetic algorithm. The objective function considered is the cost-based total weight of raft and piles. The genetic algorithm is a search or optimization technique based on nature selection. Successive generation evolves more fit individuals on the basis of the Darwinism survival of the fittest. In formulating the genetic algorithm-based optimum design procedure, the analysis of piled raft foundations is peformed based on the 'hybrid'approach developed by Clancy(1993), and also the simple genetic algorithm proposed by the Goldberg(1989) is used. To evaluate a validity of the optimum design procedure proposed based on the genetic algorithm, comparisons regarding optimal pile placement for minimizing differential settlements by Kim et at.(1999) are made. In addition using proposed design procedure, design examples are presented.

• Journal of Life Science
• /
• 제12권1호
• /
• pp.27-32
• /
• 2002

Enzyme electrophoresis was used to estimate genetic diversity and population structure of maize, Zea mays L. (Graminales) in Korea. In nine populations, fourteen of the 24 loci (58.3 %) showed detectable polymorphism. Genetic diversity (0.205) was higher than average values for species with similar life history traits. Although our data are relatively small and the landraces not direct ancestors of cultivar, apparently the domestication process has eroded the levels of genetic variation of maize. The recent cultivars were found to have fewer alleles per locus (1.42 vs. 1.56), fewer alleles per polymorphic locus (2.27 vs. 2.33), lower percent polymorphic locus (33.3% vs. 41.7%), and lower diversity (0.159 vs. 0.185) than landraces. These genetic diversity parameters indicated that the cultivar populations were genetically depauperate relative to landlaces. The GST value of nine populations was 0.239. Nearly 76% of the total genetic diversity in Zea mays was apportioned within populations. The indirect estimate of gene new based on mean GST was moderate (Nm=0.80).

• 한국작물학회:학술대회논문집
• /
• 한국작물학회 2005년도 춘계학술발표회 요지
• /
• pp.234-235
• /
• 2005

• 한국약용작물학회:학술대회논문집
• /
• 한국약용작물학회 2008년도 추계학술발표회
• /
• pp.259-260
• /
• 2008

• 한국약용작물학회:학술대회논문집
• /
• 한국약용작물학회 2011년도 추계학술발표회
• /
• pp.82-83
• /
• 2011

• 한국해양공학회지
• /
• 제17권6호
• /
• pp.53-57
• /
• 2003

Optimum design of most structural system requires that design variables are regarded as discrete quantities. This paper presents the use of Genetic Algorithm for determining the optimum design for truss with discrete variables. Genetic Algorithm are know as heuristic search algorithms, and are effective global search methods for discrete optimization. In this paper, Elitism and the method of conferring penalty parameters in the design variables, in order to achieve improved fitness in the reproduction process, is used in the Genetic Algorithm. A 10-Bar plane truss and a 25-Bar space truss are used for discrete optimization. These structures are designed for stress and displacement constraints, but buckling is not considered. In particular, we obtain continuous solution using Genetic Algorithms for a 10-bar truss, compared with other results. The effectiveness of Genetic Algorithms for global optimization is demonstrated through two truss examples.

• 대한한의학회지
• /
• 제27권2호
• /
• pp.225-231
• /
• 2006

Objectives : This study was performed to determine if unknown species of antler samples could be identified by genetic distance methods. Methods : The DNAs of 4 antler samples were extracted, amplified by PCR, and sequenced. The DNAs of antlers were identified by genetic distance. Genetic distance method was made using MEGA software (Molecular Evolutionary Genetics Analysis, 3.1). Results : By genetic distance methods, all 4 antler samples were closest to Cervus elaphus nelsoni among Cervus species. Conclusion : These results suggest that genetic distance methods might be used as a tool for the identification of Cervus species.

• 한국경영과학회지
• /
• 제26권2호
• /
• pp.59-68
• /
• 2001

The job shop scheduling problem is not only NP-hard, but is one of the well known hardest combinatorial optimization problems. The goal of this research is to develop an efficient scheduling method based on hybrid genetic algorithm to address job shop scheduling problem. In this scheduling method, generating method of initial population, new genetic operator, selection method are developed. The scheduling method based on genetic algorithm are tested on standard benchmark job shop scheduling problem. The results were compared with another genetic algorithm0-based scheduling method. Compared to traditional genetic, algorithm, the proposed approach yields significant improvement at a solution.

• 한국컴퓨터산업학회논문지
• /
• 제6권5호
• /
• pp.813-820
• /
• 2005

대체공정을 고려한 Job Shop 일정계획을 수립하기 위한 유전알고리즘을 개발하기 위하여 다음과 같이 유전알고리즘 효율분석을 실시하였다. 첫째, 대체공정을 고려한 job shop 일정계획을 수립하기 위한 유전 알고리즘을 제시하고 둘째, 전통적인 job shop 일정계획에 대한 벤치마크 문제에 대해 유전 알고리즘의 타당성을 확인하고 셋째, Park[3] 문제에 대해 유전알고리즘과 작업배정규칙을 적용한 결과를 비교하였다.