Context-Dependent DNA Coding With Redundancy and Introns

Deoxyribonucleic acid (DNA) coding methods determine the meaning of a certain character in individual chromosomes by the characters surrounding it. The meaning of each character is context dependent, not position dependent. Although position-dependent coding is most commonly used in genetic algorithms (GAs), a context-dependent coding formation is in fact more closer to the natural DNA chromosome. With the context dependency, the DNA coding methods allow intron parts, redundancy, and variable string length in encoded strings while remaining compatible with the standard genetic operations. This paper tries to explicitly explore the influence of those special features of the DNA coding scheme. Two fundamental DNA coding methods (with and without the use of introns) are constructed and compared with the integer coding method, which lacks the features of interest. The performance of the proposed DNA coding methods is analyzed through the robot soccer role assignment problem. The context-dependent coding exhibits the advantages in handling the negative effect of epistasis. The redundancy and intron parts are helpful in preventing useful schemata from disruption and in increasing the population diversity. The variable length of the individual string enables GAs to evolve both the size and the structure of the fuzzy rule base.

[1]  Kalyanmoy Deb,et al.  Ordering Genetic Algorithms and Deception , 1992, PPSN.

[2]  Nichael Lynn Cramer,et al.  A Representation for the Adaptive Generation of Simple Sequential Programs , 1985, ICGA.

[3]  Colin R. Reeves,et al.  Epistasis in Genetic Algorithms: An Experimental Design Perspective , 1995, ICGA.

[4]  A. Townsend.  Genetic Algorithms – a Tutorial , 2003 .

[5]  Annie S. Wu,et al.  Empirical Studies of the Genetic Algorithm with Noncoding Segments , 1995, Evolutionary Computation.

[6]  Melanie Mitchell,et al.  Relative Building-Block Fitness and the Building Block Hypothesis , 1992, FOGA.

[7]  Peter J. Angeline,et al.  Genetic programming and emergent intelligence , 1994 .

[8]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[9]  Randy L. Haupt,et al.  Practical Genetic Algorithms , 1998 .

[10]  Rajarshi Das,et al.  A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization , 1989, ICGA.

[11]  Yongsheng Ding,et al.  DNA genetic algorithms for design of fuzzy systems , 2000, Ninth IEEE International Conference on Fuzzy Systems. FUZZ- IEEE 2000 (Cat. No.00CH37063).

[12]  Lakhmi C. Jain.  Evolution of engineering and information systems and their applications , 1999 .

[13]  Xiao Peng,et al.  Fuzzy behavior-based control of mobile robots , 2004, IEEE Transactions on Fuzzy Systems.

[14]  James R. Levenick.  Inserting Introns Improves Genetic Algorithm Success Rate: Taking a Cue from Biology , 1991, ICGA.

[15]  R. Salomon.  Re-evaluating genetic algorithm performance under coordinate rotation of benchmark functions. A survey of some theoretical and practical aspects of genetic algorithms. , 1996, Bio Systems.

[16]  Takeshi Furuhashi,et al.  Development of if-then rules with the use of DNA coding , 1997 .

[17]  Yongsheng Ding,et al.  Parameter optimization for a class of general TS fuzzy controllers via a new DNA-based genetic algorithm , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).

[18]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[19]  Thomas Bäck,et al.  Evolution Strategies for Mixed-Integer Optimization of Optical Multilayer Systems , 1995, Evolutionary Programming.

[20]  Heinz Mühlenbein,et al.  Evolution in Time and Space - The Parallel Genetic Algorithm , 1990, FOGA.

[21]  A. I.,et al.  Neural Field Continuum Limits and the Structure–Function Partitioning of Cognitive–Emotional Brain Networks , 2023, Biology.

[22]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[23]  Kwee-Bo Sim,et al.  Evolutionary neural networks for time series prediction based on L-system and DNA coding method , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[24]  Yuval Davidor,et al.  Epistasis Variance: A Viewpoint on GA-Hardness , 1990, FOGA.

[25]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[26]  Ralph R. Martin,et al.  Reducing Epistasis in Combinatorial Problems by Expansive Coding , 1993, ICGA.

[27]  Robert G. Reynolds,et al.  Evolution Strategies for Mixed-Integer Optimization of Optical Multilayer Systems , 1995 .

[28]  Lashon B. Booker,et al.  Proceedings of the fourth international conference on Genetic algorithms , 1991 .

[29]  L. Duret,et al.  Why do genes have introns? Recombination might add a new piece to the puzzle. , 2001, Trends in genetics : TIG.

[30]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[31]  G. Syswerda,et al.  Schedule Optimization Using Genetic Algorithms , 1991 .

[32]  James E. Baker,et al.  Reducing Bias and Inefficienry in the Selection Algorithm , 1987, ICGA.