Please use this identifier to cite or link to this item:
Title: Incorporating the notion of relative importance of objectives in evolutionary multiobjective optimization
Authors: Rachmawati, L.
Srinivasan, D. 
Keywords: Genetic algorithm
multiobjective optimization
relative importance of objectives
Issue Date: Aug-2010
Citation: Rachmawati, L., Srinivasan, D. (2010-08). Incorporating the notion of relative importance of objectives in evolutionary multiobjective optimization. IEEE Transactions on Evolutionary Computation 14 (4) : 530-546. ScholarBank@NUS Repository.
Abstract: 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. © 2010 IEEE.
Source Title: IEEE Transactions on Evolutionary Computation
ISSN: 1089778X
DOI: 10.1109/TEVC.2009.2036162
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Dec 12, 2018


checked on Dec 12, 2018

Page view(s)

checked on Nov 3, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.