An upper bound on the convergence rates of canonical genetic algorithms

Complexity International

Volumn 5, Issue , 1998, Pages

  Gao, Yong ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FUZZY CONTROL; GENETIC ALGORITHMS; LEARNING SYSTEMS; MARKOV PROCESSES; MATRIX ALGEBRA; NEURAL NETWORKS; OPTIMIZATION; PROBLEM SOLVING; SIGNAL ENCODING; VECTORS;

ADAPTION CONTROL; CANONICAL GENETIC ALGORITHM (CGA); COMPUTATIONAL RESOURCES; MUTATION;

LARGE SCALE SYSTEMS;

EID: 0009571358     PISSN: 13200682     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. Cerf, R.(1996). The dynamics of mutation-selection algorithms with large population size. Annales de l'Institut Henri Poincare-Probabilites et Statistiques, 32(4), 455-508.
2. De Jong, K.A.(1975). An analysis of the behavior of a class of genetic adaptive systems. Ph.D. dissertation, University of Michigen, Ann Arbor.
3. Eiben, A.E., Aarts, E.H.L., & Hee, K.M.Van.(1991). Global convergence of genetic algorithms : A Markov chain analysis. In H.-P.Schwefel & R.Männer (Eds.), Parallel problem solving from nature(pp.4-12). Berlin and Heideberg: Springer.
4. Fogel, D.B.(1994). Asymptotic convergence properties of genetic algorithms and evolutionary programming: Analysis and experiments. Cybernetics and Systems, 25(3), 389-407.
5. Graffigne, C.(1992). Parallel annealing by periodically interacting multiple searches: an experimental study. In R.Azencott(Ed.), Simulated annealing: Parallelization techniques, (pp.47-99). New York: John Wiley & Sons.
6. Holland, J.H.(1975). Adaptation in natural and artificial systems. Ann Arbor, MI: The University of Michigan Press.
7. Iosifescu, M.(1980). Finite Markov processes and their applications. New York: John Wiley & Sons.
8. Leung, Y., Gao, Y., & Xu, Z.B.(1996). Degree of population diversity: A perspective on premature convergence in genetic algorithms and its Markov chain analysis. IEEE Transactions on Neural Networks, 8(5), 1165-1176.
9. Peck, C.C., & Dhawan, A.P.(1995). Genetic algorithms as global random search methods: An alternative perspective. Evolutionary Computation, 3(1), 39-80.
10. Reynolds, D., & Gomatam, J.(1996). Stochastic modelling of genetic algorithms. Artificial Intelligence, 82, 303-330.
11. Roberts, G.O.(1992). Convergence diagnostics of Gibbs sampler. In J.M.Bernardo, J.O.Berger, A.P.Dawid, & A.F.M.Smith (Eds.), Bayesian Statistics-4(pp.775-782), UK: Oxford University Press.
12. Robertson, G.G.(1988). Population size in classifier systems. In Proceedings of the 5th International Conference on Machine Learning(pp.142-152). CA: Morgan Kaufmann.
13. Rosenthal, J.S.(1995a). Convergence rates for Markov chains. SIAM Review, 37(3), 387-405.
14. Rosenthal, J.S.(1995b). Minorization conditions and convergence rates for Markov chain Monte Carlo. Journal of the American Statistical Association, 90(430), 558-566.
15. Rudolph, G.(1994). Convergence analysis of canonical genetic algorithms. IEEE Transactions on Neural Networks, 5(1), 96-101.
16. Schaffer, J.D., Caruana, R.A., Eshelman, L.J., & Das, R.(1989). A study of control parameters affecting online performance of genetic algorithms for function optimization. In J.D.Schaffer(Ed.), Proceedings of the third International Conference on Genetic Algorithms (pp.51-60), San Mateo, CA: Morgan Kaufmann.
17. Schraudolpl, N.N., & Belew, R.K.(1992). Dynamic parameter encoding for genetic algorithms. Machine Learning, 9, 9-21.
18. Suzuki, J.(1995). A Markov chain analysis on simple genetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics, 25(4), 655-659.
19. Vose, M.D.(1996). Modeling simple genetic algorithms. Evolutionary Computation, 3(4), 453-472.