Frequency assignment, multiple interference and binary constraints

Authors:
J. S. Graham;R. Montemanni;J. N. J. Moon;D. H. Smith
Affiliations:
Division of Mathematics and Statistics, University of Glamorgan, Pontypridd, Mid Glamorgan, UK;Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), Galleria, Manno, Switzerland;School of Computing, University of Glamorgan, Pontypridd, Mid Glamorgan, UK;Division of Mathematics and Statistics, University of Glamorgan, Pontypridd, Mid Glamorgan, UK
Venue:
Wireless Networks
Year:
2008

Citing 3
Cited 1

T-colorings of graphs: recent results and open problems

Discrete Mathematics - Special issue: advances in graph labelling
A user's guide to tabu search

Annals of Operations Research - Special issue on Tabu search
Ant algorithms for discrete optimization

Artificial Life

The Assignment of CDMA Spreading Codes Constructed from Hadamard Matrices and Almost Bent Functions

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The most accurate approaches to frequency assignment problems minimize a cost function based on signal-to-interference ratios at points where reception is required. The merits of this approach are counterbalanced by much greater requirements for computational resources than for the traditional approach using binary frequency separation constraints. This can make run times unrealistic for the largest problems. In this paper the merits of the signal-to-interference based cost function are confirmed, but it is shown that algorithms are faster and give better quality results if this cost function is combined with the binary constraint approach. Two types of algorithm are used to illustrate the combined approach, simulated annealing and a new ant colony system algorithm. The combined approach studied is applicable to all the main classes of frequency assignment problem.