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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annals of operations research Ročník 267; číslo 1-2; s. 447 - 466
Hlavní autoři: Özpeynirci, Selin, Özpeynirci, Özgür, Mousseau, Vincent
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.08.2018
Springer
Springer Nature B.V
Springer Verlag
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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