Skip to main content

The radio link frequency assignment problem: A case study using genetic algorithms

  • Conference paper
  • First Online:
Evolutionary Computing (AISB EC 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 993))

Included in the following conference series:

Abstract

As part of a multi-national study to compare exact and heuristic techniques to solve a range of very hard combinatorial problems associated with military applications, we describe the application of genetic algorithms to the solution of the Radio Link Frequency Assignment Problem, (RLFAP). The RLFAP, as described here, is that of assigning frequencies, from a limited set of discrete frequency values, 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. A range of new genetic operators is described. These were developed to overcome the high level of epistasis that occurs. Dynamically altering the priorities of the search also proved to be effective in improving the performance of the genetic algorithm, and two methods of effecting this are described. In addition, we comment on the ways and effectiveness with which ideas based on dedicated heuristics for this problem can be incorporated into the GA. Finally we describe a hybrid GA for the RLFAP and comment on the performance of the various approaches described. This work is being undertaken as part of the EUCLID (European Cooperation for the Long Term in Defence) CALMA Project — RTP 6.4 (Combinatorial Algorithms for Military Applications [Haje93]).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baybars, I. Optimal Assignment of Broadcasting Frequencies. European Journal of Operations Research 9 (1982), 257–263.

    Google Scholar 

  2. Beasley, D., Bull, D.R. and Martin, R.R. An Overview of Genetic Algorithms: Part 2, Research Topics. University Computing 15 (1993), 170–181.

    Google Scholar 

  3. Berry, R.H. and Smith, G.D. Using a Genetic Algorithm to Investigate Taxation-Induced Interactions in Capital Budgeting. In Proc. Int. Conf. on Artificial Neural Networks and Genetic Algorithms, Albrecht, R.F., Reeves, C.R. and Steele, N.C., Springer-Verlag, 1993, 567–574.

    Google Scholar 

  4. Corne, D., Ross, P. and Fang, H-L, Fast Practical Evolutionary Timetabling. In Evolutionary Computing, Lecture Notes in Computer Science No. 865, Fogarty, T.C. (ed.), 1994, 250–263.

    Google Scholar 

  5. Crompton, W., Hurley, S. and Stephens, N.M. A Parallel Genetic Algorithm for Frequency Assignment Problems. In IMACS International Symposium on Signal Processing, Robotics and Neural Networks, 1994, pp. 81–84.

    Google Scholar 

  6. Hajema, W., Minoux, M. and West, C., “Request for Proposals on the CALMA project. Technical Appendix: Statement of the Radio Link Frequency Assignment Problem”, 1993.

    Google Scholar 

  7. Hale, W.K. Frequency Assignment: Theory and Applications. Proceedings of the IEEE 68, 12 (December 1980), 1497–1514.

    Google Scholar 

  8. Holland, J.H. Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI (1975).

    Google Scholar 

  9. Kapsalis, A., Rayward-Smith, V.J. and Smith, G.D. Solving the Graphical Steiner Tree Problem using Genetic Algorithms. J. Oper. Res. Soc. 44(1993), 397–406.

    Google Scholar 

  10. Kapsalis, A., Rayward-Smith, V.J. and Smith, G.D. 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, Albrecht, R.F., Reeves, C.R. and Steele, N.C., Springer Verlang, 1993.

    Google Scholar 

  11. Karp, R.M. Reducibility among combinatorial problems. In Complexity of computer computations, Miller, R.E. and Thatcher, J.W., Springer Verlang, 1972, pp. 85–103.

    Google Scholar 

  12. Kunz, D. Channel Assignment for Cellular Radio Using Neural Networks. IEEE Transactions on Vehicular Technology 40, 1 (February 1991), 188–193.

    Google Scholar 

  13. Mann, J.W., Kapsalis, A. and Smith, G.D. The GAmeter Toolkit. In Applications of Modern Heuristic Methods, Rayward-Smith, V.J., Alfred Waller ltd, 1995, pp. 195–209.

    Google Scholar 

  14. Matula, D.W. and Beck, L.L. Smallest-Last Ordering and Clustering and Graph Coloring Algorithms. Journal ACM 30(1983), 417–427.

    Google Scholar 

  15. Reeves, C.R. Genetic Algorithms and Combinatorial Optimisation, in Applications of Modern Heuristic Methods, Rayward-Smith, V.J. (ed.), Alfred Waller, 1995, 111–126.

    Google Scholar 

  16. Smith, A.E. and Tate, D.M. Genetic Optimisation using a Penalty Function. Proc. Int. Conf. Genetic Algorithms, Forrest, S. (ed.), Morgan Kaufmann, 1993, 499–503.

    Google Scholar 

  17. Smith, G.D. Economic Applications of Genetic Algorithms, in Applications of Modern Heuristic Methods, Rayward-Smith, V.J. (ed.), Alfred Waller, 1995, 71–90.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Terence C. Fogarty

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kapsalis, A., Chardaire, P., Rayward-Smith, V.J., Smith, G.D. (1995). The radio link frequency assignment problem: A case study using genetic algorithms. In: Fogarty, T.C. (eds) Evolutionary Computing. AISB EC 1995. Lecture Notes in Computer Science, vol 993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60469-3_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-60469-3_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60469-3

  • Online ISBN: 978-3-540-47515-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics