• Title/Summary/Keyword: genetic process

Search Result 1,501, Processing Time 0.037 seconds

Review on breeding, tissue culture and genetic transformation systems in Cymbidium (심비디움 육종, 조직배양 및 형질전환 연구동향에 관한 고찰)

  • Lee, Yu-Mi;Kim, Mi-Seon;Lee, Sang-Il;Kim, Jong-Bo
    • Journal of Plant Biotechnology
    • /
    • v.37 no.4
    • /
    • pp.357-369
    • /
    • 2010
  • Cymbidium is horticulturally important and has been one of the most commercially successful orchid plants as well as cut flowers around the world including Korea. Up to now, a huge number of elite Cymbidium cultivars have been released on the commercial market via cross-hybridization, mutation and polyploidization breeding techniques. To investigate on breeding system in Cymbidium, we inquired the brief history and techniques of breeding and the current status on Cymbidium breeding in Korea. Also, the general propagation process of elite Cymbidium lines via tissue culture should be presented. However, the slow process of conventional breeding and the lack of useful genes in Cymbidium species delays the introduction of new cultivars to the commercial market. To solve these limitations, efficient regeneration and genetic transformation systems should be established in the improvement of Cymbidium breeding program. During the last several decades, some progress has been made in tissue culture and genetic transformation in Cymbidium species. We review the recent status of tissue culture and genetic transformation systems in Cymbidium plants.

A Study of Process Parameters Optimization Using Genetic Algorithm for Nd:YAG Laser Welding of AA5182 Aluminum Alloy Sheet (AA5182 알루미늄 판재의 Nd:YAG 레이저 용접에서 유전 알고리즘을 이용한 공정변수 최적화에 대한 연구)

  • Park, Young-Whan;Rhee, Se-Hun;Park, Hyun-Sung
    • Proceedings of the KSME Conference
    • /
    • 2007.05a
    • /
    • pp.1322-1327
    • /
    • 2007
  • Many automotive companies have tried to apply the aluminum alloy sheet to car body because reducing the car weight can improve the fuel efficiency of vehicle. In order to do that, sheet materials require of weldablity, formability, productivity and so on. Aluminum alloy was not easy to join these metals due to its material properties. Thus, the laser is good heat source for aluminum alloy welding because of its high heat intensity. However, the welding quality was not good by porosity, underfill, and magnesium loss in welded metal for AA5182 aluminum alloy. In this study, Nd:YAG laser welding of AA 5182 with filler wire AA 5356 was carried out to overcome this problem. The weldability of AA5182 laser welding with AA5356 filler wire was investigated in terms of tensile strength and Erichsen ratio. For full penetration, mechanical properties were improved by filler wire. In order to optimize the process parameters, model to estimate tensile strength by artificial neural network was developed and fitness function was defined in consideration of weldability and productivity. Genetic algorithm was used to search the optimal point of laser power, welding speed, and wire feed rate.

  • PDF

Dual Response Surface Optimization using Multiple Objective Genetic Algorithms (다목적 유전 알고리즘을 이용한 쌍대반응표면최적화)

  • Lee, Dong-Hee;Kim, Bo-Ra;Yang, Jin-Kyung;Oh, Seon-Hye
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.43 no.3
    • /
    • pp.164-175
    • /
    • 2017
  • Dual response surface optimization (DRSO) attempts to optimize mean and variability of a process response variable using a response surface methodology. In general, mean and variability of the response variable are often in conflict. In such a case, the process engineer need to understand the tradeoffs between the mean and variability in order to obtain a satisfactory solution. Recently, a Posterior preference articulation approach to DRSO (P-DRSO) has been proposed. P-DRSO generates a number of non-dominated solutions and allows the process engineer to select the most preferred solution. By observing the non-dominated solutions, the DM can explore and better understand the trade-offs between the mean and variability. However, the non-dominated solutions generated by the existing P-DRSO is often incomprehensive and unevenly distributed which limits the practicability of the method. In this regard, we propose a modified P-DRSO using multiple objective genetic algorithms. The proposed method has an advantage in that it generates comprehensive and evenly distributed non-dominated solutions.

A Genetic Algorithm for Scheduling of Trucks with Inbound and Outbound Process in Multi-Door Cross Docking Terminals (다수의 도어를 갖는 크로스도킹 터미널에서 입고와 출고를 병행하는 트럭일정계획을 위한 유전알고리즘)

  • Joo, Cheol-Min;Kim, Byung-Soo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.37 no.3
    • /
    • pp.248-257
    • /
    • 2011
  • Cross docking is a logistics management concept in which items delivered to a terminal by inbound trucks are immediately sorted out, routed and loaded into outbound trucks for delivery to customers. Two main advantages by introducing a cross docking terminal are to consolidate multiple smaller shipment into full truck load and remove storage and order picking processes to save up logistics costs related to warehousing and transportation costs. This research considers the scheduling problem of trucks in the cross docking terminals with multi-door in an inbound and outbound dock, respectively. The trucks sequentially deal with the storage process at the one of inbound doors and the shipping process at the one of the outbound doors. A mathematical model for an optimal solution is derived, and genetic algorithms with two different chromosome representations are proposed. To verify performance of the GA algorithms, we compare the solutions of GAs with the optimal solutions and the best solution using randomly generated several examples.

A Study on Machine Learning Algorithms based on Embedded Processors Using Genetic Algorithm (유전 알고리즘을 이용한 임베디드 프로세서 기반의 머신러닝 알고리즘에 관한 연구)

  • So-Haeng Lee;Gyeong-Hyu Seok
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.19 no.2
    • /
    • pp.417-426
    • /
    • 2024
  • In general, the implementation of machine learning requires prior knowledge and experience with deep learning models, and substantial computational resources and time are necessary for data processing. As a result, machine learning encounters several limitations when deployed on embedded processors. To address these challenges, this paper introduces a novel approach where a genetic algorithm is applied to the convolution operation within the machine learning process, specifically for performing a selective convolution operation.In the selective convolution operation, the convolution is executed exclusively on pixels identified by a genetic algorithm. This method selects and computes pixels based on a ratio determined by the genetic algorithm, effectively reducing the computational workload by the specified ratio. The paper thoroughly explores the integration of genetic algorithms into machine learning computations, monitoring the fitness of each generation to ascertain if it reaches the target value. This approach is then compared with the computational requirements of existing methods.The learning process involves iteratively training generations to ensure that the fitness adequately converges.

Flux Optimization Using Genetic Algorithms in Membrane Bioreactor

  • Kim Jung-Mo;Park Chul-Hwan;Kim Seung-Wook;Kim Sang-Yong
    • Journal of Microbiology and Biotechnology
    • /
    • v.16 no.6
    • /
    • pp.863-869
    • /
    • 2006
  • The behavior of submerged membrane bioreactor (SMBR) filtration systems utilizing rapid air backpulsing as a cleaning technique to remove reversible foulants was investigated using a genetic algorithm (GA). A customized genetic algorithm with suitable genetic operators was used to generate optimal time profiles. From experiments utilizing short and long periods of forward and reverse filtration, various experimental process parameters were determined. The GA indicated that the optimal values for the net flux fell between 263-270 LMH when the forward filtration time ($t_f$) was 30-37 s and the backward filtration time ($t_b$) was 0.19-0.27 s. The experimental data confirmed the optimal backpulse duration and frequency that maximized the net flux, which represented a four-fold improvement in 24-h backpulsing experiments compared with the absence of backpulsing. Consequently, the identification of a region of feasible parameters and nonlinear flux optimization were both successfully performed by the genetic algorithm, meaning the genetic algorithm-based optimization proved to be useful for solving SMBR flux optimization problems.

Comparison of Population Genetic Structure of Two Seashore-Dwelling Animal Species, Periwinkle Littorina brevicula and Acorn Barnacle Fistulobalanus albicostatus from Korea

  • Kim, Yuhyun;Lee, Jeounghee;Kim, Hanna;Jung, Jongwoo
    • Animal Systematics, Evolution and Diversity
    • /
    • v.32 no.2
    • /
    • pp.105-111
    • /
    • 2016
  • The genetic structure of marine animals that inhabit the seashore is affected by numerous factors. Of these, gene flow and natural selection during recruitment have strong influences on the genetic structure of seashore-dwelling species that have larval periods. Relative contributions of these two factors to the genetic structure of marine species would be determined mainly by the duration of larval stage. The relationship between larval period and genetic structure of population has been rarely studied in Korea. In this study, genetic variations of cytochrome oxidase subunit I (COI) were analyzed in two dominant species on rocky shore habitats in the Korean peninsula: periwinkle Littorina brevicula and acorn barnacle Fistulobalanus albicostatus. Both species are not strongly structured and may have experienced recent population expansion. Unlike periwinkle, however, barnacle populations have considerable genetic variation, and show a bimodal pattern of mismatch distribution. These results suggest that barnacle populations are more affected by local adaptation rather than gene flow via larval migration. The bimodal patterns of barnacle populations observed in mismatch distribution plots imply that they may have experienced secondary contact. Further studies on seashore-dwelling species are expected to be useful in understanding the evolution of the coastal ecosystem around Korean waters.

Fast and Scalable Path Re-routing Algorithm Using A Genetic Algorithm (유전자 알고리즘을 이용한 확장성 있고 빠른 경로 재탐색 알고리즘)

  • Lee, Jung-Kyu;Kim, Seon-Ho;Yang, Ji-Hoon
    • The KIPS Transactions:PartB
    • /
    • v.18B no.3
    • /
    • pp.157-164
    • /
    • 2011
  • This paper presents a fast and scalable re-routing algorithm that adapts to dynamically changing networks. The proposed algorithm integrates Dijkstra's shortest path algorithm with the genetic algorithm. Dijkstra's algorithm is used to define the predecessor array that facilitates the initialization process of the genetic algorithm. After that, the genetic algorithm re-searches the optimal path through appropriate genetic operators under dynamic traffic situations. Experimental results demonstrate that the proposed algorithm produces routes with less traveling time and computational overhead than pure genetic algorithm-based approaches as well as the standard Dijkstra's algorithm for large-scale networks.

Response Surface Modeling by Genetic Programming II: Search for Optimal Polynomials (유전적 프로그래밍을 이용한 응답면의 모델링 II: 최적의 다항식 생성)

  • Rhee, Wook;Kim, Nam-Joon
    • Journal of Information Technology Application
    • /
    • v.3 no.3
    • /
    • pp.25-40
    • /
    • 2001
  • This paper deals with the problem of generating optimal polynomials using Genetic Programming(GP). The polynomial should approximate nonlinear response surfaces. Also, there should be a consideration regarding the size of the polynomial, It is not desirable if the polynomial is too large. To build small or medium size of polynomials that enable to model nonlinear response surfaces, we use the low order Tailor series in the function set of GP, and put the constrain on generating GP tree during the evolving process in order to prevent GP trees from becoming too large size of polynomials. Also, GAGPT(Group of Additive Genetic Programming Trees) is adopted to help achieving such purpose. Two examples are given to demonstrate our method.

  • PDF