A new algorithm is presented for accelerating the convergence of evolutionary optimization methods through a reduction in the number of fitness function calls. Such a reduction is obtained by 1) creating an approximate model of the fitness landscape using kriging interpolation, and 2) using this model instead of the original fitness function for evaluating some of the next generations. The main interest of the presented approach lies in problems for which the computational costs associated with fitness function evaluation is very high, such as in the case of most engineering design problems. Numerical results presented for a test case show that the reconstruction algorithm can effectively reduces the number of fitness function calls for simple problems as well as for difficult multidimensional ones.
CITATION STYLE
Ratle, A. (1998). Accelerating the convergence of evolutionary algorithms by fitness landscape approximation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1498 LNCS, pp. 87–96). Springer Verlag. https://doi.org/10.1007/bfb0056852
Mendeley helps you to discover research relevant for your work.