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.

of the papers is provided in this section.<br />

1.7.1 An <strong>Interactive</strong> <strong>Evolutionary</strong> <strong>Multi</strong>-<strong>Objective</strong> <strong>Optimization</strong><br />

Method Based on <strong>Progressively</strong> Approximated Value Functions<br />

The first paper [10] introduces a preference based optimization algorithm<br />

where decision making is incorporated in an evolutionary multi-objective<br />

search procedure. The algorithm requires preference based information<br />

to be elicited from the decision maker after every few generations. The<br />

decision maker is expected to order a given set of alternatives (five in<br />

number) according to preferences and the information is used to model<br />

a value function which emulates the decision maker and drives the algorithm<br />

towards more preferred solutions in the subsequent generations. A<br />

polynomial value function has been proposed which is quasi-concave in<br />

nature and is used to map the decision maker’s preferences by optimally<br />

setting the parameters. The study suggests a simple optimization problem<br />

which is solved to determine the optimal parameters of the value function.<br />

The search of the evolutionary multi-objective optimization algorithm is<br />

focussed in the region of decision maker’s interest by modifying the domination<br />

criteria based on the preference information. Further, a termination<br />

criterion based on preferences is also suggested. The methodology is<br />

evaluated on two to five objective unconstrained test problems, and the<br />

computational expense and decision maker calls required to arrive at the<br />

final solution are reported. The study also presents results obtained by<br />

emulating a decision maker who is prone to make errors while providing<br />

preference information.<br />

1.7.2 <strong>Progressively</strong> <strong>Interactive</strong> <strong>Evolutionary</strong> <strong>Multi</strong>-<strong>Objective</strong> <strong>Optimization</strong><br />

Method Using Generalized Polynomial Value<br />

Functions<br />

The second paper [28] is an extension of the first paper where the polynomial<br />

value function has been augmented into a generalized polynomial<br />

value function. This equips the approach to fit a wider variety of quasi<br />

concave preference information. Further, the value function fitting procedure<br />

is tested on other commonly used value functions like the Cobb-<br />

Douglas value function and the CES value function, and the generality<br />

of the methodology is shown. Results are computed for constrained test<br />

problems up to five objectives. In this study the efficacy of the algorithm<br />

is also evaluated when the decision maker provides preference informa-<br />

19

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

Saved successfully!

Ooh no, something went wrong!