Demystifying the Stability and the Performance Aspects of CoCoSo Ranking Method under Uncertain Preferences

IF 3.3 4区计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

Informatica Pub Date : 2024-07-23 DOI:10.15388/24-infor565

Sundararajan Dhruva, Raghunathan Krishankumar, Dragan Pamucar, Edmundas Kazimieras Zavadskas, Kattur Soundarapandian Ravichandran

引用次数: 0

Abstract

This paper attempts to demystify the stability of CoCoSo ranking method via a comprehensive simulation experiment. In the experiment, matrices of different dimensions are generated via Python with fuzzy data. Stability is investigated via adequacy and partial adequacy tests. The test passes if the ranking order does not change even after changes are made to entities, and the partial pass signifies that the top ranked alternative remains intact. Results infer that CoCoSo method has better stability with respect to change of alternatives compared to criteria; and CoCoSo method shows better stability with respect to partial adequacy test for criteria. PDF XML

查看原文本刊更多论文

解密不确定偏好下 CoCoSo 排序方法的稳定性和性能问题

本文试图通过一个综合模拟实验来揭开 CoCoSo 排序方法稳定性的神秘面纱。在实验中，不同维度的矩阵通过 Python 生成模糊数据。稳定性通过充分性和部分充分性测试进行研究。如果即使对实体进行了更改，排名顺序也不会发生变化，则测试通过；如果排名靠前的备选方案保持不变，则部分通过。结果推断，与标准相比，CoCoSo 方法在备选方案发生变化时具有更好的稳定性；与标准的部分充分性测试相比，CoCoSo 方法显示出更好的稳定性。PDF XML

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Informatica 工程技术-计算机：信息系统

CiteScore

5.90

自引率

6.90%

发文量

审稿时长

12 months

期刊介绍： The quarterly journal Informatica provides an international forum for high-quality original research and publishes papers on mathematical simulation and optimization, recognition and control, programming theory and systems, automation systems and elements. Informatica provides a multidisciplinary forum for scientists and engineers involved in research and design including experts who implement and manage information systems applications.