Skip to main content

Study of genetic search for the Frequency Assignment Problem

  • Conference paper
  • First Online:

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

Abstract

The goal of this paper is twofold. First, we present an evolutionary approach to a real world application: the Frequency Assignment Problem (FAP) in Cellular Radio Networks. Second, we present an empirical study on the effectiveness of crossover for solving this problem. Experiments carried out on a set of real-size FAP instances (up to 300 cells, 30 frequencies and 30,000 interference constraints) show the interest of EAs. At the same time, empirical evidence suggests that the contribution of crossover is marginal for this application.

Supported by the CNET (French National Research Center for Telecommunications) under the grant No.940B006-01.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Akrout. Problèmes d'affectation de fréquences: méthodes basées sur le recuit simulé. Technical Report RP/PAB/SRM/RRM/4123, CNET, 1994.

    Google Scholar 

  2. J.E. Baker. Reducing bias and inefficiency in the selection algorithm. In Proc. of Intl. Conf. on Genetic Algorithms (ICGA '87), 1987.

    Google Scholar 

  3. A. Caminada. Résolution du problème de l'affectation des fréquences par programmation par contraintes. Technical Report FT.CNET/CNET BEL/POH/CDI/71-95/CA, CNET, 1995.

    Google Scholar 

  4. W. Crompton, S. Hurley, and N.M. Stephen. A parallel genetic algorithms for frequency assignment problems. In Proc. of IMACS SPRANN'94, pages 81–84, 1994.

    Google Scholar 

  5. R. Dorne and J.K. Hao. An evolutionary approach for frequency assignment in cellular radio networks. In Proc. of IEEE Intl. Conf. on Evolutionary Computation (ICEC'95), Perth, Australia, 1995.

    Google Scholar 

  6. M. Duque-Anton, D. Kunz, and B. Rüber. Channel assignment for cellular radio using simulated annealing. In IEEE Trans. on Vehicular Technololy, volume 42, pages 14–21, 1993.

    Google Scholar 

  7. N. Funakini and Y. Takefuji. A neural network parallel algorithm for channel assignment problems in cellular radio network. In IEEE Trans. Vehicular Technology, volume 41, pages 430–437, 1992.

    Google Scholar 

  8. A. Gamst. Some lower bounds for a class of frequency assignment problems. In IEEE Trans. on Vehicular Technololy, volume 35, pages 8–14, 1986.

    Google Scholar 

  9. A. Gamst and W. Rave. On the frequency assignment in mobile automatic telephone systems. In Proc. of GLOBECOM 82, pages 309–315, 1982.

    Google Scholar 

  10. J.K. Hao and L. Perrier. Tabu search for channel assignment problems. submitted for publication, 1995.

    Google Scholar 

  11. A. Kapsalis, V.J. Rayward-Smith, and G.D. Smith. Using genetic algorithms to solve the radio link frequency assignment problem. In Proc. of Intl. Conf. on ANN and GAs (ICANNGA '95), pages 37–40, Alés, France, 1995.

    Google Scholar 

  12. D. Kunz. Channel assignment for cellular radio using neural networks. In IEEE Trans. on Vehicular Technology, volume 40, pages 188–193, 1991.

    Google Scholar 

  13. G. Syswerda. Uniform crossover in genetic algorithms. In Proc. of Intl. Conf. on Genetic Algorithms (ICGA'89), pages 2–9, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jean-Marc Alliot Evelyne Lutton Edmund Ronald Marc Schoenauer Dominique Snyers

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hao, J.K., Dorne, R. (1996). Study of genetic search for the Frequency Assignment Problem. In: Alliot, JM., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds) Artificial Evolution. AE 1995. Lecture Notes in Computer Science, vol 1063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61108-8_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-61108-8_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61108-0

  • Online ISBN: 978-3-540-49948-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics