.png){kind=icon}
Return
Memetic algorithm using multi-surrogates for computationally expensive optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-006-0145-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we present a multi-surrogates assisted memetic algorithm for solving optimization problems with computationally expensive fitness functions. The essential backbone of our framework is an evolutionary algorithm coupled with a local search solver that employs multi-surrogate in the spirit of Lamarckian learning. Inspired by the notion of 'blessing and curse of uncertainty' in approximation models, we combine regression and exact interpolating surrogate models in the evolutionary search. Empirical results are presented for a series of commonly used benchmark problems to demonstrate that the proposed framework converges to good solution quality more efficiently than the standard genetic algorithm, memetic algorithm and surrogate-assisted memetic algorithms.
Keywords:
evolutionary optimization
memetic algorithm
surrogate model
radial basis function
polynomial regression
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
Organization
No organization information available
Cited Papers
ShareSave
ShareSaveShareSaveHybrid crossover operators for real-coded genetic algorithms:: an experimental study.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
ShareSaveShareSaveLocal function approximation in evolutionary algorithms for the optimization of costly functions
PREAI
ShareSave
View more