Abstract: Characteristics of reliable path finding under sudden-onset disaster are analyzed.A method of reliable path finding under uncertain network,which is independent of probability distribution of arcs’ travel time,is brought forward on the basis of those characteristics.The uncertainty of travel time of road network is depicted by means of scenario union firstly,then a path finding modal applied minimax theorem is constructed for obtaining most reliable path of all scenarios.To solve this modal,a algorithm is devised and its complexity is analyzed.The algorithm is validated by one typical calculation example at last.

Key words: reliable path finding, network under uncertainty, minimax

摘要： 在分析突发灾害爆发时可靠路径搜索问题特点的基础上,提出了一种在不确定网络中不依赖于弧的旅行时间概率分布的可靠路径搜索方法。该方法通过场景集描述网络旅行时间的不确定性,应用Minimax理论构建求解所有场景下可靠路径的数学模型,并设计了问题求解算法,分析了算法的时间复杂性,最后通过典型算例对算法进行了验证。

关键词: 可靠路径搜索, 不确定性网络, 最小最大