• Title/Summary/Keyword: Genetic Representation Method

Search Result 68, Processing Time 0.03 seconds

A Study on the Timetabling by Evolution Programs (진화 프로그램을 이용한 강의시간표 작성에 관한 연구)

  • 박유석;김용범;김병재;오충환;김복만
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.19 no.38
    • /
    • pp.43-50
    • /
    • 1996
  • Evolution Programs, a form of Genetic Algorithms transformed from chromosome representation, are applied to the Timetabling of University which is one of the NP-hard problems. At the step of algorithms application, each class is established to be a specific category in feasible solution space. At. the same time, the exiting gene used in chromosome expression of Evolution Programs is modified to satisfy constraints effectively by transformation of gene which has multi-information. The new crossover method for fester operation in the Recombination attempted.. Roulette wheel selection and tournament selection are prepared.

  • PDF

Short-term Operation Scheduling of Cogeneration Systems Using Genetic Algorithm (열병합발전시스템에서 유전알고리즘을 적용한 단기운전계획 수립)

  • Park, Seong-Hun;Jung, Chang-Ho;Lee, Jong-Beom
    • Journal of Energy Engineering
    • /
    • v.6 no.1
    • /
    • pp.11-18
    • /
    • 1997
  • This paper describes a daily operation scheduling of cogeneration systems using Genetic Algorithm. The simulation was performed in the case of bottoming cycle. The efficiency of cogeneration system which has nonlinear characteristic is obtained by the least square method based on the real data of industrial cogeneration system. In this paper, Genetic Algorithm is coded as a vector of floating point representation which can reduce computation time and obtain high precision The simulated results show that the genetic algorithm can be efficiently applied to establish the operation scheduling.

  • PDF

A Facility Layout Planning Method in Cellular Manufacturing Environment Using Genetic Algorithm (유전 알고리즘을 이용한 셀 배치방법에 관한 연구)

  • 정승환;강무진
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2000.11a
    • /
    • pp.334-338
    • /
    • 2000
  • One of the major drawbacks of the existing facility layout methods is that most of them were developed based on pre-defined cost functions, and therefore fail to cope with the dynamic aspects of modern manufacturing systems. Another drawback is that due to the poor representation capability of the block diagrams, they are not able to convey the sufficient information needed by facility designers. In this paper, a system for solving facility layout problem considering these matters in cellular manufacturing environment is proposed and implemented using GA approach with embedded simulation module and virtual reality technologies.

  • PDF

Development of an Apple F1 Segregating Population Genetic Linkage Map Using Genotyping-By-Sequencing

  • Ban, Seung Hyun;Choi, Cheol
    • Plant Breeding and Biotechnology
    • /
    • v.6 no.4
    • /
    • pp.434-443
    • /
    • 2018
  • Genotyping-by-sequencing (GBS) has been used as a viable single nucleotide polymorphism (SNP) validation method that provides reduced representation sequencing by using restriction endonucleases. Although GBS makes it possible to perform marker discovery and genotyping simultaneously with reasonable costs and a simple molecular biology workflow, the standard TASSEL-GBS pipeline was designed for homozygous groups, and genotyping of heterozygous groups is more complicated. To addresses this problem, we developed a GBS pipeline for heterozygous groups that called KNU-GBS pipeline, specifically for apple (Malus domestica). Using KNU-GBS pipeline, we constructed a genetic linkage map consisting of 1,053 SNP markers distributed over 17 linkage groups encompassing a total of 1350.1 cM. The novel GBS pipeline for heterozygous groups will be useful for marker-assisted breeding programs, and diverse heterozygous genome analyses.

DNA Coding Method for Time Series Prediction (시계열 예측을 위한 DNA 코딩 방법)

  • 이기열;선상준;이동욱;심귀보
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.280-280
    • /
    • 2000
  • In this paper, we propose a method of constructing equation using bio-inspired emergent and evolutionary concepts. This method is algorithm that is based on the characteristics of the biological DNA and growth of plants. Here is. we propose a constructing method to make a DNA coding method for production rule of L-system. L-system is based on so-called the parallel rewriting mechanism. The DNA coding method has no limitation in expressing the production rule of L-system. Evolutionary algorithms motivated by Darwinian natural selection are population based searching methods and the high performance of which is highly dependent on the representation of solution space. In order to verify the effectiveness of our scheme, we apply it to one step ahead prediction of Mackey-Glass time series.

  • PDF

Train Booking Agent with Adaptive Sentence Generation Using Interactive Genetic Programming (대화형 유전 프로그래밍을 이용한 적응적 문장생성 열차예약 에이전트)

  • Lim, Sung-Soo;Cho, Sung-Bae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.12 no.2
    • /
    • pp.119-128
    • /
    • 2006
  • As dialogue systems are widely required, the research on natural language generation in dialogue has raised attention. Contrary to conventional dialogue systems that reply to the user with a set of predefined answers, a newly developed dialogue system generates them dynamically and trains the answers to support more flexible and customized dialogues with humans. This paper proposes an evolutionary method for generating sentences using interactive genetic programming. Sentence plan trees, which stand for the sentence structures, are adopted as the representation of genetic programming. With interactive evolution process with the user, a set of customized sentence structures is obtained. The proposed method applies to a dialogue-based train booking agent and the usability test demonstrates the usefulness of the proposed method.

Assessment of Population Structure and Genetic Diversity of 15 Chinese Indigenous Chicken Breeds Using Microsatellite Markers

  • Chen, Guohong;Bao, Wenbin;Shu, Jingting;Ji, Congliang;Wang, Minqiang;Eding, Herwin;Muchadeyi, Farai;Weigend, Steffen
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.21 no.3
    • /
    • pp.331-339
    • /
    • 2008
  • The genetic structure and diversity of 15 Chinese indigenous chicken breeds was investigated using 29 microsatellite markers. The total number of birds examined was 542, on average 36 birds per breed. A total of 277 alleles (mean number 9.55 alleles per locus, ranging from 2 to 25) was observed. All populations showed high levels of heterozygosity with the lowest estimate of 0.440 for the Gushi chickens, and the highest one of 0.644 observed for Wannan Three-yellow chickens. The global heterozygote deficit across all populations (FIT) amounted to 0.180 (p<0.001). About 16% of the total genetic variability originated from differences between breeds, with all loci contributing significantly to this differentiation. An unrooted consensus tree was constructed using the Neighbour-Joining method and pair-wise distances based on marker estimated kinships. Two main groups were found. The heavy-body type populations grouped together in one cluster while the light-body type populations formed the second cluster. The STRUCTURE software was used to assess genetic clustering of these chicken breeds. Similar to the phylogenetic analysis, the heavy-body type and light-body type populations separated first. Clustering analysis provided an accurate representation of the current genetic relations among the breeds. Remarkably similar breed rankings were obtained with all methods.

Solving Nonlinear Fixed Charge Transportation Problem by Spanning Tree-based Genetic Algorithm (신장트리 기반 유전자 알고리즘에 의한 비선형 fcTP 해법)

  • Jo, Jung-Bok;Ko, Suc-Bum;Gen, Mitsuo
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.8
    • /
    • pp.752-758
    • /
    • 2005
  • The transportation problem (TP) is known as one of the important problems in Industrial Engineering and Operational Research (IE/OR) and computer science. When the problem is associated with additional fixed cost for establishing the facilities or fulfilling the demand of customers, then it is called fixed charge transportation problem (fcTP). This problem is one of NP-hard problems which is difficult to solve it by traditional methods. This paper aims to show the application of spanning-tree based Genetic Algorithm (GA)approach for solving nonlinear fixed charge transportation problem. Our new idea lies on the GA representation that includes the feasibility criteria and repairing procedure for the chromosome. Several numerical experimental results are presented to show the effectiveness of the proposed method.

A Double Helix DNA Structure Based on the Block Circulant Matrix (I) (블록순환 행렬에 의한 이중나선 DNA 구조 (I))

  • Lee, Sung-Kook;Park, Ju-Yong;Lee, Moon-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.3
    • /
    • pp.203-211
    • /
    • 2016
  • The genetic code is a key to bio-informatics and to a science of biological self-organizing on the whole. Modern science faces the necessity of understanding and systematically explaining mysterious features of ensembles of molecular structures of the genetic code. This paper is devoted to symmetrical analysis for genetic systems. Mathematical theories of noise-immunity coding and discrete signal processing are based on Jacket matrix methods of representation and analysis of information. Both of the RNA and Jacket Matrix property also have the Element(Block) - wise Inverse Matrices. These matrix methods, which are connected closely with relations of symmetry, are borrowed for a matrix analysis of ensembles of molecular elements of the genetic code. This method is presented for its simplicity and the clarity with which it decomposes a Jacket Matrix in terms of the genetic RNA Codon.

Structure Identification of a Neuro-Fuzzy Model Can Reduce Inconsistency of Its Rulebase

  • Wang, Bo-Hyeun;Cho, Hyun-Joon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.2
    • /
    • pp.276-283
    • /
    • 2007
  • It has been shown that the structure identification of a neuro-fuzzy model improves their accuracy performances in a various modeling problems. In this paper, we claim that the structure identification of a neuro-fuzzy model can also reduce the degree of inconsistency of its fuzzy rulebase. Thus, the resulting neuro-fuzzy model serves as more like a structured knowledge representation scheme. For this, we briefly review a structure identification method of a neuro-fuzzy model and propose a systematic method to measure inconsistency of a fuzzy rulebase. The proposed method is applied to problems or fuzzy system reproduction and nonlinear system modeling in order to validate our claim.