Explicitly defined introns and destructive crossover in genetic programming
Advances in genetic programming
Efficient string matching: an aid to bibliographic search
Communications of the ACM
A Survey of Intron Research in Genetics
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
A description of holland's royal road function
Evolutionary Computation
Empirical studies of the genetic algorithm with noncoding segments
Evolutionary Computation
Duplication of coding segments in genetic programming
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Evolutive Introns: A Non-Costly Method of Using Introns in GP
Genetic Programming and Evolvable Machines
The Proportional Genetic Algorithm: Gene Expression in a Genetic Algorithm
Genetic Programming and Evolvable Machines
Improving Street Based Routing Using Building Block Mutations
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
An Incremental Genetic Algorithm Approach to Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A Genetic Engineering Approach to Genetic Algorithms
Evolutionary Computation
Emergence of genomic self-similarity in location independent representations
Genetic Programming and Evolvable Machines
Conjugate schema and basis representation of crossover and mutation operators
Evolutionary Computation
Ptgas---genetic algorithms evolving noncoding segments by means of promoter/terminator sequences
Evolutionary Computation
Putting more genetics into genetic algorithms
Evolutionary Computation
Crossover accelerates evolution in gas with a babel-like fitness landscape: Mathematical analyses
Evolutionary Computation
The relationship between search based software engineering and predictive modeling
Proceedings of the 6th International Conference on Predictive Models in Software Engineering
Evolutionary neural networks and DNA computing algorithms for dual-axis motion control
Engineering Applications of Artificial Intelligence
Evolving structural design solutions using an implicit redundant Genetic Algorithm
Structural and Multidisciplinary Optimization
| Hi-index | 0.00 |
This article compares the traditional, fixed problem representation style of a genetic algorithm (GA) with a new floating representation in which the building blocks of a problem are not fixed at specific locations on the individuals of the population. In addition, the effects of noncoding segments on both of these representations is studied. Noncoding segments are a computational model of noncoding deoxyribonucleic acid, and floating building blocks mimic the location independence of genes. The fact that these structures are prevalent in natural genetic systems suggests that they may provide some advantages to the evolutionary process. Our results show that there is a significant difference in how GAs solve a problem in the fixed and floating representations. Genetic algorithms are able to maintain a more diverse population with the floating representation. The combination of noncoding segments and floating building blocks appears to encourage a GA to take advantage of its parallel search and recombination abilities.