An interactive ranking-based multi-criteria choice algorithm with filtering: Applications to university selection

Download

1054-6571-3-PB.pdf

Date

2019-6

Author

Karakaya, Gülşah

Metadata

Show full item record

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

Item Usage Stats

295
views

91
downloads

In this study, we develop an interactive algorithm to converge to the most preferred alternative of a decision maker (DM) among a set of discrete alternatives. The algorithm presents a limited number of alternatives to the DM and collects preference ranking of them iteratively. The preferences are modeled by a flexible and realistic preference function. To improve the performance, the alternatives presented are determined by a filtering method. We compare our algorithm with benchmark algorithms on numerous data sets from Quacquarelli Symonds, a higher education marketing company that reports annual rankings of universities under different categories. The results show that our algorithm outperforms the benchmark algorithms.

Subject Keywords

Multiple criteria decision making, Ranking, Interactive method, Filtering

URI

http://www2.feas.metu.edu.tr/metusd/ojs/index.php/metusd/article/view/1054
https://hdl.handle.net/11511/58120

Journal

ODTÜ Gelişme Dergisi

Collections

Department of Economics, Article

Suggestions

OpenMETU
Core

An interactive algorithm to find the most preferred solution of multi-objective integer programs LOKMAN, BANU; Köksalan, Mustafa Murat; Korhonen, Pekka J.; Wallenius, Jyrki (Springer Science and Business Media LLC, 2016-10-01) In this paper, we develop an interactive algorithm that finds the most preferred solution of a decision maker (DM) for multi-objective integer programming problems. We assume that the DM's preferences are consistent with a quasiconcave value function unknown to us. Based on the properties of quasiconcave value functions and pairwise preference information obtained from the DM, we generate constraints to restrict the implied inferior regions. The algorithm continues iteratively and guarantees to find the mos...
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...
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 ...
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...
An interactive approach for placing alternatives in preference classes Köksalan, Mustafa Murat; Ulu, C (2003-01-16) In this paper, we consider the multiple criteria decision making problem of partitioning alternatives into preference classes. We develop an interactive procedure based on the assumption that the decision maker (DM) has a linear utility function. The approach requires the DM to place an alternative in a preference class from time to time. Based on the preference information derived from the DM's placement as well as from dominance and linearity, we try to place other alternatives. We present results on the ...

Citation Formats

G. Karakaya, “An interactive ranking-based multi-criteria choice algorithm with filtering: Applications to university selection,” ODTÜ Gelişme Dergisi, vol. 46, no. 1, pp. 17–46, 2019, Accessed: 00, 2020. [Online]. Available: http://www2.feas.metu.edu.tr/metusd/ojs/index.php/metusd/article/view/1054.