.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
evolutionary optimization
memetic algorithm
surrogate model
radial basis function
polynomial regression
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
暂无机构信息
引用论文
Hierarchy theory as a conceptual framework for scale issues in avalanche forecast modeling层次理论作为雪崩预报建模中尺度问题的概念框架
OAAI
OAAI分享收藏
Hybrid crossover operators for real-coded genetic algorithms:: an experimental study实数编码遗传算法的混合交叉算子: 实验研究.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏Local function approximation in evolutionary algorithms for the optimization of costly functions
PREAI
分享收藏
查看更多内容