A Dynamic Network Flow Problem with Uncertain Arc Capacities: Formulation and Problem Structure

We consider a dynamic network flow problem where the arc capacities are random variables. This gives a multistage stochastic linear program. We describe the randomness using a multi-scenario approach. Because of the multilayered structure, there are several ways to decompose the linear program. We classify different decomposition schemes, and we develop a scheme calledcompath decomposition, which is derived from path decomposition for network flows. We give a polynomial-time algorithm to find a cheapest compath that can solve the subproblems resulting from compath decomposition. Finally, compath decomposition is extended to multicommodity flow problems.

[1]  William C. Jordan,et al.  A STOCHASTIC, DYNAMIC NETWORK MODEL FOR RAILROAD CAR DISTRIBUTION , 1983 .

[2]  Kenneth S. Nickerson,et al.  Maximizing Profits for North American Van Lines' Truckload Division: A New Framework for Pricing and Operations , 1988 .

[3]  Roger J.-B. Wets,et al.  The aggregation principle in scenario analysis stochastic optimization , 1989 .

[4]  Peter Kall,et al.  Stochastic Programming , 1995 .

[5]  Linos F. Frantzeskakis,et al.  A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems , 1990, Transp. Sci..

[6]  J. Tsitsiklis,et al.  Stochastic shortest path problems with recourse , 1996 .

[7]  Amedeo R. Odoni,et al.  Dynamic solution to the ground-holding problem in air traffic control , 1994 .

[8]  Fred W. Glover,et al.  Network models in optimization and their applications in practice , 1992 .

[9]  Warren B. Powell,et al.  Stochastic programs over trees with random arc capacities , 1994, Networks.

[10]  C. Lemaréchal.  Nondifferentiable optimization , 1989 .

[11]  J. Croucher.  A note on the stochastic shortest‐route problem , 1978 .

[12]  Stein W. Wallace,et al.  Structural properties of the progressive hedging algorithm , 1991, Ann. Oper. Res..

[13]  Roger J.-B. Wets,et al.  Chapter VIII Stochastic programming , 1989 .

[14]  R. Tyrrell Rockafellar,et al.  Scenarios and Policy Aggregation in Optimization Under Uncertainty , 1991, Math. Oper. Res..

[15]  Warren B. Powell,et al.  An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management , 1996, Oper. Res..

[16]  Gregory D Glockner.  Effects of Air Traffic Congestion Delays Under Several Flow-Management Policies , 1996 .

[17]  R. Wets,et al.  L-SHAPED LINEAR PROGRAMS WITH APPLICATIONS TO OPTIMAL CONTROL AND STOCHASTIC PROGRAMMING. , 1969 .

[18]  Stein W. Wallace.  Algorithms and model formulations in mathematical programming , 1989 .

[19]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[20]  Warren B. Powell,et al.  A network recourse decomposition method for dynamic networks with random arc capacities , 1994, Networks.

[21]  J. Mulvey,et al.  Stochastic network optimization models for investment planning , 1989 .

[22]  A. Barrett.  Network Flows and Monotropic Optimization. , 1984 .

[23]  Amedeo R. Odoni,et al.  The Multi-Airport Ground-Holding Problem in Air Traffic Control , 1992, Oper. Res..

[24]  A. Ali,et al.  The equal flow problem , 1988 .

[25]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[26]  Amedeo R. Odoni,et al.  Dynamic Ground-Holding Policies for a Network of Airports , 1994, Transp. Sci..

[27]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[28]  Stein W. Wallace,et al.  Solving stochastic programs with network recourse , 1986, Networks.

[29]  C. Lemaréchal.  Chapter VII Nondifferentiable optimization , 1989 .

[30]  Stein W. Wallace.  A piecewise linear upper bound on the network recourse function , 1987, Math. Program..

[31]  Jay E. Aronson,et al.  A survey of dynamic network flows , 1989 .