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.

the aposteriori approach. This approach makes it necessary for the algorithm to produce<br />

the entire set of approximate Pareto-optimal solutions so that a decision making process<br />

can be executed.<br />

Some EMO researchers adopt a particular multiple criteria decision-making (MCDM)<br />

approach (apriori approach) to avoid the problems associated with finding the entire<br />

front. In such an approach the entire Pareto-optimal set is not aimed at rather a<br />

crowded set of Pareto-optimal solutions near the most preferred solution is targeted. In<br />

this approach the decision maker interacts at the beginning of an EMO run. The conedomination<br />

based EMO [6, 1], biased niching based EMO [7], reference point based<br />

EMO approaches [8, 9], the reference direction based EMO [10], the light beam approach<br />

based EMO [11] are a few attempts in this direction.<br />

In a semi-interactive EMO approach, the decision maker is involved iteratively [13,<br />

14] in the optimization process. Some preference information (in terms of reference<br />

points or reference directions or others) is accepted from the decision maker and an<br />

MCDM-based EMO algorithm is employed to find a set of preferred Pareto-optimal<br />

solutions. Thereafter, a few representative preferred solutions are shown to the DM and<br />

a second set of preference information in terms of new reference points or new reference<br />

directions is obtained and a second MCDM-based EMO run is made. This procedure is<br />

continued till a satisfactory solution is found.<br />

However, the decision maker could be integrated with the optimization run of an<br />

EMO algorithm in a much more effective way, as shown in recent studies [4, 15]. These<br />

approaches require progressive interaction with the decision maker during the intermediate<br />

generations of the optimization process to converge towards the most preferred<br />

solution. Such a progressively interactive EMO approach (PI-EMO), allows the decision<br />

maker to modify her/his preference structure as new solutions evolve, thus making<br />

the process more DM-oriented.<br />

This paper discusses a simple PI-EMO where the decision maker is provided with<br />

a set of points perodically and asked to pick the most preferred solution from the set.<br />

Each time the decision maker is asked to make a choice of the most preferred solution,<br />

we call the instance as a ‘DM call’. With the information obtained from the decision<br />

maker a polyhedral cone is constructed and the domination principle is modified. The<br />

obtained polyhedral cone is further utilized to figure out a direction in which a local<br />

search is performed to determine the termination of the PI-EMO algorithm. The PI-<br />

EMO concept has been integrated with the NSGA-II algorithm [18] and the working<br />

of the algorithm has been demonstrated on three test problems having two, three and<br />

five objectives. A parametric study of the algorithm has also been done to determine the<br />

overall working of the algorithm.<br />

2 Past Studies on <strong>Progressively</strong> <strong>Interactive</strong> Methods<br />

Towards the methodologies involving a progressive use of preference information by<br />

involving a decision-maker in an evolutionary multi-objective optimization framework,<br />

there are not many studies yet. Some recent studies periodically presented to the DM<br />

one or more pairs of alternative points found by an EMO algorithm and expected the<br />

DM to provide some preference information about the points. Some of the work in this<br />

59

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

Saved successfully!

Ooh no, something went wrong!