A multiple criteria sorting approach based on distance functions

Download

index.pdf

Date

2011

Author

Çelik, Bilge

Metadata

Show full item record

Item Usage Stats

188
views

78
downloads

Sorting is the problem of assignment of alternatives into predefined ordinal classes according to multiple criteria. A new distance function based solution approach is developed for sorting problems in this study. The distance to the ideal point is used as the criteria disaggregation function to determine the values of alternatives. These values are used to sort them into the predefined classes. The distance function is provided in general distance norm. The criteria disaggregation function is determined according to the sample preference set provided by decision maker. Two mathematical models are used in order to determine the optimal values and assign classes. The method also proposes an approach for handling alternative opt imal solutions, which are widely seen in sorting problems. Probabilities of belonging to each class for an alternative are calculated using the alternative optimal solutions and provided as the outputs of the model. Decision maker assigns the alternatives into classes according to these probabilities. The method is applied to five data sets and results are provided for different performance measures. Different distance norms are tried for each data set and their performances are evaluated for each data set. The probabilistic approach is also applied to UTADIS. The performance of the distance based model and modified UTADIS are compared with the previous sorting methods such as UTADIS and classification tree. The developed method has new aspects such as using distances to ideal point for sorting purpose and providing probabilities of belonging to classes. The handling of alternative optimal solutions within the method instead of a post-optimality analysis is another new and c ritical aspect of the study.

Subject Keywords

Mathematical analysis, Numerical analysis

URI

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

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 Mathematical programming evaluation approach for multiple criteria sorting problems Civelek, Merve; Karasakal, Esra; Department of Operational Research (2019) 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 metho...
A discontinuous subgrid eddy viscosity method for the time-dependent Navier-Stokes equations Kaya Merdan, Songül (Society for Industrial & Applied Mathematics (SIAM), 2005-01-01) In this paper we provide an error analysis of a subgrid scale eddy viscosity method using discontinuous polynomial approximations for the numerical solution of the incompressible Navier-Stokes equations. Optimal continuous in time error estimates of the velocity are derived. The analysis is completed with some error estimates for two fully discrete schemes, which are first and second order in time, respectively.
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...
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

B. Çelik, “A multiple criteria sorting approach based on distance functions,” M.S. - Master of Science, Middle East Technical University, 2011.