Rate of Convergence in Evolutionary Computation

Proceedings of the American Control Conference

Volumn 3, Issue , 2003, Pages 1932-1937

  Stark, David R ^a   Spall, James C ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

Genetic algorithms; Markov chains; Stochastic optimization

Indexed keywords

BINARY CODES; MARKOV PROCESSES; OPTIMIZATION; ROBUSTNESS (CONTROL SYSTEMS);

BINARY ENCODING;

GENETIC ALGORITHMS;

EID: 0142153605     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Beyer, H.-G. (1995), "Toward a Theory of Evolution Strategies: On the Benefits of Sex - the (μ/μ,λ) Theory," Evolutionary Computation, vol. 3, pp. 81-111.
2. Davis, T. (1991), "Toward an Extrapolation of the Simulated Annealing Convergence Theory on to the Simple Genetic Algorithm," PhD Dissertation, University of Florida.
3. Eiben, A. E., Aarts, E. H. L., and van Hee, K. M. (1991), "Global Convergence of Genetic Algorithms: A Markov Chain Analysis," in Parallel Problem Solving from Nature (H.-P. Schwefel and R. Männer, eds.), Springer, Berlin and Heidelberg, pp. 4-12.
4. Holland, J. H. (1975), Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor.
5. Iosifescu, M. (1980), Finite Markov Processes and Their Applications, Wiley, Chichester.
6. Leung, K., Duan, Q., Xu, Z. and Wong, C. K. (2001), "A New Model of Simulated Evolutionary Computation - Convergence Analysis and Specifications," IEEE Transactions On Evolutionary Computation, vol., 5 no. 1, February 2001.
7. Nix, A. and Vose, M. (1992), "Modeling Genetic Algorithms with Markov Chains," Annals of Mathematics and Artificial Intelligence, vol. 5, pp. 79-88.
8. Qi, X. and Palmeiri, F. (1994), "Theoretical Analysis of Evolutionary Algorithms with Infinite Population Size in Continuous Space, Part I: Basic Properties," IEEE Transactions on Neural Networks, vol. 5, pp. 102-119.
9. Rudolph, G. (1994), "Convergence Analysis of Canonical Genetic Algorithms," IEEE Transactions on Neural Networks, vol. 5, pp. 96-101.
10. Rudolph, G. (1997a), Convergence Properties of Evolutionary Algorithms, Kovac, Hamburg.
11. Rudolph, G. (1997b), "Convergence Rates of Evolutionary Algorithms for a Class of Convex Objective Functions," Control and Cybernetics, vol. 26, pp. 375-390.
12. Rudolph, G. (1998), "Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon," Fundamenta Informaticae, vol. 34, pp. 1-22.
13. Schwefel, H.-P. (1995), Evolution and Optimum Seeking, Wiley, New York.
14. Spall, J. C., Hill, S. D., and Stark, D. S. (2000), "Some Theoretical Comparisons of Stochastic Optimization Approaches," in Proceedings of the American Control Conference, Chicago, IL, June 2000, pp. 1904-1908.
15. Suzuki, J. (1995), "A Markov Chain Analysis on Simple Genetic Algorithms," IEEE Transactions on Systems, Man, and Cybernetics, vol. 25, pp. 655-659.
16. Vose, M. and Liepins, G. (1991), "Punctuated Equilibria in Genetic Search," Complex Systems, vol. 5, pp. 31-44.
17. Vose, M . (1997), "Logarithmic Convergence of Random Heuristic Search," Evolutionary Computation, vol, 4, pp. 395-404
18. Vose, M. (1999), The Simple Genetic Algorithm, MIT Press, Cambridge, MA.