Finding the Most Reliable Maximum Flow in Transport Network

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.

[1]  E. Jamoulle,et al.  Transportation networks with random arc capacities , 1972 .

[2]  Erik Jenelius,et al.  Planning for the unexpected: The value of reserve capacity for public transport network robustness , 2015 .

[3]  Chin-Chia Jane,et al.  Computing Multi-State Two-Terminal Reliability Through Critical Arc States That Interrupt Demand , 2010, IEEE Transactions on Reliability.

[4]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[5]  Ye Yuan,et al.  Answering Probabilistic Reachability Queries over Uncertain Graphs: Answering Probabilistic Reachability Queries over Uncertain Graphs , 2010 .

[6]  John Yuan,et al.  Reliability evaluation of a limited-flow network in terms of minimal cutsets , 1993 .

[7]  Jeffrey Xu Yu,et al.  iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques , 2010, Proc. VLDB Endow..

[8]  Charu C. Aggarwal,et al.  Reliable clustering on uncertain graphs , 2012, 2012 IEEE 12th International Conference on Data Mining.

[9]  Dimitris Papadias,et al.  Uncertain Graph Processing through Representative Instances , 2015, TODS.

[10]  C. Alexopoulos.  A note on state-space decomposition methods for analyzing stochastic flow networks , 1995 .

[11]  Geoff Boeing,et al.  OSMnx: New Methods for Acquiring, Constructing, Analyzing, and Visualizing Complex Street Networks , 2016, Comput. Environ. Urban Syst..

[12]  Gerardo Rubino,et al.  Highly reliable stochastic flow network reliability estimation , 2016, 2016 XLII Latin American Computing Conference (CLEI).

[13]  Xin Zhang,et al.  A Survey on Reliability Evaluation of Stochastic-Flow Networks in Terms of Minimal Paths , 2009, 2009 International Conference on Information Engineering and Computer Science.

[14]  Karl Aberer,et al.  Time- and Space-Efficient Sliding Window Top-k Query Processing , 2015, TODS.

[15]  Ziyou Gao,et al.  Joint road toll pricing and capacity development in discrete transport network design problem , 2017 .

[16]  Jianmin Wang,et al.  Aggregate nearest neighbor queries in uncertain graphs , 2013, World Wide Web.

[17]  Chin-Chia Jane,et al.  A Practical Algorithm for Computing Multi-State Two-Terminal Reliability , 2008, IEEE Transactions on Reliability.

[18]  Marco Muselli,et al.  Approximate multi-state reliability expressions using a new machine learning technique , 2005, Reliab. Eng. Syst. Saf..

[19]  Yi-Kuei Lin,et al.  A simple algorithm for reliability evaluation of a stochastic-flow network with node failure , 2001, Comput. Oper. Res..

[20]  S.H. Lee,et al.  Reliability Evaluation of a Flow Network , 1980, IEEE Transactions on Reliability.

[21]  Li Xu,et al.  The Reliability of Subgraphs in the Arrangement Graph , 2015, IEEE Transactions on Reliability.

[22]  Yi-Kuei Lin,et al.  System Reliability Evaluation for a Multistate Supply Chain Network With Failure Nodes Using Minimal Paths , 2009, IEEE Trans. Reliab..

[23]  David W. Coit,et al.  A Monte-Carlo simulation approach for approximating multi-state two-terminal reliability , 2005, Reliab. Eng. Syst. Saf..

[24]  Jian Pei,et al.  Probabilistic path queries in road networks: traffic uncertainty aware path selection , 2010, EDBT '10.