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

Create successful ePaper yourself

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

the problem with τ = −1 later. Figure 23 shows the final archive solutions from a<br />

typical run, indicating the efficiency of our procedure. Our earlier BLEMO algorithm<br />

(DebandSinha,2009a)couldonlysolveatmostafour-variableversionofthisproblem.<br />

The hypervolumes for the obtained attainment surfaces are 0.5776, 0.6542 and 0.6629,<br />

F2<br />

0.4<br />

0.2<br />

0<br />

−0.2<br />

−0.4<br />

−0.6<br />

−0.8<br />

−1<br />

−0.2 0 0.2 0.4<br />

F1<br />

0.6 0.8 1 1.2<br />

Figure 23: Final archive solutions for<br />

problemDS2.<br />

F2<br />

0.4<br />

0.2<br />

0<br />

−0.2<br />

−0.4<br />

−0.6<br />

−0.8<br />

−1<br />

−0.2 0 0.2 0.4<br />

F1<br />

0.6 0.8 1 1.2<br />

Figure24: Attainmentsurfaces(0%,50%,<br />

75%and 100%)for problemDS2 from21<br />

runs.<br />

respectively. The 0%, 50%, and 75% attainment surfaces (Figure 24) are very close to<br />

each other, indicating that at least 75% of the runs are close to each other. The gap<br />

between75% and 100%attainment surfacesindicates that a few solutions arefound to<br />

benot soclose tothe true Pareto-optimalfrontierinthis problem.<br />

Figure 25 confirms that Nu = 400 is the best choice of Nu to achieve a similar<br />

hypervolume measure with the smallest number of overall function evaluations. The<br />

right side plot of Figure 22 shows that Nl and tl starts with large values but drops to<br />

smallvaluesadaptivelytomaketheoptimizationprocessefficientandcomputationally<br />

fast.<br />

6.6 ProblemDS3<br />

This problem has 20 variables. Thus, we have used Nu = 400. Figure 26 shows the<br />

final archive population and Figure 27 shows corresponding attainment surface plot.<br />

Our earlier algorithm was able to solve a maximum of eight-variable version of this<br />

problem. The hypervolumes for the attainment surfaces are 0.5528, 0.5705and 0.5759,<br />

respectively. All 21 runs find the entire Pareto-optimal front with a maximum differencein<br />

hypervolume valueof about4%.<br />

6.7 ProblemDS4<br />

This problem is considered for 10 variables; thus we use Nu = 200. Figures 28 and<br />

29 show the archive population and the attainment surface for this problem. The hypervolumes<br />

for the obtained attainment surfaces are 0.5077,0.5241and 0.5264,respectively.<br />

The maximum difference in hypervolume measures in 21 runs is about 3.6%<br />

only, indicating the robustness of the proposedprocedure.<br />

103

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

Saved successfully!

Ooh no, something went wrong!