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.

8 Multi-objective <strong>Optimization</strong> in Convective Heat Transfer 239<br />

ments, <strong>and</strong> giving a clearer underst<strong>and</strong>ing <strong>of</strong> the influence <strong>of</strong> design variables.<br />

Three main aspects must be considered when choosing a DOE:<br />

1. The number <strong>of</strong> design variables (i.e., domain space dimension);<br />

2. The effort <strong>of</strong> a single experiment;<br />

3. The expected complexity <strong>of</strong> the objective function.<br />

The modeFRONTIER package includes several algorithms for the DOE selection<br />

[14]. In this work, we have mainly used full factorial <strong>and</strong> Sobol ones.<br />

Full Factorial<br />

Full factorial (FF) algorithm sample each variable span for n values called<br />

levels <strong>and</strong> evaluates every possible combination. The number <strong>of</strong> total experiments<br />

is<br />

k�<br />

N =<br />

(8.40)<br />

i=1<br />

where ni is the number <strong>of</strong> levels for the i-th variable <strong>and</strong> k is the number <strong>of</strong><br />

design variables. Full factorial provides a very good sampling <strong>of</strong> the variables<br />

domain space, giving complete information on the influence <strong>of</strong> each parameter<br />

on the system. The higher the number <strong>of</strong> levels, the better the information.<br />

However, this algorithm bears an important drawback, namely that the<br />

number <strong>of</strong> samples increase exponentially with the number <strong>of</strong> variables. This<br />

makes the use <strong>of</strong> FF unaffordable in many practical circumstances.<br />

Sobol<br />

Sobol algorithm creates sequences <strong>of</strong> n points that fill the n-dimensional space<br />

more uniformly than a r<strong>and</strong>om sequence does. These types <strong>of</strong> sequences are<br />

called quasi-r<strong>and</strong>om sequences. This term is misleading since there is nothing<br />

r<strong>and</strong>om in this algorithm. The data in this type <strong>of</strong> sequence are chosen as to<br />

avoid each other, filling in a uniform way the design space. This is illustrated<br />

in Fig. 8.7(b).<br />

8.7 <strong>Optimization</strong> Algorithms<br />

<strong>Optimization</strong> algorithms investigate the behavior <strong>of</strong> a system, seeking for<br />

design variable combinations that give optimal performances. In terms <strong>of</strong><br />

objective function values, an optimal performance means the attainment <strong>of</strong><br />

extrema. Extrema are points in which the value <strong>of</strong> the function is either minimum<br />

or maximum. Generally speaking, a function might present more than<br />

ni

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

Saved successfully!

Ooh no, something went wrong!