检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]School of Management, Shanghai University, Shanghai 200444, R R. China [2]School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, P. R. China
出 处:《Journal of Systems Engineering and Electronics》2010年第3期423-430,共8页系统工程与电子技术(英文版)
基 金:supported by the Research Innovation Project of Shanghai Education Committee (08YS19);the Excellent Young Teacher Project of Shanghai University
摘 要:To solve the uncertain multi-attribute group decision-making of unknown attribute weights,three optimal models are built to decide the corresponding ideal solution weights,standard deviation weights and mean deviation weights.The comprehensive attribute weights are gotten through the product of the above three kinds of weights.And each decision maker's weighted decision matrices are also received by using the integrated attribute weights.The closeness degrees are also gotten by use of technique for order preference by similarity to ideal solution(TOPSIS) through dealing with the weighted decision matrices.At the same time the group decision matrix and weighted group decision matrix are gotten by using each decision-maker's closeness degree to every project.Then the vertical TOPSIS method is used to calculate the closeness degree of each project.So these projects can be ranked according to their values of the closeness degree.The process of the method is also given step by step.Finally,a numerical example demonstrates the feasibility and effectiveness of the approach.To solve the uncertain multi-attribute group decision-making of unknown attribute weights,three optimal models are built to decide the corresponding ideal solution weights,standard deviation weights and mean deviation weights.The comprehensive attribute weights are gotten through the product of the above three kinds of weights.And each decision maker's weighted decision matrices are also received by using the integrated attribute weights.The closeness degrees are also gotten by use of technique for order preference by similarity to ideal solution(TOPSIS) through dealing with the weighted decision matrices.At the same time the group decision matrix and weighted group decision matrix are gotten by using each decision-maker's closeness degree to every project.Then the vertical TOPSIS method is used to calculate the closeness degree of each project.So these projects can be ranked according to their values of the closeness degree.The process of the method is also given step by step.Finally,a numerical example demonstrates the feasibility and effectiveness of the approach.
关 键 词:multi-attribute decision-making uncertain numbers TOPSIS WEIGHTS the closeness degree.
分 类 号:O225[理学—运筹学与控制论] X823[理学—数学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117