Finding the Most Reliable Maximum Flow in Transport Network

Abstract

This paper intends to solve the most reliable maximum flow problem (MRMF) on transport network. A subgraph path division algorithm (SPDA) is proposed to get the most reliable maximum flow distribution, which avoid the negative impact of the number of simple paths and its bottleneck capacity. SPDA divides the sub-graph space of a transport network into a set of disjoint closed intervals, which satisfies the maximum flow constraints. Among the lower bounds of all the intervals, the one with discovered probability has proven to be the most reliable maximum. Finally, experimental results reveal the effectiveness and efficiency of the proposed algorithm.