Although surrogate-assisted evolutionary algorithms have been widely utilized in the science and engineering fields, efficient management of surrogates is still a challenging task because of the complicated action mechanisms of surrogates. Trying to investigate how surrogates influence the convergence of evolutionary algorithms, this paper performs an analysis of a (1+1) surrogate-assisted evolutionary algorithm with Gaussian mutations, where a linear surrogate model is employed to approximately evaluate the candidate solutions. Numerical results demonstrate that the linear surrogate model greatly improves performance of evolutionary algorithms on a unimodal problem when the standard deviation of Gaussian mutation σ is small. However, when σ is set big, the improving functions of linear surrogate models are not significant. However, for a multi-modal problem, the positive function of the linear surrogate model is not significant, because the employed Gaussian mutation cannot keep a balance between exploration and exploitation. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
Chen, Y., & Zou, X. (2014). Performance analysis of a (1+1) surrogate-assisted evolutionary algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8588 LNCS, pp. 32–40). Springer Verlag. https://doi.org/10.1007/978-3-319-09333-8_4
Mendeley helps you to discover research relevant for your work.