An efficient multiple meta-model-based global optimization method for computationally intensive problems. (February 2021)
- Record Type:
- Journal Article
- Title:
- An efficient multiple meta-model-based global optimization method for computationally intensive problems. (February 2021)
- Main Title:
- An efficient multiple meta-model-based global optimization method for computationally intensive problems
- Authors:
- Gu, Jichao
- Abstract:
- Highlights: An efficient multiple meta-model-based global optimization (EMMGO) algorithm is developed. The design space is divided into an important region and a remaining region: 21 new trial points are selected in each iteration. Multiple searches improve efficiency and robustness of the search process EMMGO outperforms other state-of-the-art algorithms in six mathematical optimization problems and a real structural optimization problem. Abstract: Present metamodel based global optimization algorithms usually build an evolving metamodel using initial and updated sample points to speed up the search of the global optimum. In this research, we proposed an efficient and robust multiple meta-model-based global optimization method (EMMGO). The EMMGO starts with two different sets of initial points and two different sets of evolving metamodels to search the design space. One evolving set of meta-models are updated using all sample points at each iteration of the search. The other set of meta-models are constructed using the sample points without the set of points which contains the initial best. These two sets of evolving meta-models consist of three components: radial basis function, Kriging and quadratic function. In the iterative search process, an important region, likely to contain the global optimum, is first identified using a few expensive points, and the search of the global optimum is conducted over this region using both of the two sets of metamodels. Meanwhile, theHighlights: An efficient multiple meta-model-based global optimization (EMMGO) algorithm is developed. The design space is divided into an important region and a remaining region: 21 new trial points are selected in each iteration. Multiple searches improve efficiency and robustness of the search process EMMGO outperforms other state-of-the-art algorithms in six mathematical optimization problems and a real structural optimization problem. Abstract: Present metamodel based global optimization algorithms usually build an evolving metamodel using initial and updated sample points to speed up the search of the global optimum. In this research, we proposed an efficient and robust multiple meta-model-based global optimization method (EMMGO). The EMMGO starts with two different sets of initial points and two different sets of evolving metamodels to search the design space. One evolving set of meta-models are updated using all sample points at each iteration of the search. The other set of meta-models are constructed using the sample points without the set of points which contains the initial best. These two sets of evolving meta-models consist of three components: radial basis function, Kriging and quadratic function. In the iterative search process, an important region, likely to contain the global optimum, is first identified using a few expensive points, and the search of the global optimum is conducted over this region using both of the two sets of metamodels. Meanwhile, the evolving meta-models fitted using all obtained points are used in the search over the other area and the entire design space to avoid missing the global optimum. The new EMMGO algorithm is tested using several commonly-used benchmark functions. The search efficiency of the new algorithm is also illustrated by solving a practical, computationally intensive global optimization problem in designing a lightweight vehicle, employing finite element analysis and simulation. The results from efficient global optimization and multiple metamodels based design space differentiation are provided for search performance comparison. … (more)
- Is Part Of:
- Advances in engineering software. Volume 152(2021)
- Journal:
- Advances in engineering software
- Issue:
- Volume 152(2021)
- Issue Display:
- Volume 152, Issue 2021 (2021)
- Year:
- 2021
- Volume:
- 152
- Issue:
- 2021
- Issue Sort Value:
- 2021-0152-2021-0000
- Page Start:
- Page End:
- Publication Date:
- 2021-02
- Subjects:
- Multiple sets of initial points -- Multiple meta-models -- Important region -- Computationally intensive problems -- Global optimization
Computer-aided engineering -- Periodicals
Engineering -- Computer programs -- Periodicals
Engineering -- Software -- Periodicals
Periodicals
620.0028553 - Journal URLs:
- http://www.sciencedirect.com/science/journal/09659978 ↗
http://www.elsevier.com/journals ↗ - DOI:
- 10.1016/j.advengsoft.2020.102958 ↗
- Languages:
- English
- ISSNs:
- 0965-9978
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 0705.450000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 20401.xml