The Comparison of Multi-Objective Preference Inference Based on Lexicographic and Weighted Average models
Refereed Conference Meeting Proceeding
In this paper, we consider the effect of different order relations on the solutions of Multi-Objective Constraint Optimization Problems (MOCOP) with tradeoffs, where the tradeoffs are given in the form of elicited or observed preferences over alternatives. In MOCOP, alternatives are evaluated on a number of objectives (utility scales) and thus correspond to utility vectors; the set of optimal solutions corresponds to the set of undominated alternatives with respect to some order relation on the utility vectors. Thus, the choice of an order relation on the utility vectors is crucial; a strong order relation results in a smaller set of solutions which can be helpful for the decision maker. Our focus lies on the comparison between Pareto, weighted average and lexicographic orderings. We show that every inference that can be made from a set of given preferences considering weighted average orders can be made for lexicographic orders as well. Further results on the relation between the sets of optimal solutions corresponding to lexicographic and weighted average orders are established under the distinction between strict and non-strict preferences. For solving MOCOP, we apply variants of Preference Inference for the different order relations as dominance checks. Our experimental results show that lexicographic orders give much stronger inferences than Pareto and weighted average orders. However, the lexicographic order based algorithm also results in a longer running time than the other two.
International Conference on Tools with Artificial Intelligence (ICTAI) 2015
Digital Object Identifer (DOI):
National University of Ireland, Cork (UCC)
Open access repository: