计算机科学
群体决策
竞赛
运筹学
秩(图论)
排名(信息检索)
过程(计算)
管理科学
数据挖掘
数学优化
机器学习
数学
法学
操作系统
组合数学
经济
政治学
作者
Xin Chen,Weiqing Xu,Haiming Liang,Yucheng Dong
标识
DOI:10.1080/01605682.2019.1609888
摘要
In multi-attribute group decision-making problem (MAGDM), the existing consensus reaching process (CRP) is to obtain a consensus ranking of alternatives. However, these CRPs contradict some real-life MAGDM problems in which decision-makers do not need to rank alternatives and hope to classify the alternatives into several groups instead. Thus, in this paper we propose a new CRP in MAGDM, called the classification-based consensus reaching process (CCRP). First, we present a feedback method with minimum adjustments to generate the optimal adjusted individual matrices via a 0–1 mixed linear programming model for CCRP. Subsequently, we develop the interactive consensus reaching process based on the feedback method with minimum adjustments in CCRP. Finally, a practical example from China Undergraduate Mathematical Contest in Modeling and a simulation analysis are conducted to demonstrate the validity of the proposed CCRP.
科研通智能强力驱动
Strongly Powered by AbleSci AI