a local search heuristic for the global planning of umts networks
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.
local search heuristic global approach mobile networks network design