Solution Strategies for the Multi-Hour Network Design Problem

The problem of finding the most cost efficient network design by considering two or more demand matrices that represent varying network traffic over several time periods, is referred to as multi-hour network design. Capacity installations need to be determined such that the network is robust enough to allow routing of the demand matrices non-simultaneously. In the paper the multi-hour network design problem is formulated as a mixed-integer programming model and the solution approach is based on a branch-and-cut framework that incorporates several classes of valid inequalities. The aim of the paper is to investigate the effect of problem reduction on computing times. Results from domination theory are applied to reduce the number of non-simultaneous traffic demand matrices to a so-called dominant (sub-)set. That is, matrices from the original data set are removed which do not change the solution space of a feasible network. In addition, strategies for strengthening the right-hand side of metric inequalities are presented and computational results are provided based on measurements from an operational network.

[1]  M. Iri.  ON AN EXTENSION OF THE MAXIMUM-FLOW MINIMUM-CUT THEOREM TO MULTICOMMO))ITY FLOWS , 1971 .

[2]  Gianpaolo Oriolo,et al.  Domination Between Traffic Matrices , 2008, Math. Oper. Res..

[3]  K. Onaga,et al.  On feasibility conditions of multicommodity flows in networks , 1971 .

[4]  T. C. Hu,et al.  Synthesis of a Communication Network , 1964 .

[5]  George G. Polak,et al.  Multi-Hour Dimensioning In Non-Hierarchical Telecommunications Networks , 1999 .

[6]  Morten Riis,et al.  Capacitated Network Design with Uncertain Demand , 2002, INFORMS J. Comput..

[7]  Alexander Kröller.  Network Optimization: Integration of Hardware Configuration and Capacity Dimensioning , 2003 .

[8]  Hasan Pirkul,et al.  Routing and capacity assignment in backbone communication networks under time varying traffic conditions , 1999, Eur. J. Oper. Res..

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

[10]  Deep Medhi.  Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks , 1995, TNET.

[11]  Amitava Dutta,et al.  Design of private backbone networks -- I: time varying traffic , 1993 .

[12]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[13]  Laurence A. Wolsey,et al.  Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints , 1990, Discret. Appl. Math..

[14]  Amitava Dutta,et al.  Capacity planning of private networks using DCS under multibusy-hour traffic , 1994, IEEE Trans. Commun..

[15]  M. Stoer,et al.  A polyhedral approach to multicommodity survivable network design , 1994 .

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

[17]  R. Wessäly.  Dimensioning Survivable Capacitated Networks , 2000 .