首页> 外文会议>IEEE International Conference on Wireless and Mobile Computing, Networking and Communications >2006 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications A Tabu Search Heuristic for the Global Planning of UMTS Networks
【24h】

2006 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications A Tabu Search Heuristic for the Global Planning of UMTS Networks

机译:2006年IEEE无线和移动计算国际会议,网络和通信禁忌搜索启发式UMTS网络的全球规划

获取原文

摘要

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.
机译:在本文中,我们提出了一个禁忌搜索启发式,以找到由三个子问题组成的通用移动电信系统(UMTS)网络的全球规划问题的“良好”可行解决方案:单元格,接入网络和核心网络规划子问题。由于这种全球规划问题被证明是NP - 艰难,我们专注于发展有效启发式的发展。数值结果表明,通过所提出的方法可以获得准优化解决方案(平均而言,在最佳解决方案的0.21%内)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号