Localization for solving noisy multi-objective optimization problems
Evolutionary Computation
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Evolutionary Model Type Selection for Global Surrogate Modeling
The Journal of Machine Learning Research
On the performance of metamodel assisted MOEA/D
ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence
Evolutionary regression modeling with active learning: an application to rainfall runoff modeling
ICANNGA'09 Proceedings of the 9th international conference on Adaptive and natural computing algorithms
Generalizing surrogate-assisted evolutionary computation
IEEE Transactions on Evolutionary Computation
Expensive multiobjective optimization by MOEA/D with Gaussian process model
IEEE Transactions on Evolutionary Computation
AICI'10 Proceedings of the 2010 international conference on Artificial intelligence and computational intelligence: Part II
Local meta-models for optimization using evolution strategies
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Numerical assessment of metamodelling strategies in computationally intensive optimization
Environmental Modelling & Software
Hoeffding bound based evolutionary algorithm for symbolic regression
Engineering Applications of Artificial Intelligence
Interactive genetic algorithms with large population and semi-supervised learning
Applied Soft Computing
A genetic algorithm assisted by a locally weighted regression surrogate model
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
An evolutionary linear programming algorithm for solving the stock reduction problem
International Journal of Computer Applications in Technology
Evolution by adapting surrogates
Evolutionary Computation
Flicker: a dynamically adaptive architecture for power limited multicore systems
Proceedings of the 40th Annual International Symposium on Computer Architecture
| Hi-index | 0.00 |
We develop an approach for the optimization of continuous costly functions that uses a space-filling experimental design and local function approximation to reduce the number of function evaluations in an evolutionary algorithm. Our approach is to estimate the objective function value of an offspring by fitting a function approximation model over the k nearest previously evaluated points, where k=(d+1)(d+2)/2 and d is the dimension of the problem. The estimated function values are used to screen offspring to identify the most promising ones for function evaluation. To fit function approximation models, a symmetric Latin hypercube design (SLHD) is used to determine initial points for function evaluation. We compared the performance of an evolution strategy (ES) with local quadratic approximation, an ES with local cubic radial basis function (RBF) interpolation, an ES whose initial parent population comes from an SLHD, and a conventional ES. These algorithms were applied to a twelve-dimensional (12-D) groundwater bioremediation problem involving a complex nonlinear finite-element simulation model. The performances of these algorithms were also compared on the Dixon-Szego test functions and on the ten-dimensional (10-D) Rastrigin and Ackley test functions. All comparisons involve analysis of variance (ANOVA) and the computation of simultaneous confidence intervals. The results indicate that ES algorithms with local approximation were significantly better than conventional ES algorithms and ES algorithms initialized by SLHDs on all Dixon-Szego test functions except for Goldstein-Price. However, for the more difficult 10-D and 12-D functions, only the cubic RBF approach was successful in improving the performance of an ES. Moreover, the results also suggest that the cubic RBF approach is superior to the quadratic approximation approach on all test functions and the difference in performance is statistically significant for all test functions with dimension d≥4.