Using Genetic Algorithms to Solve the Radio Link Frequency Assignment Problem
The Radio Link Frequency Assignment Problem (RLFAP) is that of assigning frequencies to a number of radio links in such a manner as to simultaneously satisfy a large number of constraints and use as few distinct frequencies as possible. This problem is known to be NP-complete. We describe the application of a genetic algorithm to the solution of the RLFAP. The standard crossover operators were found to be of limited use due to the highly epistatic nature of the problem and a range of new (crossover and mutation) operators are described. Dynamically modifying the weights used in the fitness function has also proved to be effective in improving the performance of the standard genetic algorithm. This work is being undertaken as part of the EUCLID CALMA Project - RTP 6.4, Combinatorial Algorithms for Military Applications.
KeywordsGenetic Algorithm Steiner Tree Steiner Tree Problem Pairwise Constraint CELAR Problem
Unable to display preview. Download preview PDF.
- R.H. Berry and G.D. Smith. Using a genetic algorithm to investigate taxation-induced interactions in capital budgeting. In Proceedings of the International Conference on Neural Networks and Genetic Algorithms, Innsbruck, 1993. Springer-Verlag.Google Scholar
- W. Crompton, S. Hurley, and N.M. Stephens. Frequency assignment using a parallel genetic algorithm. In Proceedings of Natural Algorithms in Signal Processing. IEE, 1993.Google Scholar
- UEA CALMA Group. Genetic algorithm approaches to solving the radio link frequency assignment problem. Technical report, University of East Anglia, 1994.Google Scholar
- A. Kapsalis, V.J. Rayward-Smith, and G.D. Smith. Fast sequencial and parallel implementation of genetic algorithms using the gameter toolkit. In Proceedings of the Int. Conf. on Artificial Neural Nets and Genetic Algorithms. Springer Verlang, 1993.Google Scholar
- T.A. Lanfear. Graph theory and radio frequency assignment. Technical report, NATO EMC Analysis Programme, 1989. Project No. 5.Google Scholar