.png){kind=icon}
返回
An interactive approach for multiple criteria selection problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2016.09.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this study, we develop an interactive algorithm for the multiple criteria selection problem that aims to find the most preferred alternative among a set of known alternatives evaluated on multiple criteria. We assume the decision maker (DM) has a quasi-concave value function that represents his/her preferences. The interactive algorithm selects the pairs of alternatives to be asked to the DM based on the estimated likelihood that one alternative is preferred to another. After the DM selects the preferred alternative, a convex cone is generated based on this preference information and the alternatives dominated by the cone are eliminated. Then, the algorithm updates the likelihood information for the unselected pairwise questions. The aim of the algorithm is to detect the most preferred alternative by performing as few pairwise comparisons as possible. We present the algorithm on an illustrative example problem. We also develop a mathematical model that finds the minimum number of questions that can be asked to the DM to determine the most preferred alternative under perfect information. We use the minimum number of questions to develop strategies for interactive algorithm and measure its performance. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Multiple criteria selection problem
Convex cone
Interactive approach
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏分享收藏
查看更多内容