应急模糊网络系统最大满意度路径的选取

讨论给定限制期条件下的应急系统模糊路径问题.当边的长度为对称三角模糊数 (Symmetric Triangular Fuzzy Number)时,由于模糊数的不可比性,网络中一般不存在绝对 最短的路.为此,引入了路径满意度函数的概念,从而问题就变成:寻找一条从起点到终点的 通路,应急车辆经过此路的时间不超过限制期t的满意度最大.这样的路径选取问题实际可 转化为一个比例路径问题,尽管许多比例路径问题已被证明是NP问题,完全可以针对问题 的具体特点,运用最短路方法的变权迭代实现对该问题的精确求解.

SELECTING OF THE MAXIMUM SATISFACTION FACTOR PATH IN FUZZY EMERGENCY NETWORK SYSTEMS

This paper deals with a fuzzy path problem for emergency systems in which a deadline is given. When arc lengths are symmetric triangular fuzzy numbers (STFNs), there usually does not exist the shortest path in a network because fuzzy numbers may be incomparable. While the satisfaction factor function is introduced, the paths then become comparable (based on satisfaction factor). And we consider the problem of finding a path through which the retrieve vehicle can reach the destination v t from the start node v s in a given deadline t with the maximum satisfaction factor. This kind of problem can be regarded as the minimum ratio path problem known as a strong NP complete problem. However, an algorithm is proposed to solve this problem by repeatedly using the shortest path approach.