A Benders decomposition algorithm for base station planning problem in WCDMA networks

Abstract This paper analyzes the integer programming model and its relaxations of WCDMA base station planning problem for Up-Link with integer and nonlinear constraints. Firstly, the base station planning problem is decomposed into several “sub-problems” for every set of activated base stations to optimally assign test points to them. Subsequently, the relationship between the integer sub-problems and their linear relaxations is investigated, which leads to the equivalence of the integral optimal solutions to the original integer programming model and its relaxation. Finally the classic Benders decomposition algorithm is applied to solve WCDMA base station planning problem. Simulation results show that the computational efficiency of the proposed algorithm can meet the requirements in practical applications.

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

[2]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[3]  Phuoc Tran-Gia,et al.  ICEPT-an integrated cellular network planning tool , 1997, 1997 IEEE 47th Vehicular Technology Conference. Technology in Motion.

[4]  Rudolf Mathar,et al.  Integrated Optimal Cell Site Selection and Frequency Allocation for Cellular Radio Networks , 2002, Telecommun. Syst..

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

[6]  Chae Y. Lee,et al.  Cell planning with capacity expansion in mobile communications: a tabu search approach , 2000, IEEE Trans. Veh. Technol..

[7]  Varadharajan Sridhar,et al.  Benders-and-cut algorithm for fixed-charge capacitated network design problem , 2000, Eur. J. Oper. Res..

[8]  Ja-Shen Chen,et al.  Optimal solution of cellular manufacturing system design: Benders' decomposition approach , 1998, Eur. J. Oper. Res..

[9]  Jong-Gwan Yook,et al.  Genetic Approach to Base Station Placement from Pre-Defined Candidate Sites for Wireless Communications , 2003 .

[10]  Han Kyu Park,et al.  Genetic approach with a new representation for base station placement in mobile communications , 2001, IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211).

[11]  Edoardo Amaldi,et al.  Planning UMTS base station location: optimization models with power control and algorithms , 2003, IEEE Trans. Wirel. Commun..

[12]  Steve Hurley.  Automatic base station selection and configuration in mobile networks , 2000, Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC2000. 52nd Vehicular Technology Conference (Cat. No.00CH37152).

[13]  Antonio Capone,et al.  UMTS radio planning: optimizing base station configuration , 2002, Proceedings IEEE 56th Vehicular Technology Conference.

[14]  Frank Nielsen,et al.  Combinatorial optimization algorithms for radio network planning , 2001, Theor. Comput. Sci..

[15]  Edoardo Amaldi,et al.  Optimization models and algorithms for downlink UMTS radio planning , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[16]  Alysson M. Costa.  A survey on benders decomposition applied to fixed-charge network design problems , 2005, Comput. Oper. Res..

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

[18]  Armin Fügenschuh,et al.  Modelling Feasible Network Configurations for UMTS , 2003 .