Local function approximation in evolutionary algorithms for the optimization of costly functions

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 offsprin...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on evolutionary computation Vol. 8; no. 5; pp. 490 - 505
Main Authors:	Regis, R.G., Shoemaker, C.A.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.10.2004 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Analysis of variance Applied sciences Approximation Approximation algorithms Artificial intelligence Computer science; control theory; systems Design engineering Design for experiments Design optimization Evolutionary algorithms Evolutionary computation Exact sciences and technology Finite element methods Function approximation Hypercubes Interpolation Mathematical analysis Mathematical models Mathematical programming Operational research and scientific management Operational research. Management science Optimization Problem solving, game playing Testing Statistical analysis Evolutionary algorithm evolutionary algorithm (EA) Numerical method Nonlinear problems Symmetric function Approximation algorithm quadratic regression Variance analysis Modeling Optimization radial basis function (RBF) Radial basis function Finite element method Algorithm performance Genetic algorithm function approximation Approximation by function Quadratic approximation Cost function Latin hypercube Objective function Costly function
ISSN:	1089-778X, 1941-0026
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!