Decomposition Methods and Network Design Problems

Decomposition based approaches are recalled from primal and dual point of view. The possibility of building partially disaggregated reduced master problems is investigated. This extends the idea of aggregated-versus-disaggregated formulation to a gradual choice of alternative level of aggregation. Partial aggregation is applied to the linear multicommodity minimum cost flow problem. The possibility of having only partially aggregated bundles opens a wide range of alternatives with different trade-offs between the number of iterations and the required computation for solving it. This trade-off is explored for several sets of instances and the results are compared with the ones obtained by directly solving the natural node-arc formulation. An iterative solution process to the route assignment problem is proposed, based on the well-known Frank Wolfe algorithm. In order to provide a first feasible solution to the Frank Wolfe algorithm, a linear multicommodity min-cost flow problem is solved to optimality by using the decomposition techniques mentioned above. Solutions of this problem are useful for network orientation and design, especially in relation with public transportation systems as the Personal Rapid Transit. A single-commodity robust network design problem is addressed. In this, an undirected graph with edge costs is given together with a discrete set of balance matrices, representing different supply/demand scenarios. The goal is to determine the minimum cost installation of capacities on the edges such that the flow exchange is feasible for every scenario. A set of new instances that are computationally hard for the natural flow formulation are solved by means of a new heuristic algorithm. Finally, an efficient decomposition-based heuristic approach for a large scale stochastic unit commitment problem is presented. The addressed real-world stochastic problem employs at its core a deterministic unit commitment planning model developed by the California Independent System Operator (ISO).

[1]  Laurence A. Wolsey,et al.  A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem , 2003, Networks.

[2]  Edward Rothberg,et al.  An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions , 2007, INFORMS J. Comput..

[3]  Arie M. C. A. Koster,et al.  Robust network design: Formulations, valid inequalities, and computations , 2013, Networks.

[4]  Arkadi Nemirovski,et al.  Robust solutions of Linear Programming problems contaminated with uncertain data , 2000, Math. Program..

[5]  Arkadi Nemirovski,et al.  Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..

[6]  Robert T. Chien,et al.  Synthesis of a Communication Net , 1960, IBM J. Res. Dev..

[7]  T. C. Hu,et al.  An Application of Generalized Linear Programming to Network Flows , 1962 .

[8]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[9]  Alberto Leon-Garcia,et al.  Robust network design , 2013, 2013 IEEE International Conference on Communications (ICC).

[10]  Edoardo Amaldi,et al.  Provisioning virtual private networks under traffic uncertainty , 2007, Networks.

[11]  Martine Labbé,et al.  Network Synthesis with Non-Simultaneous Multicommodity Flow Requirements: Bounds and Heuristics , 1999 .

[12]  Chandra Chekuri.  Routing and network design with robustness to changing or uncertain traffic demands , 2007, SIGA.

[13]  Matteo Fischetti,et al.  Proximity search for 0-1 mixed-integer convex programming , 2014, J. Heuristics.

[14]  Panos M. Pardalos,et al.  A decomposition approach to the two-stage stochastic unit commitment problem , 2012, Annals of Operations Research.

[15]  Ali Ridha Mahjoub,et al.  Design of Survivable Networks: A survey , 2005, Networks.

[16]  Sara Mattia,et al.  The robust network loading problem with dynamic routing , 2010, Comput. Optim. Appl..

[17]  Alper Atamtürk,et al.  On capacitated network design cut–set polyhedra , 2002, Math. Program..

[18]  Christoph Buchheim,et al.  An Exact Algorithm for Robust Network Design , 2011, INOC.

[19]  K. Menger.  Zur allgemeinen Kurventheorie , 1927 .

[20]  Oktay Günlük,et al.  Minimum cost capacity installation for multicommodity network flows , 1998, Math. Program..

[21]  M. Minoux.  Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements* , 1981 .

[22]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[23]  Walid Ben-Ameur,et al.  Routing of Uncertain Traffic Demands , 2005 .

[24]  V G Andrew,et al.  AN EFFICIENT IMPLEMENTATION OF A SCALING MINIMUM-COST FLOW ALGORITHM , 1997 .

[25]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[26]  D. R. Fulkerson,et al.  A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem , 1957, Canadian Journal of Mathematics.

[27]  Michael Jünger,et al.  Models and Algorithms for Robust Network Design with Several Traffic Scenarios , 2012, ISCO.