An efficient hybrid sequential approximate optimization method for problems with computationally expensive objective and constraints

被引:0
|
作者
Dengfeng Wang
Chong Xie
机构
[1] Jilin University,State Key Laboratory of Automotive Simulation and Control
来源
关键词
Optimal sampling; Sequential optimization; Expensive constraints; Crashworthiness optimization;
D O I
暂无
中图分类号
学科分类号
摘要
To improve the computational cost and approximate optimization accuracy of solving engineering optimization problems with both expensive objective and constraints, a hybrid sequential approximate optimization (HSAO) method is proposed. First, the radial basis function neural network (RBFNN) and response surface method (RSM) approximate models fit the optimization objectives and constraints, respectively. Second, the fitted model searches for the optimal solution via global optimization algorithm, and then, the optimal solution is used as a newly added sample point for updating approximation model. The region of the optimal solution is iteratively updated until the optimal solution converges. The performance of the HSAO method is tested on numerical test functions. Compared with the traditional approximate model, adaptive RSM, and adaptive RBFNN approximate optimization, the results indicate that the proposed HSAO method is higher in search ability and efficiency. Finally, the method is applied in S-shaped tube crashworthiness optimization, and has achieved desired results.
引用
收藏
页码:727 / 738
页数:11
相关论文
共 50 条
  • [1] An efficient hybrid sequential approximate optimization method for problems with computationally expensive objective and constraints
    Wang, Dengfeng
    Xie, Chong
    [J]. ENGINEERING WITH COMPUTERS, 2022, 38 (01) : 727 - 738
  • [2] EFFICIENT OPTIMIZATION OF COMPUTATIONALLY EXPENSIVE OBJECTIVE FUNCTIONS
    KARIDIS, JP
    TURNS, SR
    [J]. JOURNAL OF MECHANISMS TRANSMISSIONS AND AUTOMATION IN DESIGN-TRANSACTIONS OF THE ASME, 1986, 108 (03): : 336 - 339
  • [3] A RBF-based constrained global optimization algorithm for problems with computationally expensive objective and constraints
    Wu, Yizhong
    Yin, Qian
    Jie, Haoxiang
    Wang, Boxing
    Zhao, Jianjun
    [J]. STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2018, 58 (04) : 1633 - 1655
  • [4] A RBF-based constrained global optimization algorithm for problems with computationally expensive objective and constraints
    Yizhong Wu
    Qian Yin
    Haoxiang Jie
    Boxing Wang
    Jianjun Zhao
    [J]. Structural and Multidisciplinary Optimization, 2018, 58 : 1633 - 1655
  • [5] Efficient Global Optimization for Solving Computationally Expensive Bilevel Optimization Problems
    Islam, Md Monjurul
    Singh, Hemant Kumar
    Ray, Tapabrata
    [J]. 2018 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2018, : 181 - 188
  • [6] Efficient Parametric Optimization for Expensive Single Objective Problems
    Weaver-Rosen, Jonathan M.
    Malak, Richard J., Jr.
    [J]. JOURNAL OF MECHANICAL DESIGN, 2021, 143 (03)
  • [7] Surrogate optimization of computationally expensive black-box problems with hidden constraints
    Müller, Juliane
    Day, Marcus
    [J]. INFORMS Journal on Computing, 2019, 31 (04): : 689 - 702
  • [8] Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints
    Muller, Juliane
    Day, Marcus
    [J]. INFORMS JOURNAL ON COMPUTING, 2019, 31 (04) : 689 - 702
  • [9] Practical initialization of the Nelder–Mead method for computationally expensive optimization problems
    Shintaro Takenaga
    Yoshihiko Ozaki
    Masaki Onishi
    [J]. Optimization Letters, 2023, 17 : 283 - 297
  • [10] An approach for computationally expensive multi-objective optimization problems with independently evaluable objectives
    Mamun, Mohammad Mohiuddin
    Singh, Hemant Kumar
    Ray, Tapabrata
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2022, 75