Metamodeling techniques for evolutionary optimization of computationally expensive problems: Promise and limits

  • El-Beltagy M
  • Nair P
  • Keane A
N/ACitations
Citations of this article
55Readers
Mendeley users who have this article in their library.

Abstract

It is often the case in many problems in science and engineering that the analysis codes used are computationally very expensive. This can pose a serious impediment to the successful application of evolutionary optimization techniques. Metamodeling techniques present an enabling methodology for reducing the computational cost of such optimization problems. We present here a general framework for coupling metamodeling techniques with evolutionary algorithms to reduce the computational burden of solving this class of optimization problems. This framework aims to balance the concerns of optimization with that of design of ecperiments. Experiments on test problems and a practical engineering design problem serve to illustrate our arguments. The practical limitations of this approach are also outlined.

Cite

CITATION STYLE

APA

El-Beltagy, M., Nair, P., & Keane, A. (1999). Metamodeling techniques for evolutionary optimization of computationally expensive problems: Promise and limits. Proceedings of Genetic and Evolutionary Computation Conference. Retrieved from http://scholar.google.com/scholar?hl=en&btnG=Search&q=intitle:Metamodeling+Techniques+for+Evolutionary+Optimization+of+Computationally+Expensive+Problems:+Promises+and+Limitations#3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free