Algorithms for frequency assignment problems

K.I. Aardal, C.A.J. Hurkens, J.K. Lenstra, S.R. Tiourine

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

2 Downloads (Pure)

Samenvatting

Frequency assignment problems occur when a network of radio links has to be established. Each link has to be assigned an operating frequency from a set of available frequencies. The assignment has to satisfy certain interference limiting restrictions defined on pairs of links. Moreover, the number of frequencies used is to be minimized. These problems have been investigated by a consortium consisting of research groups from Delft, Eindhoven, London, Maastricht, Norwich, and Toulouse. The participants developed optimization algorithms based on branch-and-cut and constraint satisfaction, as well as approximation techniques such as simulated annealing, taboo search, variable-depth search, genetic algorithms, and potential reduction methods. These algorithms were tested and compared on a set of real-life instances.
Originele taal-2Engels
Pagina's (van-tot)1-8
TijdschriftCWI Quarterly
Volume9
Nummer van het tijdschrift1-2
StatusGepubliceerd - 1996

Vingerafdruk Duik in de onderzoeksthema's van 'Algorithms for frequency assignment problems'. Samen vormen ze een unieke vingerafdruk.

  • Citeer dit

    Aardal, K. I., Hurkens, C. A. J., Lenstra, J. K., & Tiourine, S. R. (1996). Algorithms for frequency assignment problems. CWI Quarterly, 9(1-2), 1-8.