Finding preferred solutions under weighted Tchebycheff preference functions for multi-objective integer programs

Date

2023-07-01

Author

Karakaya, Gülşah
Köksalan, M.

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

203
views

0
downloads

Many interactive approaches in multi-objective optimization assume the existence of an underlying preference function that represents the preferences of a decision maker (DM). In this paper, we develop the theory and an exact algorithm that guarantees finding the most preferred solution of a DM whose preferences are consistent with a Tchebycheff function for multi-objective integer programs. The algorithm occasionally presents pairs of solutions to the DM and asks which one is preferred. It utilizes the preference information together with the properties of the Tchebycheff function to generate solutions that are candidates to be the most preferred solution. We test the performance of the algorithm on a set of three and four-objective combinatorial optimization problems.

Subject Keywords

Interactive approach, Multiple objective programming, Preferred solution, Tchebycheff function

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85145172097&origin=inward
https://hdl.handle.net/11511/102369

Journal

European Journal of Operational Research

DOI

https://doi.org/10.1016/j.ejor.2022.11.043

Collections

Department of Business Administration, Article

Suggestions

OpenMETU
Core

An interactive approximation algorithm for multi-objective integer programs Lokman, Banu; Korhonen, Pekka J.; Wallenius, Jyrki (2018-08-01) We develop an interactive algorithm that approximates the most preferred solution for any multi-objective integer program with a desired level of accuracy, provided that the decision maker's (DM's) preferences are consistent with a nondecreasing quasiconcave value function. Using pairwise comparisons of the DM, we construct convex cones and eliminate the inferior regions that are close to being dominated by the cones in addition to the regions dominated by the cones. The algorithm allows the DM to change th...
Evaluating solutions and solution sets under multiple objectives Köksalan, M.; Karakaya, Gülşah (2021-10-01) In this study we address evaluating solutions and solution sets that are defined by multiple objectives based on a function. Although any function can be used, we focus on mostly weighted Tchebycheff functions that can be used for a variety of purposes when multiple objectives are considered. One such use is to approximate a decision maker's preferences with a Tchebycheff utility function. Different solutions can be evaluated in terms of expected utility conditional on weight values. Another possible use is...
An Interactive partitioning approach for multiobjective decision making under a general monotone utility function Karasakal, Esra (2013-09-01) We develop an interactive partitioning approach for solving the multiobjective decision making problem of a decision maker (DM) who has an implicit general monotone utility function. The approach reduces feasible solution space using the DM's preferences. Hypothetical solutions called partition ideals (PIs) that dominate portions of the efficient frontier are generated and those that are inferior to a feasible solution are used to eliminate the dominated regions. We investigate the issues in representation ...
Interactive approaches for biobjective problems with progressively changing solution sets Karakaya, Gülşah (Wiley, 2021-01-01) In this study, we develop interactive approaches to find a satisfactory alternative of a decision maker (DM) having a quasiconvex preference function where the alternative set changes progressively. In this environment, we keep searching the available set of alternatives and estimating the preference function of the DM. As new alternatives emerge, we make better use of the available preference information and eventually converge to a preferred alternative of the DM. We test our approaches on biobjective, mu...
An interactive approach for biobjective integer programs under quasiconvex preference functions Ozturk, Diclehan Tezcaner; Köksalan, Mustafa Murat (2016-09-01) We develop an interactive algorithm for biobjective integer programs that finds the most preferred solution of a decision maker whose preferences are consistent with a quasiconvex preference function to be minimized. During the algorithm, preference information is elicited from the decision maker. Based on this preference information and the properties of the underlying quasiconvex preference function, the algorithm reduces the search region and converges to the most preferred solution progressively. Findin...

Citation Formats

G. Karakaya and M. Köksalan, “Finding preferred solutions under weighted Tchebycheff preference functions for multi-objective integer programs,” European Journal of Operational Research, vol. 308, no. 1, pp. 215–228, 2023, Accessed: 00, 2023. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85145172097&origin=inward.