Multi-Criteria Sorting with Category Size Restrictions

Date

2017-01-01

Author

Köksalan, Mustafa Murat
Mousseau, Vincent
ÖZPEYNİRCİ, SELİN

Metadata

Show full item record

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

Item Usage Stats

201
views

0
downloads

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 additional variables and constraints to enforce the restrictions on the sizes of categories. The new formulation reduces the number of binary variables and hence decreases the computational effort compared to the existing approaches in the literature. We further improve the computational efficiency by developing lower and upper bounds on the rank of each alternative in order to narrow down the set of categories that each alternative can be assigned to. We demonstrate our approach on two applications from practice.

Subject Keywords

Multi-criteria sorting, Category size, UTADIS, UTADIS-CS

URI

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

Journal

INTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY & DECISION MAKING

DOI

https://doi.org/10.1142/s0219622016500061

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

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 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...
Assignment problem and its variations Gülek, Mehmet; Toroslu, İsmail Hakkı; Department of Computer Engineering (2007) We investigate the assignment problem, which is the problem of matching two sets with each other, optimizing a given function on the possible matchings. Among different definitions, a graph theoretical definition of the linear sum assignment problem is as follows: Given a weighted complete bipartite graph, find a maximum (or minimum) one-to-one matching between the two equal-size sets of the graph, where the score of a matching is the total weight of the matched edges. We investigate extensions and variatio...
Interactive Approaches to Multiple Criteria Sorting Problems: Entropy-Based Question Selection Methods Özarslan, Ali; Karakaya, Gülşah (2022-08-01) In this study, interactive approaches for sorting alternatives evaluated on multiple criteria are developed. The possible category ranges of alternatives are defined by mathematical models iteratively under the assumption that the preferences of the decision maker (DM) are consistent with an additive utility function. Simulation-based and model-based parameter generation methods are proposed to hypothetically assign the alternatives to categories. A practical approach to solve the incompatibility problem of...
Nonlinearity preserving post-transformations Sertkaya, İsa; Doğanaksoy, Ali; Department of Cryptography (2004) Boolean functions are accepted to be cryptographically strong if they satisfy some common pre-determined criteria. It is expected that any design criteria should remain invariant under a large group of transformations due to the theory of similarity of secrecy systems proposed by Shannon. One of the most important design criteria for cryptographically strong Boolean functions is the nonlinearity criterion. Meier and Staffelbach studied nonlinearity preserving transformations, by considering the invertible t...

Citation Formats

M. M. Köksalan, V. Mousseau, and S. ÖZPEYNİRCİ, “Multi-Criteria Sorting with Category Size Restrictions,” INTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY & DECISION MAKING, pp. 5–23, 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57761.