کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
476315 699443 2007 14 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A Benders decomposition algorithm for base station planning problem in WCDMA networks
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
A Benders decomposition algorithm for base station planning problem in WCDMA networks
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 34, Issue 6, June 2007, Pages 1674–1687
نویسندگان
, , ,