• 제목/요약/키워드: Genetic techniques

검색결과 749건 처리시간 0.026초

Genetic Programming 기반 플랜트/제어기 동시 최적화 방법 (Genetic Programming Based Plant/Controller Simultaneous Optimization Methodology)

  • 서기성
    • 전기학회논문지
    • /
    • 제65권12호
    • /
    • pp.2069-2074
    • /
    • 2016
  • This paper presents a methodology based on evolutionary optimization for simultaneously optimizing design parameters of controller and components of plant. Genetic programming(GP) based bond graph model generation is adopted to open-ended search for the plant. Also GP is applied to represent the controller with a unified method. The formulations of simultaneous plant-controller design optimization problem and the description of solution techniques based on bond graph are derived. A feasible solutions for a plant/controller design using the simultaneous optimization methodology is illustrated.

유전자 알고리즘을 이용한 무장 할당 (Weapon-Target Assignment Using Genetic Algorithm)

  • 권경엽;조중선
    • 한국지능시스템학회논문지
    • /
    • 제13권5호
    • /
    • pp.539-544
    • /
    • 2003
  • 본 논문에서는 유전자 알고리즘을 이용한 무장 할당 문제를 제안하였다. 무장 할당이란 적의 공격으로부터 방어대상물의 손상을 최소화하거나 적의 공격물 또는 표적의 격추 확률이 최대가 되도록 표적에 대해 방어무기의 적절한 할당을 목적으로 하는 최적화 문제로서, 본 논문에서는 무장 할당 문제에 근 최적화의 강점을 가진 유전자 알고리즘을 적용하였다. 무장 할당 문제에 적합한 유전자 알고리즘 형태와 파라메타를 선정하는 방법을 제시하였고, 시뮬레이션을 통해서 기존의 전형적인 최적화 기법과의 성능 비교를 수행한 결과, 제안된 방법이 우수함을 입증하였다.

Cost optimization of high strength concretes by soft computing techniques

  • Ozbay, Erdogan;Oztas, Ahmet;Baykasoglu, Adil
    • Computers and Concrete
    • /
    • 제7권3호
    • /
    • pp.221-237
    • /
    • 2010
  • In this study 72 different high strength concrete (HSC) mixes were produced according to the Taguchi design of experiment method. The specimens were divided into four groups based on the range of their compressive strengths 40-60, 60-80, 80-100 and 100-125 MPa. Each group included 18 different concrete mixes. The slump and air-content values of each mix were measured at the production time. The compressive strength, splitting tensile strength and water absorption properties were obtained at 28 days. Using this data the Genetic Programming technique was used to construct models to predict mechanical properties of HSC based on its constituients. These models, together with the cost data, were then used with a Genetic Algorithm to obtain an HSC mix that has minimum cost and at the same time meets all the strength and workability requirements. The paper describes details of the experimental results, model development, and optimization results.

구조물 최적설계를 위한 메타휴리스틱 알고리즘의 비교 연구 (An Comparative Study of Metaheuristic Algorithms for the Optimum Design of Structures)

  • 류연선;조현만
    • 수산해양교육연구
    • /
    • 제29권2호
    • /
    • pp.544-551
    • /
    • 2017
  • Metaheuristic algorithms are efficient techniques for a class of mathematical optimization problems without having to deeply adapt to the inherent nature of each problem. They are very useful for structural design optimization in which the cost of gradient computation can be very expensive. Among them, the characteristics of simulated annealing and genetic algorithms are briefly discussed. In Metropolis genetic algorithm, favorable features of Metropolis criterion in simulated annealing are incorporated in the reproduction operations of simple genetic algorithm. Numerical examples of structural design optimization are presented. The example structures are truss, breakwater and steel box girder bridge. From the theoretical evaluation and numerical experience, performance and applicability of metaheuristic algorithms for structural design optimization are discussed.

유사성 계수를 이용한 군집화 문제에서 유전자와 국부 최적화 알고리듬의 적용 (Application of Genetic and Local Optimization Algorithms for Object Clustering Problem with Similarity Coefficients)

  • 임동순;오현승
    • 대한산업공학회지
    • /
    • 제29권1호
    • /
    • pp.90-99
    • /
    • 2003
  • Object clustering, which makes classification for a set of objects into a number of groups such that objects included in a group have similar characteristic and objects in different groups have dissimilar characteristic each other, has been exploited in diverse area such as information retrieval, data mining, group technology, etc. In this study, an object-clustering problem with similarity coefficients between objects is considered. At first, an evaluation function for the optimization problem is defined. Then, a genetic algorithm and local optimization technique based on heuristic method are proposed and used in order to obtain near optimal solutions. Solutions from the genetic algorithm are improved by local optimization techniques based on object relocation and cluster merging. Throughout extensive experiments, the validity and effectiveness of the proposed algorithms are tested.

GA를 적용한 히스토그램 평활화 기법에 의한 이미지 대비 향상 (No Image Contrast Enhancement using Histogram Equalization with Genetic Algorithm)

  • 정진욱;엄대연;강훈
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2004년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.111-113
    • /
    • 2004
  • Histogram Equalization is the most popular algorithm for contrast enhancement due to its effectiveness and simplicity. In this paper, We propose the advanced contrast enhancement method using genetic algorithm. We propose a novel objective criterion for enhancement, and attempt finding the best image according to the respective criterion. Due to the high complexity of the enhancement criterion proposed, we employ a Genetic Algorithm. We compared our method with other enhancement techniques, like Global Histogram Equalization and Partially Overlapped Sub-Block Histogram Equalization(POSHE).

  • PDF

Genetic Factors Affecting Insecticidal Crystal Protein Synthesis in Bacillus thuringiensis

  • Park, Hyung-Woo;Brian A. Federici
    • International Journal of Industrial Entomology and Biomaterials
    • /
    • 제1권1호
    • /
    • pp.1-7
    • /
    • 2000
  • Early studies of the molecular biology of Bacillus thuringeinsis suggested that genetic manipulation of this species could create combinations of genes more useful than those known to occur in natural isolates. Breakthroughs that made these manipulations possible include the cloning of many genes encoding endotoxins, the development of transformation vectors, and various PCR techniques. This paper reviews several genetic factors such as promoters, a 5'mRNA stabilizing sequence, 3'transcription termination sequences, and helper proteins that have been used to enhance crystal protein synthesis, and shows how these genetic elements can be manipulated with new molecular tools to develop more efficacious strains of B. thuringiensis.

  • PDF

Role of gene therapy in treatment of cancer for craniofacial regeneration-current molecular strategies, future perspectives, and challenges: a narrative review

  • Himanshu Singh
    • Journal of Yeungnam Medical Science
    • /
    • 제41권1호
    • /
    • pp.13-21
    • /
    • 2024
  • Gene therapy involves the introduction of foreign genetic material into host tissue to alter the expression of genetic products. Gene therapy represents an opportunity to alter the course of various diseases. Hence, genetic products utilizing safe and reliable vectors with improved biotechnology will play a critical role in the treatment of various diseases in the future. This review summarizes various important vectors for gene therapy along with modern techniques for potential craniofacial regeneration using gene therapy. This review also explains current molecular approaches for the management and treatment of cancer using gene therapy. The existing literature was searched to find studies related to gene therapy and its role in craniofacial regeneration and cancer treatment. Various databases such as PubMed, Science Direct, Scopus, Web of Science, and Google Scholar were searched for English language articles using the keywords "gene therapy," "gene therapy in present scenario," "gene therapy in cancer," "gene therapy and vector," "gene therapy in diseases," and "gene therapy and molecular strategies."

An Accelerated Genetic Algorithm for the Vehicle Routing Problem

  • Shin, Hae-Woong;Kang, Maing-Kyu
    • 한국경영과학회지
    • /
    • 제21권1호
    • /
    • pp.101-114
    • /
    • 1996
  • This study suggests an accelerated genetic algorithm for the vehicle routing problem (AGAVRP). This algorithm treats both the single-visit and the multiple-visit models. AGAVRP is accelerated by the OR techniques at the various stages of the algorithm. In order to improve the convergence of AGAVRP, a robust set of parameters is determined by the experimental design approach. The relative performance of AGAVRP is comparable to the other known algorithms. The advantage of the proposed algorithm is flexibility and better convergence.

  • PDF