A decomposition algorithm for capacity expansion of local access networks

The authors study how to expand capacity of the local access network to meet projected demand over a given planning horizon at minimum cost. The alternatives for capacity expansion include both copper cable and digital multiplexer. They show how the problem can be modeled as an integer programming problem; however, the size of the problem for a typical network and the discontinuous cost structure of the expansion facilities preclude the use of a general purpose integer programming code to solve it. A decomposition approach that takes advantage of the structure of the problem and allows the problem to be solved in a reasonable amount of time is proposed. The solution methods described have been implemented and computational results are discussed. The algorithm forms a part of the network planning system NETCAP that has been in use since 1989. >

[1]  Thomas L. Magnanti,et al.  Working Paper Alfred P. Sloan School of Management "models for Planning Capacity Expansion in Local Access Telecommunication Networks" "models for Planning Capacity Expansion in Local Access Telecommunication Networks" Models for Planning Capacity Expansion in Local Access Telecommunication Networks , 2008 .

[2]  Tony J. Van Roy,et al.  A Dual-Based Procedure for Dynamic Facility Location , 1982 .

[3]  Warren L. G. Koontz.  Optimal Temporary Deferral of Reinforcements in a Single Terminal Flow Network , 1974, IEEE Trans. Syst. Man Cybern..

[4]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[5]  Tony J. Van Roy,et al.  A Cross Decomposition Algorithm for Capacitated Facility Location , 1986, Oper. Res..

[6]  Michel Minoux,et al.  Network Synthesis and Dynamic Network Optimization , 1987 .

[7]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[8]  W. L. G. Koontz.  Economic evaluation of loop feeder relief alternatives , 1980, The Bell System Technical Journal.

[9]  Alexander Shulman,et al.  An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes , 1991, Oper. Res..

[10]  C. Fong,et al.  The multiregional dynamic capacity expansion problem: an improved heuristic , 1986 .

[11]  John Freidenfelds,et al.  A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion , 1979, Oper. Res..

[12]  V. Srinivasan,et al.  The Multiregion Dynamic Capacity Expansion Problem, Part I , 1981, Oper. Res..

[13]  Hanan Luss,et al.  Operations Research and Capacity Expansion Problems: A Survey , 1982, Oper. Res..

[14]  C. Monma,et al.  Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints , 1989, Oper. Res..