论文信息 - Forma Analysis and Random Respectful Recombination

Forma Analysis and Random Respectful Recombination

Intrinsic parallelism is shown to have application beyond schemata and o-schemata. More general objects called formae are introduced and general operators which manipulate these are introduced and discussed. These include random, respectful recombination. The extended formalism is applied to various common representations and standard operators are analysed in the light of the formalism.

Nicholas J. Radcliffe | N. J. Radcliffe | N. Radcliffe

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

[2] Nicholas J. Radcliffe,et al. Equivalence Class Analysis of Genetic Algorithms , 1991, Complex Syst..

[3] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[4] David E. Goldberg,et al. Alleles, loci and the traveling salesman problem , 1985 .

[5] D. E. Goldberg,et al. Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .

[6] John J. Grefenstette,et al. Genetic Algorithms for the Traveling Salesman Problem , 1985, ICGA.

[7] Larry J. Eshelman,et al. Biases in the Crossover Landscape , 1989, ICGA.

[8] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[9] L. Darrell Whitley,et al. Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.

[10] D. E. Goldberg,et al. Genetic Algorithms in Search , 1989 .

[11] D. J. Smith,et al. A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

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