多阶段群体满意决策最优算法  

The Optimal Algorithm of Multi-stage Group Decision-making

作　　者：郑文婷[1] 刘红美[1] 余真[1] 

机构地区：[1]三峡大学理学院,宜昌443002

出　　处：《数学的实践与认识》2008年第16期44-48,共5页Mathematics in Practice and Theory

基　　金：NSFC(10671081);The Science Foundation of Hubei Province(2006AA412C27)

摘　　要：针对多阶段群体满意决策问题,应用图论知识提出一种求解多阶段群体满意策略问题的最优算法.定义权ω为决策者对决策的总评价值,给出距离d和群体满意策略等概念.考虑实际情况中决策者的能力和认知的不同,赋予决策者变化的决策权重.将多阶段群体满意策略问题转换成在一个带有权向量的多部有向图中找权最大的路的问题.最后给出计算实例.The problem of multi-stage group decision making is analyzed. According to principle of Graph Theory, a optimal algorithm is presented. Define weight ω is total value of decision-making, the notion of distance d and group satisfactory policy is defined. Consider decision-maker＇s capability is different in complicated circumstance, decision-makers are given different weights of the decision-making. Thereby the problem of multi-stage group decision making is translated into find a path with most weight in a k-partite digraph with weightedvector. Finally computing examples are followed.

关 键 词：图论 DIJKSTRA算法 权向量 距离 群体满意策略 

分 类 号：C934[经济管理—管理学] F224