Generalizing the notion of schema in genetic algorithms
Artificial Intelligence
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
How neutral networks influence evolvability
Complexity
The Simple Genetic Algorithm: Foundations and Theory
The Simple Genetic Algorithm: Foundations and Theory
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
The Definition of Programming Languages
The Definition of Programming Languages
Representations for Genetic and Evolutionary Algorithms
Representations for Genetic and Evolutionary Algorithms
The Use of Neutral Genotype-Phenotype Mappings for Improved Evolutionary Search
BT Technology Journal
Effective Fitness as an Alternative Paradigm for Evolutionary Computation I: General Formalism
Genetic Programming and Evolvable Machines
Some Considerations on the Reason for Bloat
Genetic Programming and Evolvable Machines
Through the Labyrinth Evolution Finds a Way: A Silicon Ridge
ICES '96 Proceedings of the First International Conference on Evolvable Systems: From Biology to Hardware
Adapting Operator Probabilities in Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Complexity Compression and Evolution
Proceedings of the 6th International Conference on Genetic Algorithms
Modeling Building-Block Interdependency
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
On the Utility of Redundant Encodings in Mutation-Based Evolutionary Search
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Genotype-Phenotype-Mapping and Neutral Variation - A Case Study in Genetic Programming
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Proceedings of the European Conference on Genetic Programming
Neutrality and the Evolvability of Boolean Function Landscape
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Finding Needles in Haystacks Is Not Hard with Neutrality
EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Genetic Algorithms Using Grammatical Evolution
EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
An Investigation into the Use of Different Search Strategies with Grammatical Evolution
EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Grammatical Evolution: Evolving Programs for an Arbitrary Language
EuroGP '98 Proceedings of the First European Workshop on Genetic Programming
Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language
Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language
Redundant representations in evolutionary computation
Evolutionary Computation
EA models and population fixed-points versus mutation rates for functions of unitation
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Finding needles in haystacks is harder with neutrality
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Properties of Gray and Binary Representations
Evolutionary Computation
State Aggregation and Population Dynamics in Linear Systems
Artificial Life
Redundant genes and the evolution of robustness
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Proceedings of the 8th annual conference on Genetic and evolutionary computation
An empirical investigation of how and why neutrality affects evolutionary search
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Genetic programming using genotype-phenotype mapping from linear genomes into linear phenotypes
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
Grammatical evolution based data mining for network intrusion detection
Grammatical evolution based data mining for network intrusion detection
On the avoidance of fruitless wraps in grammatical evolution
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms
Some steps towards understanding how neutrality affects evolutionary search
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
On the locality of grammatical evolution
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
An attribute grammar decoder for the 01 multiconstrained knapsack problem
EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
mGGA: the meta-grammar genetic algorithm
EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
IEEE Transactions on Evolutionary Computation
Redundancy and computational efficiency in Cartesian genetic programming
IEEE Transactions on Evolutionary Computation
Christiansen Grammar Evolution: Grammatical Evolution With Semantics
IEEE Transactions on Evolutionary Computation
Normalization for Genetic Algorithms With Nonsynonymously Redundant Encodings
IEEE Transactions on Evolutionary Computation
A study of redundancy and neutrality in evolutionary optimization
Evolutionary Computation
Hi-index | 0.00 |
We present a new perspective of search in evolutionary computing (EC) by using a novel model for the analysis and visualization of genotype to phenotype maps. The model groups genes into quotient sets and shows their adjacencies. A unique quality of the quotient model is that it details geometric qualities of maps that are not otherwise easy to observe. The model shows how random mutations on genes make nonrandom phenotype preferences, based on the structure of a map. The interaction between such mutation-based preferences with fitness preferences is important for explaining population movements on neutral landscapes. We show the widespread applicability of our approach by applying it to different representations, encodings, and problems including grammatical evolution (GE), Cartesian genetic programming, parity and majority coding, OneMax, Needle-in-Haystack, deceptive trap and hierarchical if-and-only-if. We also use the approach to address conflicting results in the neutral evolution literature and to analyze concepts relevant to neutral evolution including robustness, evolvability, tunneling, and the relation between genetic form and function. We use the model to develop theoretical results on how mapping and neutral evolution affect search in GE. We study the two phases of mapping in GE, these being transcription (i.e., unique identification of genes with integers) and translation (i.e., many-to-one mapping of genotypes to phenotypes). It is shown that translation and transcription schemes belong to equivalence classes, and therefore the properties we derive for specific schemes are applicable to classes of schemes. We present a new perspective on population diversity. We specify conditions under which increasing degeneracy (by increasing codon size) or rearranging the rules of a grammar do not affect performance. It is shown that there is a barrier to nontrivial neutral evolution with the use of the natural transcription with modulo translation combination; a necessary but not sufficient condition for such evolution is that at least three bits should change on mutation within a single codon. This barrier can be avoided by using Gray transcription. We empirically validate some findings.