An interactive approach for placing alternatives in preference classes

Date

2003-01-16

Author

Köksalan, Mustafa Murat
Ulu, C

Metadata

Show full item record

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

Item Usage Stats

227
views

0
downloads

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 performance of the algorithm applied to four different sets of alternatives.

Subject Keywords

Multiple criteria, Interactive, Preference classes

URI

https://hdl.handle.net/11511/57370

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

DOI

https://doi.org/10.1016/s0377-2217(02)00138-8

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

A Probabilistic and interactive approach to multiple criteria sorting Mutlu, Sinem; Köksalan, Murat; Serin, Yaşar Yasemin; Department of Industrial Engineering (2015) In this thesis, we develop a method in order to assign alternatives that are evaluated by multiple criteria into preference ordered classes probabilistically. Our motivation is that; when there are large sets of alternatives, placement could be realized in a fast and effective way based on a reasonable misclassification ratio. We assume that the underlying utility function of Decision Maker (DM) is additive. We first ask DM to place reference alternatives into the classes. We develop an interactive probabil...
An interactive procedure for selecting acceptable alternatives in the presence of multiple criteria Ulu, C; Köksalan, Mustafa Murat (Wiley, 2001-10-01) In this paper, we consider the multiple criteria decision-making problem of partitioning alternatives into acceptable and unacceptable sets. We develop interactive procedures for the cases when the underlying utility function of the decision maker is linear, quasiconcave, and general monotone. We present an application of the procedures to the problem of admitting students to the master's degree program at the Industrial Engineering Department, Middle East Technical University. (C) 2001 John Wiley & Sons, Inc.
An interactive ranking-based multi-criteria choice algorithm with filtering: Applications to university selection Karakaya, Gülşah (Orta Doğu Teknik Üniversitesi (Ankara, Turkey), 2019-6) 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 nume...
An evolutionary metaheuristic for approximating preference-nondominated solutions Koekalan, Murat; Phelps, Selcen (Pamuk) (2007-03-01) We propose an evolutionary metaheuristic for approximating the preference-nondominated solutions of a decision maker in multiobjective combinatorial problems. The method starts out with some partial preference information provided by the decision maker, and utilizes an individualized fitness function to converge toward a representative set of solutions favored by the information at hand. The breadth of the set depends on the precision of the partial information available on the decision maker's preferences....
A probabilistic multiple criteria sorting approach based on distance functions ÇELİK, BİLGE; Karasakal, Esra; İyigün, Cem (2015-05-01) In this paper, a new probabilistic distance based sorting (PDIS) method is developed for multiple criteria sorting problems. The distance to the ideal point is used as a criteria disaggregation function to determine the values of alternatives. These values are used to sort alternatives into the predefined classes. The method also calculates probabilities that each alternative belong to the predefined classes in order to handle alternative optimal solutions. It is applied to five data sets and its performanc...

Citation Formats

M. M. Köksalan and C. Ulu, “An interactive approach for placing alternatives in preference classes,” EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, pp. 429–439, 2003, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57370.