论文信息 - Coevolutionary Convergence to Global Optima

Coevolutionary Convergence to Global Optima

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.

Lothar M. Schmitt

[1] Michael D. Vose,et al. The simple genetic algorithm - foundations and theory , 1999, Complex adaptive systems.

[2] Lothar M. Schmitt,et al. Asymptotic Convergence of Scaled Genetic Algorithms to Global Optima , 2004 .

[3] Lothar M. Schmitt,et al. Theory of genetic algorithms , 2001, Theor. Comput. Sci..

[4] Chrystopher L. Nehaniv,et al. Linear Analysis of Genetic Algorithms , 1998, Theor. Comput. Sci..

[5] José Carlos Príncipe,et al. A Markov Chain Framework for the Simple Genetic Algorithm , 1993, Evolutionary Computation.