A study on metamodeling techniques, ensembles, and multi-surrogates in evolutionary computation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A memetic model of evolutionary PSO for computational finance applications
Expert Systems with Applications: An International Journal
An effective intelligent algorithm for stochastic optimization problem
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
An evolutionary algorithm with spatially distributed surrogates for multiobjective optimization
ACAL'07 Proceedings of the 3rd Australian conference on Progress in artificial life
Finding multiple first order saddle points using a valley adaptive clearing genetic algorithm
CIRA'09 Proceedings of the 8th IEEE international conference on Computational intelligence in robotics and automation
Feasibility structure modeling: an effective chaperone for constrained memetic algorithms
IEEE Transactions on Evolutionary Computation - Special issue on preference-based multiobjective evolutionary algorithms
AICI'10 Proceedings of the 2010 international conference on Artificial intelligence and computational intelligence: Part II
On the application of efficient hybrid heuristic algorithms - An insurance industry example
Applied Soft Computing
Automatic surrogate model type selection during the optimization of expensive black-box problems
Proceedings of the Winter Simulation Conference
An optimization algorithm employing multiple metamodels and optimizers
International Journal of Automation and Computing
Hi-index | 0.00 |
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.