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
Interpolation of scattered data: Distance matrices and conditionally positive definite functions
TL;DR: In this paper, it was shown that multiquadric surface interpolation is always solvable, thereby settling a conjecture of R Franke, which is a conjecture that was later proved in the present paper.
1.6K
Convergence analysis of canonical genetic algorithms
TL;DR: This paper analyzes the convergence properties of the canonical genetic algorithm with mutation, crossover and proportional reproduction applied to static optimization problems and shows variants of CGA's that always maintain the best solution in the population are shown to converge to the global optimum due to the irreducibility property of the underlying original nonconvergent CGA.
1.5K
A comprehensive survey of fitness approximation in evolutionary computation
Yaochu Jin
- 01 Jan 2005
TL;DR: A comprehensive survey of the research on fitness approximation in evolutionary computation is presented, main issues like approximation levels, approximate model management schemes, model construction techniques are reviewed and open questions and interesting issues in the field are discussed.
1.3K
ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems
TL;DR: Results show that NSGA-II, a popular multiobjective evolutionary algorithm, performs well compared with random search, even within the restricted number of evaluations used.
1.2K
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