Integer and combinatorial optimization
Integer and combinatorial optimization
Linear programming and network flows (2nd ed.)
Linear programming and network flows (2nd ed.)
A modeling language for mathematical programming
Management Science
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Bounds for the frequency assignment problem
Discrete Mathematics
A comparison of local search algorithms for radio link frequency assignment problems
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Optimum positioning of base stations for cellular radio networks
Wireless Networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
A polynomial-time approximation scheme for base station positioning in UMTS networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
A mixed-integer programming model for the cellular telecommunication network design
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Mobile Cellular Telecommunications Systems
Mobile Cellular Telecommunications Systems
Dynamic channel assignment with cumulative co-channel interference
ACM SIGMOBILE Mobile Computing and Communications Review
Weighted coloring based channel assignment for WLANs
ACM SIGMOBILE Mobile Computing and Communications Review
Partially overlapped channels not considered harmful
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Cellular network configuration with co-channel and adjacent-channel interference constraints
Computers and Operations Research
Johnny Appleseed: wardriving to reduce interference in chaotic wireless deployments
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
| Hi-index | 0.00 |
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.