Coevolutionary convergence to global optima

Authors:
Lothar M. Schmitt
Affiliations:
The University of Aizu, Aizu-Wakamatsu City, Fukushima Prefecture, Japan
Venue:
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Year:
2003

Citing 4
Cited 1

Linear analysis of genetic algorithms

Theoretical Computer Science
Theory of genetic algorithms

Theoretical Computer Science
The Simple Genetic Algorithm: Foundations and Theory

The Simple Genetic Algorithm: Foundations and Theory
A markov chain framework for the simple genetic algorithm

Evolutionary Computation

Theory of genetic algorithms II: models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss a theory for a realistic, applicable scaled genetic algorithm (GA) which converges asymptoticly to global optima in a coevolutionary setting involving two species. It is shown for the first time that coevolutionary arms races yielding global optima can be implemented successfully in a procedure similar to simulated annealing.