论文信息 - A solvable model of a hard optimisation problem - 字舞流文

A solvable model of a hard optimisation problem

A. Rogers | A. Prügel-Bennett

[1] Adam Prügel-Bennett,et al. Genetic drift in genetic algorithm selection schemes , 1999, IEEE Trans. Evol. Comput..

[2] I. Harvey,et al. On recombination and optimal mutation rates , 1999 .

[3] Adam Prügel-Bennett,et al. The Dynamics of a Genetic Algorithm on a Model Hard Optimization Problem , 2000, Complex Syst..

[4] Adam Prügel-Bennett,et al. Genetic algorithm dynamics in two-well potentials with basins and barrier , 1997 .

[5] A. Prügel-Bennett,et al. The dynamics of a genetic algorithm for simple random Ising systems , 1997 .

[6] Michael D. Vose,et al. Modeling Simple Genetic Algorithms , 1995, Evolutionary Computation.

[7] Prügel-Bennett,et al. Analysis of genetic algorithms using statistical mechanics. , 1994, Physical review letters.

[8] John H. Holland,et al. When will a Genetic Algorithm Outperform Hill Climbing , 1993, NIPS.

[9] J. David Schaffer,et al. Proceedings of the third international conference on Genetic algorithms , 1989 .

[10] Gilbert Syswerda,et al. Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[11] James E. Baker,et al. Reducing Bias and Inefficienry in the Selection Algorithm , 1987, ICGA.

[12] J. E. Baker. Adaptive Selection Methods for Genetic Algorithms , 1985, ICGA.