| 模糊网络最小流问题的求解 |
| |
| 引用本文： | 汪吉.模糊网络最小流问题的求解[J].广东广播电视大学学报,2006,15(4):105-107. |
| |
| 作者姓名： | 汪吉 |
| |
| 作者单位： | 武汉理工大学理学院,湖北武汉,430070 |
| |
| 摘 要： | 网络最小流是网络发生最严重堵塞时通过网络的最大流量,它是设计交通网络,特别是紧急疏散网络的重要参数。本文将传统的网络最小流问题推广到模糊环境,探讨了弧的容量为模糊数时的情况,建立了相应的数学模型并给出了相关解法。最后,给出了一个具体实例。
|
| 关 键 词： | 模糊数 模糊网络最小流 双向增流法 |
| 文章编号： | 1008-9764（2006）04-0105-03 |
| 收稿时间： | 2006-10-28 |
| 修稿时间： | 2006年10月28 |
A Solution of the Fuzzy Network Minimal Flow Problem |
| |
| WANG Ji.A Solution of the Fuzzy Network Minimal Flow Problem[J].Journal of Guangdong Radio & Television University,2006,15(4):105-107. |
| |
| Authors: | WANG Ji |
| |
| Institution: | Wuhan Science Technology University,Wuhan,Hubei,430070 |
| |
| Abstract: | The network minimal flow is the maximal flow when it goes through a network in the most seriously-blocked situation.It is an important parameter in designing a transportation network,especially an emergency evacuation network.The paper is mainly devoted to the application of traditional minimal flow problem to fuzzy environment.Attention is focused on the arc capacities and the corresponding mathematical model and algorithm.Furthermore,the efficient algorithm and one specific example are presented. |
| |
| Keywords: | fuzzy number fuzzy network minimal flow two way flowaugmenting method |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
