Memetic algorithm using multiple surrogates for complex engineering design optimization
Zongzhao. Zhou
- 01 Jan 2008
TL;DR: A novel hierarchical surrogate-assisted memetic algorithm (HSAMA) combining both global and local surrogate models for accelerating the optimization process is proposed and described and results show that the HSAMA algorithm is capable of achieving good designs efficiently under a limited computational budget.
read more
Abstract: Complex engineering design (CED) optimization problems in science and engineering commonly have large design spaces. In such design spaces, typically thousands of exact fitness evaluations are required to locate a near optimal design. Often in photonics, electromagnetic, aerospace, biomedical and microwave circuits detailed design processes, variable-fidelity analysis codes are employed to strike a balance between design cost, time and estimation accuracy. Nevertheless, in analysis and design optimization processes where high-fidelity analysis codes are used, each exact fitness evaluation requiring the simulation of analysis codes may cost hours of supercomputer time. Therefore, the overwhelming part of the total run time in CED optimization is usually taken up by the simulation of analysis codes. This often poses a serious impediment to the practical application of high-fidelity analysis codes and evolutionary algorithms to CED optimization problems. In this dissertation work, the research focus has been placed on the use of multiple surrogate models in standard memetic algorithm (MA) to mitigate the costly CED optimization process. In this thesis, a novel hierarchical surrogate-assisted memetic algorithm (HSAMA) combining both global and local surrogate models for accelerating the optimization process is proposed and described. The performance of the proposed algorithm is analyzed by using a series of commonly used benchmark test functions. Furthermore, the proposed algorithm is also applied to aerodynamic shape design. Numerical results show that the HSAMA algorithm is capable of achieving good designs efficiently under a limited computational budget. Further, the impact of uncertainty introduced by approximation errors, i.e., ‘curse and blessing of uncertainty ’, is illustrated and demonstrated on surrogate-assisted memetic algorithm (SAMA). Inspired by this finding, a novel multi-surrogates assisted memetic i ATTENTION: The Singapore Copyright Act applies to the use of this document. Nanyang Technological University Library
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
The Open Grid Services Architecture
Ian Foster,Carl Kesselman,Steven Tuecke +2 more
- 01 Jan 2004
TL;DR: This chapter describes the service-oriented architecture principles that underlie OGSA and provides a detailed description of the Web services mechanisms and the Open Grid Services Infrastructure specification that together define the core interfaces and behaviors underlying OGSA.
Evolution strategies assisted by Gaussian processes with improved preselection criterion
Holger Ulmer,Felix Streichert,Andreas Zell +2 more
- 08 Dec 2003
TL;DR: This work proposes a model assisted evolution strategy, which uses a Gaussian process approximation model to preselect the most promising solutions, and achieves better results than standard evolutionary optimization approaches with less fitness evaluations.
Empirical Model-Building and Response Surfaces
TL;DR: This work discusses the use of Graduating Functions, design Aspects of Variance, Bias, and Lack of Fit, and Practical Choice of a Response Surface Design in relation to Second--Order Response Surfaces.
Adapting Weighted Aggregation for Multiobjective Evolution Strategies
Yaochu Jin,Tatsuya Okabe,Bernhard Sendhoff +2 more
- 07 Mar 2001
TL;DR: The conventional weighted aggregation method is extended to realize multi-objective optimization and it is found that the population is able to approach the Pareto front, although it will not keep all the found Pare to solutions in the population.
Lamarckian Evolution, The Baldwin Effect and Function Optimization
L. Darrell Whitley,V. Scott Gordon,Keith E. Mathias +2 more
- 09 Oct 1994
TL;DR: It is shown that functions exist where simple genetic algorithms without learning as well as Lamarckian evolution converge to the same local optimum, while genetic search utilizing the Baldwin effect converges to the global optimum.
Related Papers (5)
László Horváth,Imre J. Rudas +1 more
- 06 Oct 2002
Constantine Caramanis
- 01 Jan 2006
Tibor Bosse,Armando Geller,Catholijn M. Jonker +2 more
- 01 Jan 2011