Comments on “Theoretical Analysis of Evolutionary Algorithms with an Infinite Population Size in Continuous Space, Part I: Basic Properties of Selection and Mutation”

IEEE Transactions on Neural Networks

Volumn 9, Issue 2, 1998, Pages 341-343

  Gao, Yong ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85008045198     PISSN: 10459227     EISSN: 19410093     Source Type: Journal    
DOI: 10.1109/72.661129     Document Type: Note

References (6)

1. A. A. Zhigljavsky, Theory of Global Random Search. London: Kluwer, 1991.
2. D. B. Fogel, Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. New York: IEEE Press, 1995.
3. G. Rudolph, “Convergence analysis of canonical genetic algorithms,” IEEE Trans. Neural Networks, vol. 5, pp. 96-101, 1994.
4. A. E. Eiben, E. H. L. Aarts, and K. M. Van Hee, “Global convergence of genetic algorithms: A Markov chain analysis,” in Parallel Problem Solving from Nature, H. P. Schwefel and R. Manner, Eds. Berlin: Springer-Verlag, 1991, pp. 4-12.
5. M. D. Vose, “Modeling simple genetic algorithms,” Evolutionary Comput. vol. 3, no. 4, pp. 453-472, 1996.
6. C. C. Peck and A. P. Dhawan, “Genetic algorithms as global random search methods: An alternative perspective,” Evolutionary Computa., vol. 3, no. 1, pp. 39-80, 1995.