期刊文献+

蚁群算法在多用户检测中的应用及其改进

APPLICATION OF ANT COLONY OPTIMIZATION IN MULTIUSER DETECTION AND ITS IMPROVEMENT
下载PDF
导出
摘要 首先基于蚁群算法建立了一个多用户检测问题的模型,在这个模型中,蚁群算法得到了简化并且更加利于并行计算。随后将最大-最小的蚂蚁系统用于多用户检测,并通过分析算法的缺陷提出了一种蚁群算法与禁忌搜索相结合的混合算法。通过对多用户检测问题的试验仿真表明,改进算法不仅操作简单,而且全局搜索能力有了显著的提高。 A model of MUD ( MultiUser Detection) based on ACO ( Ant colony optimization) is firstly introduced in this paper, in which ACO is simplified so that it is easy to apply parallel computing. Then the paper offers a new muhiuser detector in use of max - min ant system (MMAS), and a hybrid algorithm combined by tabu search (TS) with MMAS based on the analysis of imperfections of MMAS. The experi2 ment results of muhiuser detection model show that the new algorithm is simple in application and also improves the global search ability significantly.
出处 《计算机应用与软件》 CSCD 北大核心 2008年第5期112-114,共3页 Computer Applications and Software
基金 河南省科技厅科技攻关项目(072102240032)。
关键词 蚁群算法 最大-最小蚂蚁系统 多用户检测 禁忌搜索 Ant colony optimization Max-min ant system Mutiuser detection Tabu search
  • 相关文献

参考文献7

  • 1Colomi A, Dorigo M, Maniezzo V, et al. Distributed optimization by ant colonies[ C ]. Proceedings of the 1 st European Conference on Artificial Life, 1991 : 134 - 142.
  • 2Stutzle T, Hoos H. Improvements on the ant system.. Introducing MAX- MIN ant system [ C ]. In Proceedings of the Intemational Conference on Artificial Neural Networks a-nd Genetic Algorithms, Springer Verlag, Wien. 1997:245 -249.
  • 3Verdu S. Multiuser detection [ M ]. Cambridge:Cambridge University Press, 1998.
  • 4Wolpert D H,Macteady W G. No free lunch theorems for optimization[J]. IEEE Transaction on Evolutionary Computation, 1997,1 ( 1 ) :67 -82.
  • 5Goss S,Aron S,Deneubourg J L,et al. Self-orgnized shortcuts in the argentine ant [ J ]. Naturwissenschaften, 1989,76:579 - 581.
  • 6Glover F. Tabu search-Part1[ J ]. ORSA. J. Computing, 1989,3 : 190 - 206.
  • 7Glover F. Tabu Search-Part2[ J]. ORSA. J. Computing, 1990,2:4 -32.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部