Skip to main content
SpringerLink
Log in

A Co-evolutionist Meta-heuristic for the Assignment of the Frequencies in Cellular Networks

  • Conference paper
  • First Online:
Applications of Evolutionary Computing (EvoWorkshops 2001)

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

Included in the following conference series:

Abstract

This paper presents a new approach, the COSEARCH approach, for solving the Problem of Assigning Frequencies (FAP) on antennas of a cellular telecommunication network. The COSEARCH approach is a co-evolutionist method in which complementary metaheuristics, such as genetic algorithm (GA) or tabu search (TS), cooperate in parallel via an adaptive memory (AM). We introduce an original encoding and two new cross-over operators suited to FAP. COSEARCH for the FAP is compared with other studies and its efficiency is revealed on both medium and large instances.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Bachelet and E.G. Tabli. Co-search: A parallel co-evolutionary metaheuristic. In Congress on Evolutionary Computation CEC’2000, pages 1550–1557, San Diego, USA, 2000.

    Google Scholar 

  2. P. Bessiere, J.M. Ahuactzin, E-G. Talbi, and E. Mazer. The ariadne’s clew algorithm: global planning with local methods. IEEE International Conference on Intelligent Robots Systems IROS, Yokohama, Japan, pages 1373–1380, july 1993.

    Google Scholar 

  3. A. Bouju, J.F. Boyce, C.H.D. Dimitropoulos, G. Vom Scheid, and J.G. Taylor. Tabu search for the radio links frequency assignment problem. In Applied Decision Technologies, pages 233–250, London ADT’95, april 1995.

    Google Scholar 

  4. A. Bouju, J.F. Boyce, C.H.D. Dimitropoulos, G. Vom Scheidt, and J.G. Taylor. Intelligent search for the radio links frequency assignment problem. In Digital Signal Processing DSP’95, pages-, University of Cyprus, june 1995.

    Google Scholar 

  5. R. Dorne. Etude des méthodes heuristiques pour la coloration, la T-coloration et l’ffectation de fréquences. PhD thesis, Université de Montpellier II, 1998.

    Google Scholar 

  6. R. Dorne and J.K. Hao. An evolutionary approch for frequency assigment in cellular radio networks. In IEEE Intl. Conf. on Evolutionary Computation (IEEE ICEC’95), pages 539–544, Perth, Australia, 1995.

    Google Scholar 

  7. R. Dorne and J.K. Hao. Constraint handling in evolutionary search: A case study of the frequency assignment. In Parallel Problem Solving from Nature PPSN’96, pages 801–810, Berlin Germany, sept 1996. Lecture Notes in Computer Science.

    Google Scholar 

  8. J.K. Hao and R. Dorne. Study of genetic search for the frequency assignment problem. In Artifical Evolution AE’95, pages 333–344, Brest France, 1996. Lecture Notes in Computer Science.

    Chapter  Google Scholar 

  9. J.K. Hao, R. Dorne, and P. Galinier. Tabu search for frequency assignment problem in mobile radio networks. Journal of Heuristics, pages 47–62, june 1998.

    Google Scholar 

  10. S. Hurley, D. Smith, and C. Valenzuela. A permutation based genetic algorithm for minimum span frequency assignment. In Parallel Problem Solving from Nature PPSN’5, pages 907–916, Amsterdam, sept 1998. Springer-Verlag.

    Google Scholar 

  11. T.L. Lau and E.P.K. Tsang. Solving the radiolink frequency assignment problem with the guided genetic algorithm. In NATO Symposium on Radio Length Frequency Assignment, Sharing and Conservation Systems (Aerospace), Aalborg, Denmark, Oct 1998.

    Google Scholar 

  12. V. Maniezzo and A. Carbonaro. An ants heuristic for the frequency assignment problem. In Ants’98, pages 927–935, North-Holland/Elsevier, Amsterdam, oct 1998. M.Dorigo.

    Google Scholar 

  13. R. Steuer. Multiple criteria optimization: Theory, computation and application. Wiley, New York, 1986.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. USTL-LIFL-UPRESA 8022 CNRS, 59655, Villeneuve d’Ascq CEDEX, France

    Benjamin Weinberg & El-Ghazali Talbi

  2. CREGI-FUCaM, B, 7000, Mons, Belgium

    Vincent Bachelet

Authors
  1. Benjamin Weinberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vincent Bachelet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. El-Ghazali Talbi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Leiden University, Niels Bohrweg1, 2333, CA, Leiden, The Netherlands

    Egbert J. W. Boers

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Weinberg, B., Bachelet, V., Talbi, EG. (2001). A Co-evolutionist Meta-heuristic for the Assignment of the Frequencies in Cellular Networks. In: Boers, E.J.W. (eds) Applications of Evolutionary Computing. EvoWorkshops 2001. Lecture Notes in Computer Science, vol 2037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45365-2_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-45365-2_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41920-4

  • Online ISBN: 978-3-540-45365-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation