Abstract

Surrogate-based modeling is an effective search method for global design optimization over well-defined areas using complex and computationally intensive analysis and simulation tools. However, indentifying the appreciate surrogate models and their suitable areas remains a challenge that requires extensive human intervention. In this work, a new global optimization algorithm, namely Mixed Surrogate and Space Elimination (MSSE) method, is introduced. Representative surrogate models, including Quadratic Response Surface, Radial Basis function, and Kriging, are mixed with different weight ratios to form an adaptive metamodel with best tested performance. The approach divides the field of interest into several unimodal regions; identifies and ranks the regions that likely contain the global minimum; fits the weighted surrogate models over each promising region using additional design experiment data points from Latin Hypercube Designs and adjusts the weights according to the performance of each model; identifies its minimum and removes the processed region; and moves to the next most promising region until all regions are processed and the global optimum is identified. The proposed algorithm was tested using several benchmark problems for global optimization and compared with several widely used space exploration global optimization algorithms, showing reduced computation efforts, robust performance and comparable search accuracy, making the proposed method an excellent tool for computationally intensive global design optimization problems.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.