犹豫模糊偏好关系中矛盾数据自动修正算法研究  

Research on Automatic Correction Algorithm of Contradictory Data in the Hesitant Fuzzy Preference Relations Matrix

作　　者：王丽芳[1] 付明[2] WANG Li-fang;FU Ming(School of International Trade and Economics,Anhui University of Finance&Economics;School of Management Science and Engineering,Anhui University of Finance&Economics,Bengbu 233030,China)

机构地区：[1]安徽财经大学国际经济贸易学院 [2]安徽财经大学管理科学与工程学院,安徽蚌埠233030

出　　处：《宜春学院学报》2024年第12期4-10,共7页Journal of Yichun University

基　　金：国家社会科学基金项目(编号:23BGL065);安徽省教育厅科学研究重点项目(编号:2022AH050555);安徽省教育厅教育教学研究重点项目(编号:2022jyxm026);安徽省创新人才培养项目(编号:2023zybj013)。

摘　　要：探讨了积性犹豫模糊偏好关系元素的数据结构,展示了积性犹豫模糊偏好关系方阵的特征,对数据集进行单值化处理,定义了衡量偏好关系方阵完全满足积性一致性的方法。重点研究了偏好关系中矛盾数据自动修正算法,通过加入偏移量构建含未知数的完全满足积性一致性的偏好关系方阵,将复杂偏好关系方阵分解为多个基础偏好关系方阵,使用一致性基本定义反推需要满足的充分必要约束条件,以总偏移量最小为目标构建优化模型。最后,将该算法应用在创新能力定量评测这类模糊问题,证明了算法的有效性和高效性。The paper discusses the data structure in the multiplicative hesitant fuzzy preference relations elements,and shows the characteristics of the multiplicative hesitant fuzzy preference relations square matrix,then data sets are processed into single values,and designs a method to measure the preference relations square matrix which completely meets the multiplicative consistency.The paper focuses on the automatic correction algorithm of contradictory data.By adding the offset,a preference relations matrix with unknowns that fully meets the multiplicative consistency is constructed.The complex preference relations matrix can be decomposed into multiple basic preference relations matrices.The basic definition of consistency is used to deduce the necessary and sufficient constraints that need to be met,and the optimization model is constructed with the minimum total offset as the goal.Finally,the algorithm is applied to solve fuzzy problems such as quantitative evaluation of innovation ability,which proves the effectiveness and efficiency of the algorithm.

关 键 词：一致性调整 积性一致性 混合规划优化模型 模糊决策 积性犹豫模糊偏好关系 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]