Finding Most Vital Links over Time in a Flow Network

This paper deals with finding most vital links of a network which carries flows over time (also called "dynamic flows"). Given a network and a time horizon T, Single Most Vital Link Over Time (SMVLOT) problem looks for a link whose removal results in greatest decrease in the value of maximum flow over time (dynamic maximum flow) up to time horizon T between two terminal nodes. SMVLOT problem is formulated as a mixed binary linear programming problem. This formulation is extended to a general case called k-Most Vital Links Over Time (KMVLOT) problem, in which we look for finding those k links whose removal makes greatest decrease in the value of maximum flow over time. A Benders decomposition algorithm is proposed for solving SMVLOT and KMVLOT problems. For the case of SMVLOT problem, the proposed algorithm is improved to a fully combinatorial algorithm by adopting an iterative method for solving existing integer programming problem. However, our experimental results showed the superiority of proposed methods.

[1]  P. Nash,et al.  A Class of Continuous Network Flow Problems , 1982, Math. Oper. Res..

[2]  Richard D. Wollmer,et al.  Some Methods for Determining the Most Vital Link in a Railway Network , 1963 .

[3]  Özlem Ergun,et al.  The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability , 2010, Oper. Res. Lett..

[4]  H. W. Corley,et al.  Most vital links and nodes in weighted networks , 1982, Oper. Res. Lett..

[5]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[6]  Éva Tardos,et al.  Efficient continuous-time dynamic network flow algorithms , 1998, Oper. Res. Lett..

[7]  Rainer E. Burkard,et al.  The quickest flow problem , 1993, ZOR Methods Model. Oper. Res..

[8]  Samir Khuller,et al.  The complexity of finding most vital arcs and nodes , 1995 .

[9]  Ariel Orda,et al.  On continuous network flows , 1995, Oper. Res. Lett..

[10]  R. Kevin Wood,et al.  Deterministic network interdiction , 1993 .

[11]  Éva Tardos,et al.  “The quickest transshipment problem” , 1995, SODA '95.

[12]  Martin Skutella,et al.  An Introduction to Network Flows over Time , 2008, Bonn Workshop of Combinatorial Optimization.

[13]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[14]  A. K. Mittal,et al.  The k most vital arcs in the shortest path problem , 1990 .

[15]  D. R. Fulkerson,et al.  Constructing Maximal Dynamic Flows from Static Flows , 1958 .

[16]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[17]  Maw-Sheng Chern,et al.  The fuzzy shortest path problem and its most vital arcs , 1993 .