Putting more genetics into genetic algorithms

  • Authors:

  • Donald S. Burke;Kenneth A. De Jong;John J. Grefenstette;Connie Loggia Ramsey;Annie S. Wu

  • Affiliations:

  • Center for Immunization Research School of Hygiene and Public Health Johns Hopkins University Baltimore, MD 21205 dburke@jhsph.edu;Computer Science Department George Mason University Fairfax, VA 22030 kdejong@gmu.edu;Institute for Biosciences, Bioinformatics and Biotechnology George Mason University Manassas, VA 20110 gref@ib3.gmu.edu;Navy Center for Applied Research in Artificial Intelligence Naval Research Laboratory Washington, DC 20375 ramsey@aic.nrl.navy.mil;Navy Center for Applied Research in Artificial Intelligence Naval Research Laboratory Washington, DC 20375 aswu@aic.nrl.navy.mil

  • Venue:
  • Evolutionary Computation
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

The majority of current genetic algorithms (GAs), while inspired by natural evolutionary systems, are seldom viewed as biologically plausible models. This is not a criticism of GAs, but rather a reflection of choices made regarding the level of abstraction at which biological mechanisms are modeled, and a reflection of the more engineering-oriented goals of the evolutionary computation community. Understanding better and reducing this gap between GAs and genetics has been a central issue in an interdisciplinary project whose goal is to build GA-based computational models of viral evolution. The result is a system called Virtual Virus (VIV). VIV incorporates a number of more biologically plausible mechanisms, including a more flexible genotype-to-phenotype mapping. In VIV the genes are independent of position, and genomes can vary in length and may contain noncoding regions, as well as duplicative or competing genes. Initial computational studies with VIV have already revealed several emergent phenomena of both biological and computational interest. In the absence of any penalty based on genome length, VIV develops individuals with long genomes and also performs more poorly (from a problem-solving viewpoint) than when a length penalty is used. With a fixed linear length penalty, genome length tends to increase dramatically in the early phases of evolution and then decrease to a level based on the mutation rate. The plateau genome length (i.e., the average length of individuals in the final population) generally increases in response to an increase in the base mutation rate. When VIV converges, there tend to be many copies of good alternative genes within the individuals. We observed many instances of switching between active and inactive genes during the entire evolutionary process. These observations support the conclusion that noncoding regions serve as scratch space in which VIV can explore alternative gene values. These results represent a positive step in understanding how GAs might exploit more of the power and flexibility of biological evolution while simultaneously providing better tools for understanding evolving biological systems.