.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
fixed-spectrum problems
radio-frequency assignment
tabu search algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W
Organization
No organization information available