| 多阶段群体满意决策最优算法 |
| |
| 引用本文： | 郑文婷,刘红美,余真.多阶段群体满意决策最优算法[J].数学的实践与认识,2008,38(16). |
| |
| 作者姓名： | 郑文婷 刘红美 余真 |
| |
| 作者单位： | 三峡大学理学院,宜昌,443002 |
| |
| 基金项目： | 国家自然科学基金，湖北省科技基金 |
| |
| 摘 要： | 针对多阶段群体满意决策问题,应用图论知识提出一种求解多阶段群体满意策略问题的最优算法.定义权ω为决策者对决策的总评价值,给出距离d和群体满意策略等概念.考虑实际情况中决策者的能力和认知的不同,赋予决策者变化的决策权重.将多阶段群体满意策略问题转换成在一个带有权向量的多部有向图中找权最大的路的问题.最后给出计算实例.
|
| 关 键 词： | 图论 Dijkstra算法 权向量 距离 群体满意策略 |
The Optimal Algorithm of Multi-stage Group Decision-making |
| |
| ZHENG Wen-ting,LIU Hong-mei,YU Zhen.The Optimal Algorithm of Multi-stage Group Decision-making[J].Mathematics in Practice and Theory,2008,38(16). |
| |
| Authors: | ZHENG Wen-ting LIU Hong-mei YU Zhen |
| |
| Abstract: | 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 weighted-vector.Finally computing examples are followed. |
| |
| Keywords: | Graph Theory Dijkstra Algorithm weighted-vector distance group satisfactory policy |
| 本文献已被 万方数据 等数据库收录！ |
|
