Assignment of cells to switches in PCS networks
IEEE/ACM Transactions on Networking (TON)
WCDMA for UMTS: Radio Access for Third Generation Mobile Communications
WCDMA for UMTS: Radio Access for Third Generation Mobile Communications
An efficient heuristic for the expansion problem of cellular wireless networks
Computers and Operations Research
Planning UMTS base station location: optimization models with power control and algorithms
IEEE Transactions on Wireless Communications
A tabu search approach for assigning cells to switches in cellular mobile networks
Computer Communications
Solving assignment problem of cellular mobile network using iterative local search algorithm
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Targeting cells to switch assignment of cellular mobile network using heuristic algorithm
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
| Hi-index | 0.00 |
In this paper, we propose a local search heuristic to find "good" feasible solutions in order to solve the global planning problem of universal mobile telecommunications system (UMTS) networks. The global problem is composed of three different subproblems: the cell, the access network and the core network planning subproblems. The global model is very complex to solve exactly and for this reason, we concentrate our efforts on the development of efficient heuristics. A detailed example illustrates the solutions obtained with the proposed approach. Computational results show that our heuristic produces results that are, on average, within 5.48% of the optimal solution.