.png){kind=icon}
Return
An interactive algorithm for multiple criteria constrained sorting problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-017-2418-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Multiple criteria analysis
Constrained sorting
Interactive algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W
Organization
Cited Papers
ShareSaveFas-Fas ligand system as a possible mediator of spermatogenic cell apoptosis in human maturation-arrested testes.png)
Human Cell
Human CellIF0
PREAI
ShareSaveA user-oriented implementation of the ELECTRE-TRI method integrating preference elicitation support
PREAI
ShareSaveShareSaveShareSaveShareSave
View more