遗传算法基础理论研究的新近发展

[1] Using reliability analysis to estimate the number of generations toconvergence in genetic algorithms. Chakraborty U K and Dastidar D K. Imformation Processing Letters . 1993

[2] Stochastic Model,Theoretical Analyses and Applications of Genetic Algorithms. Gao Y. . 1997

[3] An analysis of a simple genetic algorithm. Rabinovich Y,Wigderson A. Proceedings of the Fourth International Conference on Genetic Algorithms . 1991

[4] Punctuated equilibria in genetic search. Vose M D and Liepins G E. Complex Systems . 1991

[5] A proof of the Vose-Liepins conjecture. Koehler G J. Annals of Mathematics . 1994

[6] An analysis of non-binary genetic algorithms with cardinality 2~v. Bhattacharyya S and Koehler G J. Complex Systems . 1994

[7] Finiteness of the fixed point set for the simple genetic algorithm. Wright A H and Vose M D. Evolutionary Computation . 1996

[8] Modeling genetic algorithms with Markov chains. Nix A E and Vose M D. Annals of Mathematica andArtificial Intelligence . 1992

[9] No ho lunch theorem for search. Wolpert D,Macreadg W. . 1995

[10] Syntactic analysis of convergence in genetic algorithms. Louts S J and Rawlins G J E. Foundations ofGenetic Algorithms 2, San Mateo, Morgan Kaufmann . 1993

[1] Using reliability analysis to estimate the number of generations toconvergence in genetic algorithms. Chakraborty U K and Dastidar D K. Imformation Processing Letters . 1993

[2] Stochastic Model,Theoretical Analyses and Applications of Genetic Algorithms. Gao Y. . 1997

[3] An analysis of a simple genetic algorithm. Rabinovich Y,Wigderson A. Proceedings of the Fourth International Conference on Genetic Algorithms . 1991

[4] Punctuated equilibria in genetic search. Vose M D and Liepins G E. Complex Systems . 1991

[5] A proof of the Vose-Liepins conjecture. Koehler G J. Annals of Mathematics . 1994

[6] An analysis of non-binary genetic algorithms with cardinality 2~v. Bhattacharyya S and Koehler G J. Complex Systems . 1994

[7] Finiteness of the fixed point set for the simple genetic algorithm. Wright A H and Vose M D. Evolutionary Computation . 1996

[8] Modeling genetic algorithms with Markov chains. Nix A E and Vose M D. Annals of Mathematica andArtificial Intelligence . 1992

[9] No ho lunch theorem for search. Wolpert D,Macreadg W. . 1995

[10] Syntactic analysis of convergence in genetic algorithms. Louts S J and Rawlins G J E. Foundations ofGenetic Algorithms 2, San Mateo, Morgan Kaufmann . 1993