Weighted sum model with partial preference information: Application to multi-objective optimization

doi:10.1016/j.ejor.2017.01.003

Return

Weighted sum model with partial preference information: Application to multi-objective optimization

2017-07-01

PRE

Sami Kaddani *

Daniel Vanderpooten

J.-M. Vanpeperstraete

Hassene Aissi

DOI：10.1016/j.ejor.2017.01.003

Original

Original request for help

Save

Abstract

En 中文

Multi-objective optimization problems often lead to large nondominated sets, as the size of the problem or the number of objectives increases. Generating the whole nondominated set requires significant computation time, while most of the corresponding solutions are irrelevant to the decision maker (DM). Optimizing an aggregation function reduces the computation time and produces one or a very limited number of more focused solutions. This requires, however, the elicitation of precise preference parameters, which is often difficult and partly arbitrary, and might discard solutions of interest. An intermediate approach consists in using partial preference information with an aggregation function. In this work, we present a preference relation based on the weighted sum aggregation, where weights are not precisely defined. We give some properties of this preference relation and define the set of preferred points as the set of nondominated points with respect to this relation. We provide an efficient and generic way of generating this preferred set using any standard multi-objective optimization algorithm. This approach shows competitive performances both on computation time and quality of the generated preferred set. (C) 2017 Elsevier B.V. All rights reserved.

Keywords:

Multiple objective programming

Weighted sum

Partial preference information

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.