07.02.2013 Views

Optimization and Computational Fluid Dynamics - Department of ...

Optimization and Computational Fluid Dynamics - Department of ...

Optimization and Computational Fluid Dynamics - Department of ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

2 A Few Illustrative Examples <strong>of</strong> CFD-based <strong>Optimization</strong> 23<br />

merical simulations based on RANS are still widely used today for engineering<br />

problems <strong>and</strong> complex geometries due to a higher computational efficiency.<br />

The objective in this case is to optimize the prediction <strong>of</strong> the time-averaged<br />

turbulent velocity distribution in channel flows.<br />

A similar investigation was performed in [37], where a variable Schmidt<br />

number model for jet-in-crossflows was improved using GA optimization.<br />

Multi-objective EAs have been also employed for determining <strong>and</strong> adjusting<br />

reaction parameters in [18, 19, 20]. But, to our knowledge, no paper has<br />

been published up to now considering the optimization <strong>of</strong> the model constants<br />

<strong>of</strong> an engineering turbulence model.<br />

2.2 Evolutionary Algorithms for Multi-objective<br />

<strong>Optimization</strong><br />

2.2.1 Multi-objective <strong>Optimization</strong><br />

Mathematically speaking, a multi-objective problem consists <strong>of</strong> optimizing<br />

(i.e., minimizing or maximizing) several objectives simultaneously, with a<br />

number <strong>of</strong> inequality or equality constraints. The problem can be formally<br />

written as follows:<br />

subject to:<br />

Find x =(xi) ∀ i =1, 2,...,Nparam such as<br />

fi(x) is a minimum (resp. maximum), ∀ i =1, 2,...,Nobj<br />

gj(x)=0, ∀ j =1, 2,...,M (2.1)<br />

hk(x) ≤ 0, ∀ k =1, 2,...,K (2.2)<br />

where x is a vector containing the Nparam design parameters, (fi)i=1...Nobj<br />

the objective functions <strong>and</strong> Nobj the number <strong>of</strong> objectives. In this study, only<br />

inequality constraints are considered <strong>and</strong> are prescribed as bounded domains.<br />

In other words, upper <strong>and</strong> lower limits are imposed on all parameters:<br />

xi ∈ [xi,min; xi,max] i =1...Nparam . (2.3)<br />

The objective function (fi(x)) returns a vector containing the set<br />

i=1...Nobj<br />

<strong>of</strong> Nobj values associated with the elementary objectives to be optimized<br />

simultaneously. The number <strong>of</strong> input parameters <strong>and</strong> objective functions for<br />

the different cases considered in this chapter are summarized in Table 2.1.<br />

Acommonpracticetosolvesuchaproblem is to use a trade-<strong>of</strong>f between<br />

the objectives by linearly combining them using some fixed weights prescribed<br />

by the user (see for example [16, 73]). The resulting single objective function

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!