Abstract
We consider a network design problem arising in mobile communications. At the core of the network is a number of mobile switching centers (MSCs), each serving a number of base station controllers (BSCs). The network design problem involves three major groups of decisions – deployment of a number of new MSCs, allocation of BSCs to new and existing MSCs, and capacity expansion of transmission links interconnecting the MSCs. These decisions must be made so as to minimize the incurred costs while meeting customer demand and observing the capacity restrictions. We formulate the problem as a two-stage stochastic program with mixed-integer recourse. To solve the problem we apply a dual decomposition procedure, solving scenario subproblems by means of branch and cut. The solution procedure has been tested on a real life problem instance provided by SONOFON, a Danish mobile communication network operator, and we report results of our computational experiments.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Balakrishnan, T. Magnanti and R. Wong, A dual-ascent procedure for large-scale uncapacitated network design, Operations Research 37 (1989) 716-740.
D. Bienstock, S. Chopra, O. Günlük and C.-Y. Tsai, Minimum cost capacity installation for multicommodity network flows, Mathematical Programming 81 (1998) 177-200.
D. Bienstock and O. Günlük, Capacitated network design. Polyhedral structure and computation, INFORMS Journal on Computing 8(3) (1996) 243-259.
C. Carøe and R. Schultz, Dual decomposition in stochastic integer programming, Operations Research Letters 24 (1999) 37-45.
S.-G. Chang and B. Gavish, Telecommunications network topological design and capacity expansion: Formulations and algorithms, Telecommunication Systems 1 (1993) 99-131.
G. Dahl and M. Stoer, A cutting plane algorithm for multicommodity survivable network design problems, INFORMS Journal on Computing 10(1) (1998) 1-11.
M. Dempster, E. Medova and R. Thompson, A stochastic programming approach to network planning, in: Teletraffic Contributions for the Information Age, Proc. of the 15th Internat. Teletraffic Congress - ITC 15, eds. V. Ramaswami and P. Wirth (Elsevier Science, Amsterdam, 1997) pp. 329-339.
O. Günlük, A branch-and-cut algorithm for capacitated network design, Mathematical Programming 86 (1999) 17-39.
K. Jörnsten, M. Näsberg and P. Smeds, Variable splitting - a new Lagrangian relaxation approach to some mathematical programming models, Research Report LiTH-MAT-R-85-04, Department of Mathematics, Linköbing Institute of Technology (1985).
E. Medova, Chance-constrained stochastic programming for integrated services network management, Annals of Operations Research 81 (1998) 213-229.
A. Merchant and B. Sengupta, Assignment of cells to switches in PCS networks, IEEE/ACM Transactions on Networking 3(5) (1995) 521-526.
J. Mulvey and A. Ruszczyński, A new scenario decomposition method for large-scale stochastic optimization, Operations Research 43 (1995) 477-490.
G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization (Wiley-Interscience, New York, 1998).
M. Padberg and G. Rinaldi, A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Review 33(1) (1991) 60-100.
M. Riis and K. Andersen, Capacitated network design with uncertain demand, INFORMS Journal on Computing 14(3) (2002) 247-260.
M. Riis and J. Lodahl, A bicriteria stochastic programming model for capacity expansion in telecommunications, Mathematical Methods of Operations Research 56(1) (2002) 83-100.
R. Rockafellar and R.-B. Wets, Scenarios and policy aggregation in optimization under uncertainty, Mathematics of Operations Research 16 (1991) 119-147.
D. Saha, A. Mukherjee and P. Bhattacharya, A simple heuristic for assignment of cells to switches in a PCS network, Wireless Personal Communications 12 (2000) 209-224.
S. Sen, R. Doverspike and S. Cosares, Network planning with random demand, Telecommunication Systems 3 (1994) 11-30.
E. Tzifa, V. Demestichas, M. Theologou and M. Anagnostou, Design of the access network segment of future mobile communications systems, Wireless Personal Communications 11 (1999) 247-268.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Riis, M., Skriver, A.J. & Lodahl, J. Deployment of Mobile Switching Centers in a Telecommunications Network: A Stochastic Programming Approach. Telecommunication Systems 26, 93–109 (2004). https://doi.org/10.1023/B:TELS.0000029022.63021.09
Issue Date:
DOI: https://doi.org/10.1023/B:TELS.0000029022.63021.09