Convergence Analysis of Surrogate Assisted (1+1) Evolutionary Algorithm

Article Preview

Abstract:

This paper analyzes the convergence deviation of surrogate assisted (1+1)EA. A model of surrogate assisted (1+1)EA can be built by the finite markov chain, then we got the transition matrix of this algorithm. The deviation of surrogate model can be expressed by the perturbation of transition matrix. So we can estimate the convergence deviation with the method of matrix perturbation analysis. Analyzing of the convergence changes brought by surrogate model’s deviations can help us to have a better select of the surrogate model.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2339-2343

Citation:

Online since:

December 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Christopher L.Simons, Ian C.Parmee, Rhys G: Interactive, evolutionary search in upstream object-oriented class design. IEEE Transactions on Software Engineering, 36(6):798-816.(2010)

DOI: 10.1109/tse.2010.34

Google Scholar

[2] D. E. Goldberg: Genetic Algorithms in Search, Optimization, and MachineLearning.Reading, MA: Addison Wesley, (1989)

Google Scholar

[3] 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 and Heidelberg: Springer, pp.4-12,1991.

DOI: 10.1007/bfb0029725

Google Scholar

[4] D. B. Fogel, Evolving artificial intelligence, PhD dissert,San Diego: University of California, (1992)

Google Scholar

[5] G. Rudolph. Convergence analysis of canonical genetic algorithms. IEEE Transactions on Neural Networks, 5(1):96 – 101, 1994.

DOI: 10.1109/72.265964

Google Scholar

[6] M. Iosifescu, Finite Markol' Processes and Their Applications. Chichester:Wilev, (1980)

Google Scholar