2016
DOI: 10.3311/ppci.10214
|View full text |Cite
|
Sign up to set email alerts
|

Robust Topology Optimization: A New Algorithm for Volume-constrained Expected Compliance Minimization with Probabilistic Loading Directions using Exact Analytical Objective and Gradient

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 7 publications
(8 citation statements)
references
References 18 publications
0
8
0
Order By: Relevance
“…It is worth to note that ∂Q 1,1 /∂x i and ∂Q 2,2 /∂x i ,i{1,2,...,n} can be generated by simple matrix manipulations (see Csébfalvi [14]). …”
Section: Model and Algorithmmentioning
confidence: 99%
“…It is worth to note that ∂Q 1,1 /∂x i and ∂Q 2,2 /∂x i ,i{1,2,...,n} can be generated by simple matrix manipulations (see Csébfalvi [14]). …”
Section: Model and Algorithmmentioning
confidence: 99%
“…In the expectancy oriented approach, the compliance increment which is needed to get the robust design is an implicitly defined response variable. In order to open the possibility of the creative contribution of the designer to the best robust design searching process, this measure is sometimes combined with a spreading-oriented measure, which may be the variance or standard deviation [14][15][16][17][18][19][20]. In these cases, the best weighting schema can be done by a try-and-error-like algorithm in which the weights are design variables and the compliance-increment remains invariably an implicitly defined response variable.…”
Section: Introductionmentioning
confidence: 99%
“…A good approach could be Enhanced Colliding Bodies Optimization (ECBO), which is used for size optimization in the case of monopole steel structures [54]. Another research scope is the Volume-constrained Expected Compliance Minimization with Probabilistic Loading Directions supported by the optimal solution searching optimality criteria (OC) method [55]. An efficient approach is the shortest route trees, that helps the meshing procedure [56].…”
Section: Introductionmentioning
confidence: 99%