30.07.2013 Views

Progressively Interactive Evolutionary Multi-Objective Optimization ...

Progressively Interactive Evolutionary Multi-Objective Optimization ...

Progressively Interactive Evolutionary Multi-Objective Optimization ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

4.5.2 ProblemDS1<br />

This problemhas 2K variableswith K real-valuedvariableseachfor lower and upper<br />

levels. Sinceinthis studyweconsider bileveloptimizationproblemshaving m = M =<br />

2,thevectors u, tand sallhaveasingleelement. Following threeparametricfunctions<br />

areused forDS1:<br />

Step1: Here, one of the upper level variables y1 is chosen as u. The mapping ΦU is<br />

chosen as follows: v1 = (1 + r) − cos(πy1) and v2 = (1 + r) − sin(πy1) (r is a<br />

user-supplied constant). Depending on the value of y1, the v1-v2 point lies on the<br />

quarterofacircleofradiusoneandcenterat (1 + r, 1 + r)inthe F-space,asshown<br />

inFigure 4.<br />

Step2: For every (v1, v2) point on the F-space,<br />

<br />

the following one-dimensional<br />

<br />

(t) envelope<br />

is chosen: v1(y1) = −r cos t and v2(y1) = −r sin t , where<br />

γ π<br />

2<br />

y1<br />

t ∈ [0, y1] and γ (=1) is a constant. The envelope is a quarter of a circle of radius<br />

r and center located at (v1, v2) point. Although for each (v1, v2) point, the entire<br />

envelope (quarter circle)is a non-dominated front, when all (v1, v2) points are<br />

considered, only one point from each envelope qualifies to be on the upper level<br />

Pareto-optimal front. Thus, the Pareto-optimal front for the upper level problem<br />

lies on the quarter of a circle having radius (1 + r) and center at (1 + r, 1 + r) on<br />

the F-space,as indicatedinthe figure.<br />

Step3: Each U1-U2 pointisthenmappedtoa(f ∗ 1 , f ∗ 2 )pointbythefollowing mapping:<br />

f ∗ 1 = s2 , f ∗ 2 = (s − y1) 2 ,where s = t is assumed.<br />

Step4: We donot use any function lj here.<br />

Step5: But, weuse Ej = (yj − j−1<br />

2 )2 for j = 2, . . . , K inthe upperlevelproblem. This<br />

willensurethat yj = (j − 1)/2(for j = 2, . . . , K)willcorrespondtotheupperlevel<br />

Pareto-optimalfront.<br />

Step6: Different lj and Lj termsareusedwith (K−1)remainingupperandlowerlevel<br />

variablessuchthatalllowerlevelPareto-optimalsolutions mustsatisfy xi = yi for<br />

i = 2, . . . , K.<br />

The complete DS1problemis givenbelow:<br />

Minimize F(y, x) =<br />

⎛<br />

(1 + r − cos(απy1)) +<br />

⎜<br />

⎝<br />

K j−1<br />

j=2 (yj −<br />

+τ K i=2 (xi − yi)2 <br />

− r cos<br />

(1 + r − sin(απy1)) + K j−1<br />

j=2 (yj<br />

<br />

−<br />

<br />

+τ K<br />

i=2 (xi − yi)2 − r sin<br />

2 )2<br />

γ π x1<br />

2 y1<br />

γ π<br />

2<br />

x1<br />

y1<br />

2 )2<br />

−K ≤ xi ≤ K, for i = 1, . . . , K,<br />

1 ≤ y1 ≤ 4, −K ≤ yj ≤ K, j = 2, . . . , K.<br />

γ π<br />

2<br />

⎞<br />

⎟<br />

⎠ ,<br />

subjectto (x) ∈ argmin f(x) =<br />

⎧<br />

(x) ⎛<br />

⎪⎨<br />

x<br />

⎜<br />

⎝<br />

⎪⎩<br />

2 1 + K i=2 (xi − yi)2<br />

+ ⎞⎫<br />

⎪⎬<br />

K<br />

π<br />

i=2 10(1 − cos( (xi − yi))) ⎟<br />

K ⎟<br />

K<br />

i=1 (xi − yi)2<br />

⎠ ,<br />

⎪⎭<br />

y1<br />

+ K π<br />

i=2 10| sin( (xi − yi)|<br />

K<br />

(7)<br />

For this test problem, we suggest K = 10 (overall 20 variables), r = 0.1, α = 1, γ = 1,<br />

and τ = 1. Since τ = 1 is used, for every lower level Pareto-optimal point, xi = yi for<br />

i = 2, . . . , K andboth lj and Lj terms arezero,thereby making anagreement between<br />

this relationship betweenoptimal values of xi and yi variablesinboth levels.<br />

Aninterestingscenariohappenswhen τ = −1isset. Ifany xisnotPareto-optimal<br />

to a lower level problem (meaning xi = yi for i = 2, . . . , K), a positive quantity is<br />

85

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

Saved successfully!

Ooh no, something went wrong!