论文信息 - Convergence of evolutionary algorithms in general search spaces

Convergence of evolutionary algorithms in general search spaces

This paper provides conditions under which evolutionary algorithms with an elitist selection rule will converge to the global optimum of some function whose domain may be an arbitrary space. These results generalize the previously developed convergence theory for binary and Euclidean search spaces to general search spaces.

Günter Rudolph | G. Rudolph

[1] U. G. Oppel,et al. Auf der Zufallssuche basierende Evolutionsprozesse , 1978 .

[2] Roger J.-B. Wets,et al. Minimization by Random Search Techniques , 1981, Math. Oper. Res..

[3] Joe Suzuki,et al. A Markov chain analysis on simple genetic algorithms , 1995, IEEE Trans. Syst. Man Cybern..

[4] K. Dejong,et al. An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[5] E. Nummelin. General irreducible Markov chains and non-negative operators: Embedded renewal processes , 1984 .

[6] D. Fogel. ASYMPTOTIC CONVERGENCE PROPERTIES OF GENETIC ALGORITHMS AND EVOLUTIONARY PROGRAMMING: ANALYSIS AND EXPERIMENTS , 1994 .

[7] Günter Rudolph,et al. Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.

[8] Luc Devroye,et al. On the Convergence of Statistical Search , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[9] E. Nummelin. General irreducible Markov chains and non-negative operators: List of symbols and notation , 1984 .

[10] J´nos Pintér,et al. Convergence properties of stochastic optimization procedures , 1984 .