By Topic

Progressively interactive evolutionary multi-objective optimization method using generalized polynomial value functions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Sinha, A. ; Sch. of Econ., Dept. of Bus. Technol., Aalto Univ., Helsinki, Finland ; Deb, K. ; Korhonen, P. ; Wallenius, J.

This paper advances and evaluates a recently proposed progressively interactive evolutionary multi-objective optimization algorithm. The algorithm uses preference information from the decision maker during the intermediate generations of the EMO and produces the most preferred solution on the Pareto-optimal front. The progress towards the Pareto-optimal front is made by approximating decision maker's value function. In this paper, a generalized polynomial value function has been proposed and the procedure to fit the value function to the decision maker's preference information has been described. The generality of the procedure of fitting a value function to the decision maker's preferences has been shown by using other existing value functions from the literature. The proposed generic polynomial value function has been incorporated in the PI-EMO-VF algorithm to efficiently approximate the decision maker's value function. The paper then evaluates the performance of the PI-EMO-VF algorithm on three and five objective test problems with constraints. It also evaluates the efficacy of the procedure in producing the most preferred solution when the decision maker is unable to provide perfect information, i.e., the decision maker finds certain pairs of solutions in the objective space to be incomparable. Results have been presented for three and five objective constrained test problems using the procedure.

Published in:

Evolutionary Computation (CEC), 2010 IEEE Congress on

Date of Conference:

18-23 July 2010