.png){kind=icon}
返回
Integer Programming Models to Manage Consensus for Uncertain MCGDM Based on PSO Algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/TFUZZ.2018.2866827.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In existing consensus models with optimization approaches, the modified preferences are often virtual values unrelated to the original rating scale. Furthermore, few optimization approaches have been developed to specifically deal with the consensus reaching process in uncertain multiple-criteria group decision making (MCGDM) problems. To investigate these issues, this paper is primarily interested in MCGDM optimization consensus models, in which the uncertain information can be represented using interval numbers. Integer optimization consensus models are established based on both the Manhattan distance and the Euclidean distance, and an antithetic-method-based particle swarm optimization algorithm is used to solve the nonlinear integer programming problems. Compared to existing approaches, the main characteristic of the proposed consensus models is that the generated preferences all belong to the original scales. A numerical example is given to validate the proposed models, and further simulation analyses shed light on the behavior of the developed models.
Keyword:
Consensus model
distance function
group decision making (GDM)
interval number
optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
11.9
论文数:
5.0K
被引数:
2.9W
机构
引用论文
.png){kind=icon}
分享收藏Statistical validation of HZETRN as a function of vertical cutoff rigidity using ISS measurements
PREAI
分享收藏分享收藏A new measure of consensus with reciprocal preference relations: The correlation consensus degree
PREAI
分享收藏
查看更多内容