首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于集合覆盖和禁忌搜索算法的WCDMA基站布局
引用本文:林俊龙,何晨.基于集合覆盖和禁忌搜索算法的WCDMA基站布局[J].上海交通大学学报,2007,41(6):924-928.
作者姓名:林俊龙  何晨
作者单位:上海交通大学,电子工程系,上海,200240
摘    要:分析和比较了集合覆盖和禁忌搜索两种高效布局算法的优化性能和计算时间.在此基础上提出了一种新的WCDMA基站布局算法,该算法使用集合覆盖进行整体布局,使用禁忌搜索进行局部优化.由于综合利用了集合覆盖算法的快速性和禁忌搜索算法的精确性,实际场景仿真结果显示,新算法仅用禁忌搜索算法8.8%的计算时间,就搜索到比禁忌搜索算法优化性能更好的布局配置.

关 键 词:宽带码分多址  基站布局  集合覆盖  禁忌搜索  功率分配
文章编号:1006-2467(2007)06-0924-05
收稿时间:2006-07-28
修稿时间:2006年7月28日

The WCDMA Cell Planning Based on Set Covering and Tabu Search algorithms
LIN Jun-long,HE Chen.The WCDMA Cell Planning Based on Set Covering and Tabu Search algorithms[J].Journal of Shanghai Jiaotong University,2007,41(6):924-928.
Authors:LIN Jun-long  HE Chen
Abstract:The optimization quality and computation time of set covering and tabu search algorithms were analyzed and compared.Based on the result,a novel wideband code division multiple(WCDMA) cell planning algorithm was proposed,which uses the set covering for overall planning and applies the tabu search for further local optimization.Since the novel algorithm makes good use of both the efficiency of the set covering and accuracy of the tabu search,in real instance,it achieves better performance than tabu search algorithm with only 8.8% of its computation time.
Keywords:wideband code division multiple access(WCDMA)  cell planning  set covering  tabu search  power assignment
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号