28.02.2013 Views

Handbook of Turbomachinery Second Edition Revised - Ventech!

Handbook of Turbomachinery Second Edition Revised - Ventech!

Handbook of Turbomachinery Second Edition Revised - Ventech!

SHOW MORE
SHOW LESS

Create successful ePaper yourself

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

promising technique capable <strong>of</strong> addressing multiple objectives and<br />

constraints without relying on user input is the Kreisselmeier–Steinhauser<br />

(K–S) function approach [10, 11]. In this approach, the multiple objective<br />

functions and constraints are combined using the K–S function to form a<br />

single envelope function, which is then optimized. The optimization<br />

procedure presented in this chapter uses the K–S function technique. The<br />

following section briefly describes the K–S function technique.<br />

Kreisselmeier-Steinhauser (K–S) Function Technique<br />

In this technique, the original objective functions and constraints are<br />

modified into reduced objective functions. Depending on whether the<br />

individual objective functions are to be minimized or maximized, these<br />

reduced objective functions assume one <strong>of</strong> the two following forms:<br />

F*kðFÞ ¼ FkðFÞ<br />

Fk0<br />

F*kðFÞ ¼1:0<br />

1:0 gmax40; k ¼ 1; ...; NOBJmin<br />

FkðFÞ<br />

Fk0<br />

gmax40; k ¼ 1; ...; NOBJmax ð1Þ<br />

where Fk0 represents the original value <strong>of</strong> the kth objective function ðFkÞ<br />

calculated at the beginning <strong>of</strong> each optimization cycle and F is the design<br />

variable vector. gmax represents the largest constraint in the original<br />

constraint vector, gjðFÞ, and is held constant during each cycle. NOBJmin<br />

and NOBJmax represent the number <strong>of</strong> objective functions that are to be<br />

minimized or maximized, respectively. The reduced objective functions are<br />

analogous to constraints. Therefore, a new constraint vector, fmðFÞ<br />

(m ¼ 1; 2; ...; M, where M ¼ NC þ NOBJ), that includes the original<br />

constraints and the reduced objective functions is introduced. Here NC is<br />

the total number <strong>of</strong> original constraints. The new objective function to be<br />

minimized is defined as<br />

FKSðFÞ ¼fmax þ 1<br />

r log X<br />

e<br />

M<br />

e<br />

m¼1<br />

rðfmðFÞ fmaxÞ<br />

where fmax is the largest constraint in the new constraint vector fmðFÞ. The<br />

composite function FKSðFÞ, which represents an envelope function <strong>of</strong> the<br />

original objective functions and constraints, can now be minimized using a<br />

suitable unconstrained optimization technique. The parameter r is a<br />

drawdown factor that may vary between optimization cycles. Large values<br />

<strong>of</strong> r ‘‘draw down’’ the K–S function closer to the value <strong>of</strong> the largest<br />

constraint. Typically, r is progressively increased such that the K–S function<br />

Copyright © 2003 Marcel Dekker, Inc.<br />

ð2Þ

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

Saved successfully!

Ooh no, something went wrong!