A Mathematical programming evaluation approach for multiple criteria sorting problems

Download

index.pdf

Date

2019

Author

Civelek, Merve

Metadata

Show full item record

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

Item Usage Stats

232
views

113
downloads

Multiple criteria sorting problem is to assign alternatives, evaluated according to multiple criteria, into predefined preference ordered classes. In this study, a new distance metric based sorting method is developed to solve multiple criteria sorting problems without specifying class thresholds between preference-ordered classes. The aim of the proposed method is to assign each alternative to one class or a set of possible adjacent classes considering the distance to class centroids. In the proposed method, two cases are considered. In the first case, centroids of the classes are estimated using the whole data set. In the second case, class centroids are estimated using only the training data set. Distance of alternatives to the centroids are used as criteria aggregation function. A mathematical model is formulated to determine the weights of the criteria. Assignment is performed according to the weighted distance of each alternative to each class centroids. The proposed method is applied to five data sets with four different distance norms and several performance measures are calculated. The results show that centroid information is not so important to obtain better performances. The performance of the proposed method is compared with PDIS method and UTADIS method. The computational studies show that with relatively large data sets the proposed method performed better than the other methods.

Subject Keywords

Decision making., Multi Criteria Sorting, Distance Function, Distance Based Sorting, Sorting without Class Threshold.

URI

http://etd.lib.metu.edu.tr/upload/12624282/index.pdf
https://hdl.handle.net/11511/44390

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

A Mathematical Programming Approach for Multiple Criteria Sorting Problems Civelek, Merve; Karasakal, Esra (2019-06-16) Multiple criteria sorting problem is to assign alternatives, evaluated according to multiple criteria, into predefined preference ordered classes. In this study, a new distance metric based sorting method is developed to solve multiple criteria sorting problems. The aim of the proposed method is to assign each alternative to one class or a set of possible adjacent classes. In the proposed method, centroids of the classes are estimated using sample preference set provided by the decision maker. Distance to t...
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...
Multi-Criteria Sorting with Category Size Restrictions Köksalan, Mustafa Murat; Mousseau, Vincent; ÖZPEYNİRCİ, SELİN (2017-01-01) We consider the multi-criteria sorting problem where alternatives that are evaluated on multiple criteria are assigned into ordered categories. We focus on the sorting problem with category size restrictions, where the decision maker (DM) may have some concerns or constraints on the number of alternatives that should be assigned to some of the categories. We develop an approach based on the UTADIS method that fits an additive utility function to represent the decision maker's preferences. We introduce addit...
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...
An interactive probabilistic approach to multi-criteria sorting BUGDACI, Asli Gul; KOKSALAN, Murat; Ozpeynirci, Selin; Serin, Yaşar Yasemin (2013-10-01) This article addresses the problem of sorting alternatives evaluated by multiple criteria among preference-ordered classes. An interactive probabilistic sorting approach is developed in which the probability of an alternative being in each class is calculated and alternatives are assigned to classes keeping the probability of incorrect assignments below a specified small threshold value. The decision maker is occasionally required to place alternatives to classes. The probabilities for unassigned alternativ...

Citation Formats

M. Civelek, “A Mathematical programming evaluation approach for multiple criteria sorting problems,” Thesis (M.S.) -- Graduate School of Informatics. Operational Research., Middle East Technical University, 2019.