DNA computing based RNA genetic algorithm with applications in parameter estimation of chemical engineering processes

Based on RNA genetic operations and DNA sequence model under selection and mutation, an electronic RNA genetic algorithm (RNA-GA) with improved crossover and mutation operator is proposed. The proposed algorithm can be implemented on real biochemical reaction after simple transition, thus, the brute force method of DNA computing can be broken. The convergence analysis of the proposed algorithm shows that RNA-GA with elitist strategy can converge in probability to the global optimum. Comparisons of RNA-GA with standard genetic algorithm (SGA) for typical test functions show the advantages and efficiency of the proposed algorithm. As illustrations, the RNA-GA is implemented on parameter estimation of a heavy oil thermal cracking 3-lumping model and a fluid catalytic cracking unit (FCCU) main fractionator. In both cases, it is shown that the methodology is effective in parameter estimation of chemical processes.

[1]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[2]  LIYuan,et al.  Genetic algorithm in DNA computing： A solution to the maximal clique problem , 2004 .

[3]  L F Landweber,et al.  Molecular computation: RNA solutions to chess problems , 2000, Proc. Natl. Acad. Sci. USA.

[4]  L F Landweber,et al.  Chess games: a model for RNA based computation. , 1999, Bio Systems.

[5]  Byoung-Tak Zhang,et al.  Solving traveling salesman problems with DNA molecules encoding numerical values. , 2004, Bio Systems.

[6]  Stephen M. Krone,et al.  The genealogy of samples in models with selection. , 1997, Genetics.

[7]  Masahito Yamamoto,et al.  Solutions of Shortest Path Problems by Concentration Control , 2001, DNA.

[8]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[9]  Chen Fang,et al.  Genetic algorithm in DNA computing: A solution to the maximal clique problem , 2004 .

[10]  Clifford R. Johnson,et al.  Solution of a 20-Variable 3-SAT Problem on a DNA Computer , 2002, Science.

[11]  Richard J. Lipton,et al.  Breaking DES using a molecular computer , 1995, DNA Based Computers.

[12]  Song Xiao-feng.  Eugenic Evolution Strategy Genetic Algorithms for Estimating Parameters of Heavy Oil Thermal Cracking Model , 2003 .

[13]  P D Kaplan,et al.  DNA solution of the maximal clique problem. , 1997, Science.

[14]  Max H. Garzon,et al.  Soft molecular computing , 1999, DNA Based Computers.

[15]  Chang-Biau Yang,et al.  A DNA solution of SAT problem by a modified sticker model. , 2005, Bio Systems.

[16]  Zhong Xuan.  Multivariable Constrained Generalized Predictive Control Strategy for the FCCU Main Fractionator , 2001 .

[17]  David K. Gifford,et al.  Simulating biological reactions: A modular approach , 1999, DNA Based Computers.

[18]  Li Shu,et al.  Operational Rules for Digital Coding of RNA Sequences Based on DNA Computing in High Dimensional Space , 2003 .