A tabu search algorithm for the global planning problem of third generation mobile networks

Authors:
Marc St-Hilaire;Steven Chamberland;Samuel Pierre
Affiliations:
Department of Systems and Computer Engineering, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, Canada K1S 5B6;Department of Computer Engineering, ícole Polytechnique de Montréal, C.P. 6079, Succ. Centre-Ville, Montréal, Québec, Canada H3C 3A7;Department of Computer Engineering, ícole Polytechnique de Montréal, C.P. 6079, Succ. Centre-Ville, Montréal, Québec, Canada H3C 3A7
Venue:
Computers and Electrical Engineering
Year:
2008

Citing 7
Cited 6

A shortest augmenting path algorithm for dense and sparse linear assignment problems

Computing
WCDMA for UMTS: Radio Access for Third Generation Mobile Communications

WCDMA for UMTS: Radio Access for Third Generation Mobile Communications
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
An efficient heuristic for the expansion problem of cellular wireless networks

Computers and Operations Research
On the design problem of cellular wireless networks

Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Uplink UMTS network design: an integrated approach

Computer Networks: The International Journal of Computer and Telecommunications Networking
Planning UMTS base station location: optimization models with power control and algorithms

IEEE Transactions on Wireless Communications

Cooperative dynamic weapon-target assignment algorithm of multiple missiles based on networks

CCDC'09 Proceedings of the 21st annual international conference on Chinese Control and Decision Conference
A tabu search approach for assigning node Bs to switches in UMTS networks

IEEE Transactions on Wireless Communications
Comparison of different meta-heuristics to solve the global planning problem of UMTS networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient solution of the 3G network planning problem

Computers and Industrial Engineering
Automatic planning of 3G UMTS all-IP release 4 networks with realistic traffic

Computers and Operations Research
A local search heuristic to solve the planning problem of 3G UMTS all-IP release 4 networks with realistic traffic

International Journal of Autonomous and Adaptive Communications Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a tabu search (TS) algorithm for the global planning problem of third generation (3G) universal mobile telecommunications system (UMTS) networks. This problem is composed of three NP-hard subproblems: the cell, the access network and the core network planning subproblems. Therefore, the global planning problem consists in selecting the number, the location and the type of network nodes (including the base stations, the radio network controllers, the mobile switching centers and the serving GPRS (General Packet Radio Service) support nodes) as well as the interconnections between them. After describing our metaheuristic, a systematic set of experiments is designed to assess its performance. The results show that quasi-optimal solutions can be obtained with the proposed approach.