An interactive algorithm for multiple criteria constrained sorting problem

In this study, we consider the multiple criteria constrained sorting problem and propose an interactive algorithm. The problem is to assign alternatives evaluated on multiple criteria to sorted categories where categories may have size restrictions. The proposed interactive algorithm determines the...

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research Vol. 267; no. 1-2; pp. 447 - 466
Main Authors: Özpeynirci, Selin, Özpeynirci, Özgür, Mousseau, Vincent
Format: Journal Article
Language:English
Published: New York Springer US 01.08.2018
Springer
Springer Nature B.V
Springer Verlag
Subjects:
Algorithms
Business and Management
Categories
Classification
Combinatorics
Computer Science
Mathematical research
Multiple criteria decision making
Multiple criterion
Multiple Objective Optimization
Operations Research
Operations Research/Decision Theory
Optimization theory
Sorting algorithms
Studies
Theory of Computation
Interactive algorithm
Multiple criteria analysis
Constrained sorting
ISSN:0254-5330, 1572-9338
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this study, we consider the multiple criteria constrained sorting problem and propose an interactive algorithm. The problem is to assign alternatives evaluated on multiple criteria to sorted categories where categories may have size restrictions. The proposed interactive algorithm determines the eligible categories for each alternative and the alternatives with a single eligible category are assigned to the corresponding categories. In case of no such alternative exists, the algorithm asks the DM to assign an alternative to a category and proceeds. The algorithm has the capability to detect and resolve any inconsistencies that may arise during the iterations. We implement the algorithm on two different real life problems considering two underlying sorting methods, MR-Sort and UTADIS and present the computational results.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-017-2418-2