Cart (Loading....) | Create Account
Close category search window

A Tabu Search Heuristic for the Global Planning of UMTS Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
St-Hilaire, M. ; Dept. of Comput. Eng., Ecole Polytech. de Montreal, Que. ; Chamberland, Steven ; Pierre, Samuel

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

Published in:

Wireless and Mobile Computing, Networking and Communications, 2006. (WiMob'2006). IEEE International Conference on

Date of Conference:

19-21 June 2006

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.