2021
DOI: 10.1016/j.compstruc.2021.106506
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 49 publications
0
4
0
Order By: Relevance
“…Calculate the mutual compliance coefficient c pq and obtain objective function using formulas (14). (c) Calculate the sensitivity information according to equations ( 28) and (30).…”
Section: Processmentioning
confidence: 99%
See 1 more Smart Citation
“…Calculate the mutual compliance coefficient c pq and obtain objective function using formulas (14). (c) Calculate the sensitivity information according to equations ( 28) and (30).…”
Section: Processmentioning
confidence: 99%
“…Two classic types of theoretical models in RTO can be distinguished. One way is the non-probabilistic convex model, which is committed to minimizing the objective function values in the worst-case scenario [12][13][14][15]. The other, called the average approach, is to minimize the expectancy of the structural performance [16][17][18].…”
Section: Introductionmentioning
confidence: 99%
“…In this section, the validity of IPSO-MS is evaluated on both test systems. In addition, the parameters of PSO are confirmed through random search (Do and Ohsaki, 2021 ), which are shown in Table 1 .…”
Section: Case Studymentioning
confidence: 99%
“…As HVI(𝐟|Ω, 𝐟 R ) and  2 (𝐬) are functions of 𝐬, and 𝐫 only appears in  1,1 (𝐬, 𝐫) and  1,2 (𝐬, 𝐫), an optimization strategy that couples a random sampling method with simulated annealing is developed for solving problem (12). This strategy is an extension of a two-stage random search proposed by the authors [40], which includes a stage of determining surrounding each of the current Pareto-optimal solutions, which can be regarded as a neighborhood search. In fact, each integer element of every Pareto-optimal solution is randomly increased or decreased by an integer value such as 1, 2, 3, or 4.…”
Section: Maximizing the Acquisition Functionsmentioning
confidence: 99%