| 基于可能度排序法的区间信息指派方法 |
| |
| 引用本文： | 王茶香,吴连发.基于可能度排序法的区间信息指派方法[J].数学的实践与认识,2008,38(21). |
| |
| 作者姓名： | 王茶香 吴连发 |
| |
| 摘 要： | 针对具有区间数信息的多目标指派问题,利用区间数可能度排序方法,给出了一种新的指派方法.该方法充分利用实际所给的区间信息进行求解,克服了以往这类指派问题最后由多目标问题转换为单目标问题时权数确定主观性大的缺陷.最后给出了该方法的一个算例.
|
| 关 键 词： | 指派问题 损益矩阵 可能度排序法 匈牙利算法 |
A Method for Assignment Problems with Intervals Based on Ranking Approach of Possibility Degree |
| |
| WANG Cha-xiang,WU Lian-fa.A Method for Assignment Problems with Intervals Based on Ranking Approach of Possibility Degree[J].Mathematics in Practice and Theory,2008,38(21). |
| |
| Authors: | WANG Cha-xiang WU Lian-fa |
| |
| Abstract: | A new approach is proposed to solve multiobject assignment problems with intervals,based on ranking approach of possibility degree.This approach makes full use of the information of intervals,and overcomes the defect of big subjectivity on the course of determining weight transforming multiobject to singobject.Finally the model is applied to practice. |
| |
| Keywords: | assignment problem profit and loss matrix ranking approach of possibility degree Hungary algorithm |
| 本文献已被 万方数据 等数据库收录！ |
