4.7 Article

A random search for discrete robust design optimization of linear-elastic steel frames under interval parametric uncertainty

期刊

COMPUTERS & STRUCTURES
卷 249, 期 -, 页码 -

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.compstruc.2021.106506

关键词

Discrete robust design optimization; Random search; Interval uncertainty; Radial basis function; Adaptive optimization strategy; Frame structure

资金

  1. JICA AUN/SEED-Net project from the Japan International Cooperation Agency (JICA)
  2. JSPS KAKENHI [JP19H02286]

向作者/读者索取更多资源

This study introduces a new random search method for solving discrete robust design optimization problems by approximating structural responses with RBF models. By iteratively selecting the best solution and generating new promising candidates, the proposed method can find the exact optimal or a good approximate solution through the optimization process.
This study presents a new random search method for solving discrete robust design optimization (RDO) problem of planar linear-elastic steel frames. The optimization problem is formulated with an explicit objective function of discrete design variables, unknown-but-bounded uncertainty in material properties and external loads, and black-box constraint functions of the structural responses. Radial basis function (RBF) models serve as approximations of structural responses. The anti-optimization problem is approximated by an RBF-based optimization problem that is solved using an adaptive strategy coupled with a difference-of-convex functions algorithm. The adaptive strategy is embedded in an iterative process for solving the upper-level optimization problem. This process starts with a set of candidate solutions and iterates through selecting the best candidate among the available candidates and generating new promising candidates by performing a small random perturbation around the best solution found so far to refine the RBF approximations. It terminates when the number of iterations reaches an upper bound, and outputs the optimal solution that is the best solution obtained through the optimization process. Two test problems and two design examples demonstrate that the exact optimal or a good approximate solution can be found by the proposed method with a few trials of the algorithm. (C) 2021 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据