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 条
  • [21] An efficient sampling approach to multiobjective optimization
    Fu, Y
    Diwekar, UM
    ANNALS OF OPERATIONS RESEARCH, 2004, 132 (1-4) : 109 - 134
  • [22] An Efficient Sensitivity Analysis Approach for Computationally Expensive Microscopic Traffic Simulation Models
    Ge, Qiao
    Menendez, Monica
    INTERNATIONAL JOURNAL OF TRANSPORTATION, 2014, 2 (02): : 49 - 64
  • [23] A computationally efficient approach to swimming monofin optimization
    Luersen, M. A.
    Le Riche, R.
    Lemosse, D.
    Le Maitre, O.
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2006, 31 (06) : 488 - 496
  • [24] A computationally efficient approach to swimming monofin optimization
    M. A. Luersen
    R. Le Riche
    D. Lemosse
    O. Le Maître
    Structural and Multidisciplinary Optimization, 2006, 31 : 488 - 496
  • [25] An interactive surrogate-based method for computationally expensive multiobjective optimisation
    Tabatabaei, Mohammad
    Hartikainen, Markus
    Sindhya, Karthik
    Hakanen, Jussi
    Miettinen, Kaisa
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2019, 70 (06) : 898 - 914
  • [26] An algorithm for computationally expensive engineering optimization problems
    Yoel, Tenne
    INTERNATIONAL JOURNAL OF GENERAL SYSTEMS, 2013, 42 (05) : 458 - 488
  • [27] A survey on handling computationally expensive multiobjective optimization problems using surrogates: non-nature inspired methods
    Tabatabaei, Mohammad
    Hakanen, Jussi
    Hartikainen, Markus
    Miettinen, Kaisa
    Sindhya, Karthik
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2015, 52 (01) : 1 - 25
  • [28] An efficient hybrid sequential approximate optimization method for problems with computationally expensive objective and constraints
    Wang, Dengfeng
    Xie, Chong
    ENGINEERING WITH COMPUTERS, 2022, 38 (01) : 727 - 738
  • [29] A survey on handling computationally expensive multiobjective optimization problems using surrogates: non-nature inspired methods
    Mohammad Tabatabaei
    Jussi Hakanen
    Markus Hartikainen
    Kaisa Miettinen
    Karthik Sindhya
    Structural and Multidisciplinary Optimization, 2015, 52 : 1 - 25
  • [30] An efficient hybrid sequential approximate optimization method for problems with computationally expensive objective and constraints
    Dengfeng Wang
    Chong Xie
    Engineering with Computers, 2022, 38 : 727 - 738