By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Montemanni, R. ; Univ. of Glamorgan, Mid Glamorgan, UK ; Moon, J.N.J. ; Smith, D.H.

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.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:52 ,  Issue: 4 )