摘要
网络最小流是网络发生最严重堵塞时通过网络的最大流量,它是设计交通网络,特别是紧急疏散网络的重要参数。本文将传统的网络最小流问题推广到模糊环境,探讨了弧的容量为模糊数时的情况,建立了相应的数学模型并给出了相关解法。最后,给出了一个具体实例。
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 trantportation network, especially an eznergency evacuation network. The paper is mainly devoted to the application of traditional minimal flow problem to fuzzy environment. Attention is focttsecl on the are capacities and the corresponding mathematical modal and algorithm. Furthemore,the efficient algorithm and one specific example are presented.
出处
《广东广播电视大学学报》
2006年第4期105-107,共3页
Journal of Guangdong Radio & Television University
关键词
模糊数
模糊网络最小流
双向增流法
fuzzy number
fuzzy network minimal flow
two way flow-angmenitng method
