Variable Length Representation in Evolutionary Electronics
- 1 March 2000
- journal article
- Published by MIT Press in Evolutionary Computation
- Vol. 8 (1) , 93-120
- https://doi.org/10.1162/106365600568112
Abstract
This work investigates the application of variable length representation (VLR) evolutionary algorithms (EAs) in the field of Evolutionary Electronics. We propose a number of VLR methodologies that can cope with the main issues of variable length evolutionary systems. These issues include the search for efficient ways of sampling a genome space with varying dimensionalities, the task of balancing accuracy and parsimony of the solutions, and the manipulation of non-coding segments. We compare the performance of three proposed VLR approaches to sample the genome space: Increasing Length Genotypes, Oscillating Length Genotypes, and Uniformly Distributed Initial Population strategies. The advantages of reusing genetic material to replace non-coding segments are also emphasized in this work. It is shown, through examples in both analog and digital electronics, that the variable length genotype's representation is natural to this particular domain of application. A brief discussion on biological genome evolution is also provided.Keywords
This publication has 4 references indexed in Scilit:
- Empirical Studies of the Genetic Algorithm with Noncoding SegmentsEvolutionary Computation, 1995
- Balancing Accuracy and Parsimony in Genetic ProgrammingEvolutionary Computation, 1995
- An Overview of Evolutionary Algorithms in Multiobjective OptimizationEvolutionary Computation, 1995
- Using a genetic algorithm for optimizing fixed polarity Reed-Muller expansions of boolean functionsInternational Journal of Electronics, 1994