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

被引:14
作者
St-Hilaire, Marc [2 ]
Chamberland, Steven [1 ]
Pierre, Samuel
机构
[1] Ecole Polytech, Dept Comp Engn, Montreal, PQ H3C 3A7, Canada
[2] Carleton Univ, Dept Syst & Comp Engn, Ottawa, ON K1S 5B6, Canada
关键词
Third generation (3G) mobile networks; Universal mobile telecommunications system (UMTS); Network planning; Global approach; Metaheuristic; Tabu search (TS);
D O I
10.1016/j.compeleceng.2008.02.001
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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. (C) 2008 Elsevier Ltd. All rights reserved.
引用
收藏
页码:470 / 487
页数:18
相关论文
共 18 条