Comparing evolutionary computation techniques via their representation

Authors:
Boris Mitavskiy
Affiliations:
Department of Mathematics, University of Michigan, Ann Arbor, MI
Venue:
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Year:
2003

Citing 9
Cited 6

Generalizing the notion of schema in genetic algorithms

Artificial Intelligence
The Simple Genetic Algorithm: Foundations and Theory

The Simple Genetic Algorithm: Foundations and Theory
Network random keys: a tree representation scheme for genetic and evolutionary algorithms

Evolutionary Computation
Group properties of crossover and mutation

Evolutionary Computation
A New Interpretation of Schema Notation that Overtums the Binary Encoding Constraint

Proceedings of the 3rd International Conference on Genetic Algorithms
A Fixed Point Analysis Of A Gene Pool GA With Mutation

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Exact Results From A Coarse Grained Formulation Of The Dynamics Of Variable-length Genetic Algorithms

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Crossover Invariant Subsets of the Search Space for Evolutionary Algorithms

Evolutionary Computation
Schemata evolution and building blocks

Evolutionary Computation

Crossover Invariant Subsets of the Search Space for Evolutionary Algorithms

Evolutionary Computation
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms.

Evolutionary Computation
Estimating the ratios of the stationary distribution values for markov chains modeling evolutionary algorithms

Evolutionary Computation
NP-Completeness of deciding binary genetic encodability

FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
A schema-based version of geiringer's theorem for nonlinear genetic programming with homologous crossover

FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
An extension of geiringer's theorem for a wide class of evolutionary search algorithms

Evolutionary Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

In the current paper a rigorous mathematical language for comparing evolutionary computation techniques via their representation is developed. A binary semi-genetic algorithm is introduced, and it is proved that in a certain sense any reasonable evolutionary search algorithm can be re-encoded by a binary semi-genetic algorithm (see corollaries 15 and 16). Moreover, an explicit bijection between the set of all such re-encodings and the collection of certain n-tuples of invariant subsets is constructed (see theorem 14). Finally, all possible re-encodings of a given heuristic search algorithm by a classical genetic algorithm are entirely classified in terms of invariant subsets of the search space in connection with Radcliffe's forma (see [9] and theorem 20).