Title :
A Tabu Search Heuristic for the Global Planning of UMTS Networks
Author :
St-Hilaire, Marc ; Chamberland, Steven ; Pierre, Samuel
Author_Institution :
Dept. of Comput. Eng., Ecole Polytech. de Montreal, Que.
Abstract :
In this paper, we propose a tabu search heuristic to find "good" feasible solutions for the global planning problem of universal mobile telecommunications system (UMTS) networks that is composed of three subproblems: the cell, the access network and the core network planning subproblems. Since this global planning problem has been proven to be NP-hard, we concentrate our efforts on the development of an efficient heuristic. Numerical results show that quasi-optimal solutions (on average, within 0.21% of the optimal solution) can be obtained with the proposed approach
Keywords :
3G mobile communication; heuristic programming; search problems; telecommunication network planning; NP-hard; UMTS; feasible solution; global planning problem; quasioptimal solution; tabu search heuristic; universal mobile telecommunications system network; 3G mobile communication; Ground penetrating radar; IP networks; Internet telephony; Packet switching; Radio access networks; Radio control; Radio network; Switching circuits; Telecommunication control;
Conference_Titel :
Wireless and Mobile Computing, Networking and Communications, 2006. (WiMob'2006). IEEE International Conference on
Conference_Location :
Montreal, Que.
Print_ISBN :
1-4244-0494-0
DOI :
10.1109/WIMOB.2006.1696339
