2002
DOI: 10.1016/s0376-0421(01)00019-7
|View full text |Cite
|
Sign up to set email alerts
|

Design of optimal aerodynamic shapes using stochastic optimization methods and computational intelligence

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
119
0
4

Year Published

2003
2003
2013
2013

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 229 publications
(123 citation statements)
references
References 36 publications
0
119
0
4
Order By: Relevance
“…[6][7][8][9] EAs have been also applied to single-objective and multi-objective aerospace design optimization problems. 2,[10][11][12][13] This approach to finding many Pareto solutions works fine as it is, however, only when the number of objectives remains small (usually two, three at most, as shown in Fig. 3).…”
Section: Introductionmentioning
confidence: 99%
“…[6][7][8][9] EAs have been also applied to single-objective and multi-objective aerospace design optimization problems. 2,[10][11][12][13] This approach to finding many Pareto solutions works fine as it is, however, only when the number of objectives remains small (usually two, three at most, as shown in Fig. 3).…”
Section: Introductionmentioning
confidence: 99%
“…Conclusions on the optimal combination of hierarchical and distributed search schemes are expected to be the same. Also, the RBF networks used as metamodels in this paper could be replaced by any other artificial neural network, response surface method, the kriging metamodel, etc (Giannakoglou 2002).…”
Section: Discussionmentioning
confidence: 99%
“…the metamodel. Metamodels (Giannakoglou 2002, Jin 2005, Karakasis and Giannakoglou 2005, Lim et al 2008, Zhou et al 2007, Emmerich et al 2006 interpolation or approximation methods such as polynomial regression, artificial neural networks, etc, which, after being trained on previously seen solutions, are used in place of E 1 to screen out non-promising candidate solutions at very low CPU cost. In this manner, only a few of the best offspring undergo evaluations on E i , i > 0.…”
Section: Distributed Hierarchical Evolutionary Algorithmmentioning
confidence: 99%
“…Particularly, local models are used in favor of global models since constructing accurate global models is fundamentally flawed due to the curse of dimensionality [18][19][20][21]. Further, this allows more precise estimation on the unique characteristics of the problem landscapes, thus leading to the prediction on the appropriate level of localized model fidelity over the use of the original computationally expensive model.…”
Section: : End Whilementioning
confidence: 99%