Skip to main content

The frequency assignment problem: A look at the performance of evolutionary search

  • Methodologies
  • Conference paper
  • First Online:
Artificial Evolution (AE 1997)

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

Included in the following conference series:

Abstract

The performance of evolutionary search on the Frequency Assignment Problem is the topic of ongoing research. In this paper the performed evaluation is done in two steps. First, the fitness landscape to be optimized is analyzed. Secondly, the performance of different search procedures is described. The insight gained from the fitness landscape analysis is related to the performance of the different search procedures.

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. Balston, D.M., Macario, R. C. V. (Eds): Cellular Radio Systems. Artech House (1993)

    Google Scholar 

  2. Crompton, W., Hurley, S., Stephens, N.M.: A Parallel Genetic Algorithm for Frequency Assignment Problems. Proc. of IMACS SPRANN. (1994) 81–84.

    Google Scholar 

  3. Dorne, R., Hao, J.-K.: An Evolutionary Approach for Frequency Assignment in Cellular Radio Networks. Proc. of IEEE Intl. Conf. on Evolutionary Computation. (1995) 539–544.

    Google Scholar 

  4. Hao, J.-K., Dorne, R.: Study of Genetic Search for the Frequency Assignment Problem. Artificial Evolution, LNCS 1063. (1996) 333–344.

    Google Scholar 

  5. Hale, W.H.: Frequency Assignment: Theory and Application. Proc. of the IEEE, Vol. 68, No. 12 (1980) 1498–1573.

    Google Scholar 

  6. Rose, H., Ebeling, W., Asselmeyer, T.: The Density of States — a Measure of the Difficulty of Optimisation Problems. Parallel Problem Solving from Nature — PPSN IV. (1996) 208–217.

    Google Scholar 

  7. Asselmeyer, T., Ebeling, W., Rose, H.: Smoothing representation of fitness landscapes — the genotype-phenotype map of evolution. http://summa.physik.huberlin.de/~torsten/

    Google Scholar 

  8. Jones, T., Forrest, S.: Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms. Proceedings of the 6.th ICGA. (1995) 184-192.

    Google Scholar 

  9. Bouju, A. et al.: Tabu search for radio links frequency assignment problem. Applied Decision Technologies, London. UNICOM Conf. (1995).

    Google Scholar 

  10. Smith, G.D. et al.: EUCLID CALMA Radio Link Frequency Assignment Project; Technical Annexe T-2.1:A-Supplementary Report.

    Google Scholar 

  11. Mühlenbein H.: Evolution in Time and Space — The Parallel Genetic Algorithm. Foundations of Genetic Algorithms. (1991) 316–337.

    Google Scholar 

  12. Description of the CALMA Benchmark Problems. http://dutiosd.twi.tudelft.nl/~rlfap/

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jin-Kao Hao Evelyne Lutton Edmund Ronald Marc Schoenauer Dominique Snyers

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Crisan, C., Mühlenbein, H. (1998). The frequency assignment problem: A look at the performance of evolutionary search. In: Hao, JK., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds) Artificial Evolution. AE 1997. Lecture Notes in Computer Science, vol 1363. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026606

Download citation

  • DOI: https://doi.org/10.1007/BFb0026606

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64169-8

  • Online ISBN: 978-3-540-69698-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics