An improved tabu search algorithm for the fixed-spectrum frequency-assignment problem

Abstract

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.

DOI: 10.1109/TVT.2003.810976

Cite this paper

@article{Montemanni2003AnIT, title={An improved tabu search algorithm for the fixed-spectrum frequency-assignment problem}, author={Roberto Montemanni and Jim N. J. Moon and Derek H. Smith}, journal={IEEE Trans. Vehicular Technology}, year={2003}, volume={52}, pages={891-901} }