A tabu search algorithm with a dynamic tabu list for the frequency assignment problem

The frequency assignment problem involves the assignment of discrete channels (or frequencies) to the transmitters of a radio network, such a s a mobile telephone network. Frequency separation is necessary to avoid interference by other transmitters to the signal received from the wanted transmitter at the reception points. Unnecessary separation causes an excess requirement for spectrum. Good assignments minimise interference and the spectrum required. In this paper we study the spectrum frequency assignment prob-lem, where the frequency spectrum available is given and the target is to minimise (a measure of) the interference in the network. In particular a tabu search algorithm with some non-standard features, together with implementation details, is described for this problem. Computational results connrm the quality of the algorithm we propose, in comparison with methods of other authors.