2012
DOI: 10.2495/op120041
|View full text |Cite
|
Sign up to set email alerts
|

Metamodel-based multi-objective robust design optimization of structures

Abstract: Multi-objective robust optimization (MORO) is a highly demanding computational task because of the direct nesting of the uncertainty quantification within optimization. This work presents an approach based on Kriging models to efficiently include the uncertainty quantification in the optimization procedures. In the proposed approach the metamodels appear both at optimization level as well as at uncertainty quantification level. The proposed methodology allows us to: (1) assess the robustness of each design usi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0
1

Year Published

2017
2017
2024
2024

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 15 publications
0
1
0
1
Order By: Relevance
“…Previously, robust design approach has been combined with some different methods in multi-objective optimization such as the weighted sum method (Zadeh, 1963), goal programming (Charnes & Cooper, 1977), physical programming (Messac & Ismail-Yahaya, 2002), compromise programming (Chen et al, 1999), desirability function (Costa et al, 2011) and Lp metrics methods (Miettinen, 2012). Recently, some developed methods have been proposed as evolutionary algorithms such as simulated annealing (Suman & Kumar, 2006), particle swarm optimization (Parsopoulos & Vrahatis, 2002) and non-dominated sorting genetic algorithm (Deb et al, 2002), and Non-dominated Sorting Genetic Algorithm II (NSGA-II) (Martınez-Frutos & Marti-Montrull, 2012). …”
Section: Multi-objective Robust Optimizationmentioning
confidence: 99%
“…Previously, robust design approach has been combined with some different methods in multi-objective optimization such as the weighted sum method (Zadeh, 1963), goal programming (Charnes & Cooper, 1977), physical programming (Messac & Ismail-Yahaya, 2002), compromise programming (Chen et al, 1999), desirability function (Costa et al, 2011) and Lp metrics methods (Miettinen, 2012). Recently, some developed methods have been proposed as evolutionary algorithms such as simulated annealing (Suman & Kumar, 2006), particle swarm optimization (Parsopoulos & Vrahatis, 2002) and non-dominated sorting genetic algorithm (Deb et al, 2002), and Non-dominated Sorting Genetic Algorithm II (NSGA-II) (Martınez-Frutos & Marti-Montrull, 2012). …”
Section: Multi-objective Robust Optimizationmentioning
confidence: 99%
“…Los trabajos presentados anteriormente utilizan parte de soluciones no-dominadas para la actualización del meta-modelo. Esta forma de proceder proporciona en ocasiones soluciones satisfactorias convergiendo al frente de Pareto real (Gaspar-Cunha y Vieira, 2004;Martínez-Frutos y Martí, 2011;Voutchkov y Keane, 2006). Sin embargo, al igual que ocurre en el problema con unúnico objetivo, dicho enfoqueúnicamente se basa en las solucionesóptimas para la actualización del meta-modelo (explotación) y no considera la incertidumbre epistémica del mismo (exploración).…”
Section: Introductionunclassified