Lagrangean Based Methods for Solving Large-Scale Cellular Network Design Problems

The cellular network design (CND) problem is formulated as a comprehensive linear mixed integer programming model integrating the base station location (BSL) problem, the frequency channel assignment (FCA) problem and the topological network design (TND) problem. A solution algorithm based on Lagrangean relaxation is proposed for solving this complex cellular network design problem. Pursuing the optimum solution through exact algorithms to this problem appears to be unrealistic considering the large scale nature and NP-hardness of the problem. Therefore, the solution algorithm strategy consists in computing effective lower and upper bounds for the problem. Lower bounds are evaluated through a Lagrangean relaxation technique and subgradient method. A Lagrangean heuristic is developed to compute upper bounds based on the Lagrangean solution. The bounds are improved through a customized branch and bound algorithm which takes in account specific knowledge of the problem to improve its efficiency. Thirty two random test instances are solved using the proposed algorithm and the CPLEX optimization package. The results show that the duality gap is excessive, so it cannot guarantee the quality of the solution. However, the proposed algorithm provides optimal or near optimal solutions for the problem instances for which CPLEX also provides the optimal solution. It further suggests that the proposed algorithm provides optimal or near optimal solutions for the other instances too. Finally, the results demonstrate that the proposed algorithm is superior to CPLEX as a solution approach for the CND problem.

[1]  Heribert Vollmer,et al.  The complexity of base station positioning in cellular networks , 2005, Discret. Appl. Math..

[2]  Francisco Barahona,et al.  The volume algorithm: producing primal solutions with a subgradient method , 2000, Math. Program..

[3]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[4]  Amitava Dutta,et al.  Design of partially survivable networks for cellular telecommunication systems , 1999, Eur. J. Oper. Res..

[5]  Heribert Vollmer,et al.  A polynomial-time approximation scheme for base station positioning in UMTS networks , 2001, DIALM '01.

[6]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[7]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[8]  William C. Y. Lee,et al.  Mobile Cellular Telecommunications Systems , 1989 .

[9]  Martin Grötschel,et al.  Frequency assignment in cellular phone networks , 1998, Ann. Oper. Res..

[10]  Edoardo Amaldi,et al.  Discrete models and algorithms for the capacitated location problems arising in UMTS network planning , 2001, DIALM '01.

[11]  Rudolf Mathar,et al.  Optimum positioning of base stations for cellular radio networks , 2000, Wirel. Networks.

[12]  A. M. Geoffrion.  Lagrangean Relaxation and Its Uses in Integer Programming , 1972 .

[13]  Caj Cor Hurkens,et al.  Upper and lower bounding techniques for frequency assignment problems , 1995 .

[14]  Martin Grötschel,et al.  The Orientation Model for Frequency Assignment Problems , 1998 .

[15]  Derek H. Smith,et al.  Improving heuristics for the frequency assignment problem , 1998, Eur. J. Oper. Res..

[16]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[17]  Derek H. Smith,et al.  A comparison of local search algorithms for radio link frequency assignment problems , 1996, SAC '96.

[18]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[19]  Cor A. J. Hurkens,et al.  An overview of algorithmic approaches to frequency assignment problems , 1995 .

[20]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[21]  S. U. Thiel,et al.  FASoft: A system for discrete channel frequency assignment , 1997 .

[22]  Antonio Capone,et al.  Optimizing base station siting in UMTS networks , 2001, IEEE VTS 53rd Vehicular Technology Conference, Spring 2001. Proceedings (Cat. No.01CH37202).

[23]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[24]  Stephen Hurley,et al.  A tabu search algorithm for frequency assignment , 1996, Ann. Oper. Res..

[25]  D. H. Smith,et al.  Bounds for the frequency assignment problem , 1997, Discret. Math..

[26]  Brigitte Jaumard,et al.  A Column Generation Approach for the Exact Solution of Channel Assignment Problems , 1998 .

[27]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[28]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[29]  W. D. Northup,et al.  USING DUALITY TO SOLVE DISCRETE OPTIMIZATION PROBLEMS: THEORY AND COMPUTATIONAL EXPERIENCE* , 1975 .

[30]  Said Salhi,et al.  Discrete Location Theory , 1991 .

[31]  B. Jansen,et al.  A branch-and-cut algorithm for the frequency assignment problem , 1996 .

[32]  Roy E. Marsten,et al.  Feature Article - Interior Point Methods for Linear Programming: Computational State of the Art , 1994, INFORMS J. Comput..

[33]  Matteo Fischetti,et al.  Frequency assignment in mobile radio systems using branch-and-cut techniques , 2000, Eur. J. Oper. Res..

[34]  Godwin C. Ovuworie,et al.  Mathematical Programming: Structures and Algorithms , 1979 .

[35]  A. M. Geoffrion,et al.  Lagrangean Relaxation Applied to Capacitated Facility Location Problems , 1978 .

[36]  Hanif D. Sherali,et al.  Linear programming and network flows (2nd ed.) , 1990 .

[37]  Peter Kubat,et al.  A multi-period network design problem for cellular telecommunication systems , 2001, Eur. J. Oper. Res..

[38]  Rudolf Mathar,et al.  Optimal Base Station Positioning and Channel Assignment for 3G Mobile Networks by Integer Programming , 2001, Ann. Oper. Res..

[39]  Geraldo Robson Mateus,et al.  A mixed-integer programming model for the cellular telecommunication network design , 2001, DIALM '01.

[40]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .