Group decision making in best-worst method when the best and worst are not unique: case study of scholar selection

被引:0
|
作者
Adali, Esra Aytac [1 ]
Caglar, Atalay [2 ]
机构
[1] Pamukkale Univ, Fac Econ & Adm Sci, Dept Business Adm, Denizli, Turkiye
[2] Pamukkale Univ, Fac Econ & Adm Sci, Dept Econometr, Denizli, Turkiye
来源
PAMUKKALE UNIVERSITY JOURNAL OF ENGINEERING SCIENCES-PAMUKKALE UNIVERSITESI MUHENDISLIK BILIMLERI DERGISI | 2023年 / 29卷 / 01期
关键词
Scholarship student selection; MCDM; BWM; CoCoSo; PRIORITIZATION; BWM;
D O I
10.5505/pajes.2022.08043
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Scholarships for the students are the financial supports provided by the government or institutions. There may be a great number of competing applicants with the knowledge, skills and abilities to successfully fulfill the scholarship needs. So, it is difficult to select the most suitable students among multiple applicants for these providers. In this study, scholarship students' selection is handled as a complex decision making problem, and this problem is solved by integration of two Multi Criteria Decision Making (MCDM) methods, Best-Worst Method (BWM) and COmbined COmpromise SOlution (CoCoSo). In order to demonstrate the applicability of these methods to the scholarship student selection problem, a real problem is solved. This problem is designed as a group decision making problem, and BWM, the improved Analytic Hierarchy Process method, is employed to derive the criteria weights. A solution to the problem where decision makers' best and worst criteria are not common and unique is suggested. On the other hand, CoCoSo method is used for the ranking purposes of the applicants. The novelty of this study is that scholarship selection problem is solved with BWM and CoCoSo methods for the first time. The integrated usage of BWM and CoCoSo methods is thought as suitable and effective methods to rank or select the best candidate or alternative among a number of candidates or alternatives because of satisfactory results.
引用
收藏
页码:30 / 44
页数:15
相关论文
共 50 条
  • [21] Priority ranking for the best-worst method
    Tu, Jiancheng
    Wu, Zhibin
    Pedrycz, Witold
    INFORMATION SCIENCES, 2023, 635 : 42 - 55
  • [22] An analytical framework for the best-worst method
    Wu, Qun
    Liu, Xinwang
    Zhou, Ligang
    Qin, Jindong
    Rezaei, Jafar
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2024, 123
  • [23] A novel intuitionistic fuzzy best-worst method for group decision making with intuitionistic fuzzy preference relations
    Wan, Shu-Ping
    Dong, Jiu-Ying
    Chen, Shyi-Ming
    INFORMATION SCIENCES, 2024, 666
  • [24] A Consensus-Based Best-Worst Method for Multi-criteria Group Decision-Making
    Labella, Alvaro
    Garcia-Zamora, Diego
    Rodriguez, Rosa M.
    Martinez, Luis
    ADVANCES IN BEST-WORST METHOD, BWM2022, 2023, : 48 - 58
  • [25] Building a consensus for the best-worst method in group decision-making with an optimal allocation of information granularity
    Qin, Jindong
    Ma, Xiaoyu
    Liang, Yingying
    INFORMATION SCIENCES, 2023, 619 : 630 - 653
  • [26] Bioethanol facility location selection using best-worst method
    Kheybari, Siamak
    Kazemi, Mostafa
    Rezaei, Jafar
    APPLIED ENERGY, 2019, 242 : 612 - 623
  • [27] Approaches for multicriteria decision-making based on the hesitant fuzzy best-worst method
    Li, Jian
    Niu, Li-li
    Chen, Qiongxia
    Wang, Zhong-xing
    COMPLEX & INTELLIGENT SYSTEMS, 2021, 7 (05) : 2617 - 2634
  • [28] The best-worst method for the study of preferences: Theory and applications
    Marley, Anthony A. J.
    INTERNATIONAL JOURNAL OF PSYCHOLOGY, 2008, 43 (3-4) : 168 - 168
  • [29] The best-worst method for the study of preferences Theory and application
    Marley, A. A. J.
    COGNITION AND NEUROPSYCHOLOGY: INTERNATIONAL PERSPECTIVES ON PSYCHOLOGICAL SCIENCE, VOL 1, 2010, : 147 - 157
  • [30] Robust Optimization of Best-worst Multi-criteria Decision-making Method
    Qu, Deqiang
    Wu, Zhong
    Qu, Shaojian
    Zhang, Fan
    Li, Ping
    JOURNAL OF WEB ENGINEERING, 2020, 19 (7-8): : 1067 - 1088