title: Forced evolutionin silicoby artificial transposons and their genetic operators: The ant navigation problem.
abstract: Modern evolutionary computation utilizes heuristic optimizations based upon concepts borrowed from the Darwinian theory of natural selection. Their demonstrated efficacy has reawakened an interest in other aspects of contemporary biology as an inspiration for new algorithms. However, amongst the many excellent candidates for study, contemporary models of biological macroevolution attract special attention. We believe that a vital direction in this field must be algorithms that model the activity of "genomic parasites", such as transposons, in biological evolution. Many evolutionary biologists posit that it is the co-evolution of populations with their genomic parasites that permits the high efficiency of evolutionary searches found in the living world. This publication is our first step in the direction of developing a minimal assortment of algorithms that simulate the role of genomic parasites. Specifically, we started in the domain of genetic algorithms (GA) and selected the Artificial Ant Problem as a test case. This navigation problem is widely known as a classical benchmark test and possesses a large body of literature. We add new objects to the standard toolkit of GA - artificial transposons and a collection of operators that operate on them. We define these artificial transposons as a fragment of an ant's code with properties that cause it to stand apart from the rest. The minimal set of operators for transposons is a transposon mutation operator, and a transposon reproduction operator that causes a transposon to multiply within the population of hosts. An analysis of the population dynamics of transposons within the course of ant evolution showed that transposons are involved in the processes of propagation and selection of blocks of ant navigation programs. During this time, the speed of evolutionary search increases significantly. We concluded that artificial transposons, analogous to real transposons, are truly capable of acting as intelligent mutators that adapt in response to an evolutionary problem in the course of co-evolution with their hosts.
authors.affiliation: Department of Applied Mathematics and Statistics, The Stony Brook State University, NY.
authors.forename: Leonid
authors.initials: L
authors.lastname: Zamdborg
authors.affiliation: Mathematics Department, British Columbia Institute of Technology, 3700 Willingdon Avenue, Burnaby, B.C., Canada, V5G 3H2.
authors.forename: David M
authors.initials: DM
authors.lastname: Holloway
authors.affiliation: Departamento de Arquitectura y Tecnología de Computadores, University of Granada, Granada, Spain.
authors.forename: Juan J
authors.initials: JJ
authors.lastname: Merelo
authors.affiliation: The Sechenov Institute of Evolutionary Physiology and Biochemistry, 44 Thorez Ave., St. Petersburg, 194223, Russia.
authors.forename: Vladimir F
authors.initials: VF
authors.lastname: Levchenko
authors.affiliation: Department of Applied Mathematics and Statistics, The Stony Brook State University, NY ; The Sechenov Institute of Evolutionary Physiology and Biochemistry, 44 Thorez Ave., St. Petersburg, 194223, Russia ; Computer Science Department and Center of Excellence in Wireless & Information Technology, The Stony Brook State University, NY.
authors.forename: Alexander V
authors.initials: AV
authors.lastname: Spirov
keywords: animats; ant pathfinder; artificial transposons; evolutionary computations; genetic algorithms