100% Money back guaranteed

Document provided by...: www.proquest.com; (Learn more...); ProQuest creates specialized information resources and technologies that propel successful research, discovery, and lifelong learning.

Are you the owner of this document? Click here for information on why it's on Docstoc.

About This Document: In this paper, we propose a tabu search heuristic in order to solve the expansion problem (also known as update problem) of universal mobile telecommunications system (UMTS) networks. The expansion problem is currently being faced by several service providers. In fact, all network planners usually have to decide how to update the current infrastructure in order to meet new demand. This kind of problem is a generalization of the regular planning problem. This means that both the planning and the expansion problems can be solved with the proposed heuristic. Since the expansion problem has been shown to be NP-hard, we concentrate our effort on the development of an approximative approach based on tabu search. The computational results show that our heuristic is providing good results with respect to the optimal solution. [PUBLICATION ABSTRACT]

Stats: Type:
Acrobat PDF; Size:
826 kb; Pages:
11; Views:
10; Posted:
06/12/10

Categories: DocStore > Periodicals > Computers
Tags: INFOR, May 2009, A New Approximative Algorithm for the..., St-Hilaire, Marc, Feature, Studies, Telecommunications systems, Mobile communications networks, Heuristic, Algorithms, Network management systems, 5250, Telecommunications systems & Internet..., 9130, Experiment theoretical treatment

A New Approximative Algorithm for the Expansion Problem of 3G Networks

Document Sample

A New Approximative Algorithm for the Expansion Problem of 3G Networks

Marc St-Hilaire

INFOR; May 2009; 47, 2; Docs

By registering with docstoc.com you agree to our
privacy policy and terms of service