Telecommunications network topological design and capacity expansion: Formulations and algorithms
 SukGwon Chang,
 Bezalel Gavish
 … show all 2 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
This paper formulates the network topology and capacity expansion problem in a telecommunications network and suggests a family of heuristics and a dualbased lower bounding procedure for solving it. They include schemes exploiting special subproblem structures, decomposition of the problem using Lagrangian relaxation, and a global search strategy. Carefully designed experiments show that the procedure generates solutions within forty percent of the lower bound in most cases. To evaluate the solution quality more accurately, additional experiments have been performed, using a random search strategy for the topological variables with capacity expansion optimized. It is shown that the global heuristic solutions dominate solutions that use the random search strategy for topological variables. Following the computational experiments, a tighter formulation is suggested which can improve the lower bounds. The paper concludes with a discussion of further research areas.
 Y.K. Agarwal, Integer programming for telecommunications network design, Paper presented at 1st ORSA Telecom. SIG Conf.
 Balakrishnan, A., Magnanti, T.L., Wong, R.T. (1989) A dualascent procedure for large scale uncapacitated network design. Oper. Res. 37: pp. 716740
 Christofides, N., Brooker, P. (1974) Optimal expansion of an existing network. Math. Progr. 6: pp. 197211
 Crowder, H., Padberg, M.W. (1980) Solving largescale symmetric traveling salesman problems to optimality. Manag. Sci. 26: pp. 495509
 Doulliez, P.J., Rao, M.R. (1975) Optimal network capacity planning: A shortest path scheme. Oper. Res. 23: pp. 811818
 Erlenkotter, D. (1978) A dualbased procedure for uncapacitated facility location. Oper. Res. 26: pp. 9921009
 Gavish, B. (1982) Topological design of centralized computer networks — formulations and algorithms. Networks 12: pp. 355377
 Gavish, B. (1985) Augmented Lagrangian based algorithms for centralized network design. IEEE Trans. Commun. COM33: pp. 12471257
 Gavish, B., Altinkemer, K. (1990) Backbone network design tools with economic tradeoffs. ORSA J. Comp. 2: pp. 236245
 Gavish, B., Srikanth, K. (1986) An optimal solution method for largescale multiple traveling salesman problems. Oper. Res. 34: pp. 698717
 Johnson, D.S., Lenstra, J.K., Rinnooy Kan, A.H.G. (1978) The complexity of the network design problem. Networks 8: pp. 279285
 Minoux, M. (1987) Network synthesis and dynamic network optimization. Ann. Discr. Math. 31: pp. 283324
 Parrish, S.H., Cox, T., Kuehner, W., Qui, Y. (1992) Planning for optimal expansion of leased line communication networks. Ann. Oper. Res. 36: pp. 347364
 Shier, D.R., Witzgall, C. (1980) Arc tolerances in shortest path and network flow problems. Networks 10: pp. 277291
 Zadeh, N. (1974) On building minimum cost communication networks over time. Networks 4: pp. 1934
 Title
 Telecommunications network topological design and capacity expansion: Formulations and algorithms
 Journal

Telecommunication Systems
Volume 1, Issue 1 , pp 99131
 Cover Date
 19931201
 DOI
 10.1007/BF02136157
 Print ISSN
 10184864
 Online ISSN
 15729451
 Publisher
 Baltzer Science Publishers, Baarn/Kluwer Academic Publishers
 Additional Links
 Topics
 Industry Sectors
 Authors

 SukGwon Chang ^{(1)}
 Bezalel Gavish ^{(1)}
 Author Affiliations

 1. Owen Graduate School of Management, Vanderbilt University, 37203, Nashville, TN, USA