A computationally efficient metamodeling approach for expensive multiobjective optimization

被引:0
|
作者
Achille Messac
Anoop A. Mullur
机构
[1] Rensselaer Polytechnic Institute,Department of Mechanical and Aerospace Engineering
来源
关键词
Pseudo response surface (PRS); Extended radial basis function (E-RBF); Multiobjective optimization;
D O I
暂无
中图分类号
学科分类号
摘要
This paper explores a new metamodeling framework that may collapse the computational explosion that characterizes the modeling of complex systems under a multiobjective and/or multidisciplinary setting. Under the new framework, a pseudo response surface is constructed for each design objective for each discipline. This pseudo response surface has the unique property of being highly accurate in Pareto optimal regions, while it is intentionally allowed to be inaccurate in other regions. In short, the response surface for each design objective is accurate only where it matters. Because the pseudo response surface is allowed to be inaccurate in other regions of the design space, the computational cost of constructing it is dramatically reduced. An important distinguishing feature of the new framework is that the response surfaces for all the design objectives are constructed simultaneously in a mutually dependent fashion, in a way that identifies Pareto regions for the multiobjective problem. The new framework supports the puzzling notion that it is possible to obtain more accuracy and radically more design space exploration capability, while actually reducing the computation effort. This counterintuitive metamodeling paradigm shift holds the potential for identifying highly competitive products and systems that are well beyond today’s state of the art.
引用
收藏
页码:37 / 67
页数:30
相关论文
共 50 条
  • [31] A comparative study of metamodeling methods for multiobjective crashworthiness optimization
    Fang, H
    Rais-Rohani, M
    Liu, Z
    Horstemeyer, MF
    COMPUTERS & STRUCTURES, 2005, 83 (25-26) : 2121 - 2136
  • [32] A fast Pareto genetic algorithm approach for solving expensive multiobjective optimization problems
    Hamidreza Eskandari
    Christopher D. Geiger
    Journal of Heuristics, 2008, 14 : 203 - 241
  • [33] FastPGA: A dynamic population sizing approach for solving expensive multiobjective optimization problems
    Eskandari, Hamidreza
    Geiger, Christopher D.
    Lamont, Gary B.
    EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, PROCEEDINGS, 2007, 4403 : 141 - +
  • [34] A Neighborhood Regression Optimization Algorithm for Computationally Expensive Optimization Problems
    Zhou, Yuren
    He, Xiaoyu
    Chen, Zefeng
    Jiang, Siyu
    IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (05) : 3018 - 3031
  • [35] Turning High-Dimensional Optimization Into Computationally Expensive Optimization
    Yang, Peng
    Tang, Ke
    Yao, Xin
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2018, 22 (01) : 143 - 156
  • [36] A fast Pareto genetic algorithm approach for solving expensive multiobjective optimization problems
    Eskandari, Hamidreza
    Geiger, Christopher D.
    JOURNAL OF HEURISTICS, 2008, 14 (03) : 203 - 241
  • [37] A parallel constrained lower confidence bounding approach for computationally expensive constrained optimization problems
    Cheng, Ji
    Jiang, Ping
    Zhou, Qi
    Hu, Jiexiang
    Shu, Leshi
    APPLIED SOFT COMPUTING, 2021, 106
  • [38] An approach for computationally expensive multi-objective optimization problems with independently evaluable objectives
    Mamun, Mohammad Mohiuddin
    Singh, Hemant Kumar
    Ray, Tapabrata
    SWARM AND EVOLUTIONARY COMPUTATION, 2022, 75
  • [39] Expensive Multiobjective Optimization by Relation Learning and Prediction
    Hao, Hao
    Zhou, Aimin
    Qian, Hong
    Zhang, Hu
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2022, 26 (05) : 1157 - 1170
  • [40] An approach for computationally expensive multi-objective optimization problems with independently evaluable objectives
    Mamun, Mohammad Mohiuddin
    Singh, Hemant Kumar
    Ray, Tapabrata
    SWARM AND EVOLUTIONARY COMPUTATION, 2022, 75