By Topic

Incorporating the Notion of Relative Importance of Objectives in Evolutionary Multiobjective Optimization

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

2 Author(s)
Rachmawati, L. ; Dept. of Electr. & Comput. Eng., Nat. Univ. of Singapore, Singapore, Singapore ; Srinivasan, D.

This paper describes the use of decision maker preferences in terms of the relative importance of objectives in evolutionary multiobjective optimization. A mathematical model of the relative importance of objectives and an elicitation algorithm are proposed, and three methods of incorporating explicated preference information are described and applied to standard test problems in an empirical study. The axiomatic model proposed here formalizes the notion of relative importance of objectives as a partial order that supports strict preference, equality of importance, and incomparability between objective pairs. Unlike most approaches, the proposed model does not encode relative importance as a set of real-valued parameters. Instead, the approach provides a functional correspondence between a coherent overall preference with a subset of the Pareto-optimal front. An elicitation algorithm is also provided to assist a human decision maker in constructing a coherent overall preference. Besides elicitation of a priori preference, an interactive facility is also furnished to enable modification of overall preference while the search progresses. Three techniques of integrating explicated preference information into the well-known Non-dominated Sorting Genetic Algorithm (NSGA)-II are also described and validated in a set of empirical investigation. The approach allows a focus on a subset of the Pareto-front. Validations on test problems demonstrate that the preference-based algorithm gained better convergence as the dimensionality of the problems increased.

Published in:

Evolutionary Computation, IEEE Transactions on  (Volume:14 ,  Issue: 4 )