.png){kind=icon}
返回
An improved tabu search algorithm for the fixed-spectrum frequency-assignment problem
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2003.810976.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A tabu search algorithm with a dynamic tabu list for the fixed-spectrum frequency-assignment problem is presented. For cellular problems, the algorithm can be combined with an efficient cell reoptimization step. The algorithm is tested on several sets of test problems and compared with existing algorithms of established performance. In particular, it is used to improve some of the best existing assignments for COST 259 benchmarks. These results add support to the claim that the algorithm is the most effective available, at least when solution quality is a more important criterion than solution speed. The algorithm is robust and easy to tune.
Keyword:
fixed-spectrum problems
radio-frequency assignment
tabu search algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.1
论文数:
1.8W
被引数:
6.6W
机构
暂无机构信息
引用论文
Clearance of hepatitis B surface antigen in chronic carriers of hepatitis delta antibodies.png)
Liver
LiverIF0
PREAI
分享收藏分享收藏
查看更多内容