Skip to main content

Advertisement

Springer Nature Link
Log in

Radio Link Frequency Assignment

  • Published:
Constraints Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

The problem of radio frequency assignment is to provide communication channels from limited spectral resources whilst keeping to a minimum the interference suffered by those whishing to communicate in a given radio communication network. This problem is a combinatorial (NP-hard) optimization problem. In 1993, the CELAR (the French “Centre d'Electronique de l'Armement”) built a suite of simplified versions of Radio Link Frequency Assignment Problems (RLFAP) starting from data on a real network Roisnel93. Initially designed for assessing the performances of several Constraint Logic Programming languages, these benchmarks have been made available to the public in the framework of the European EUCLID project CALMA (Combinatorial Algorithms for Military Applications). These problems should look very attractive to the CSP community: the problem is simple to represent, all constraints are binary and involve finite domain variables. They nevertheless have some of the flavors of real problems (including large size and several optimization criteria). This paper gives essential facts about the CELAR instances and also introduces the GRAPH instances which were generated during the CALMA project.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. C. Bessière, E.C. Freuder, and J.C. Régin (1995). Using inference to reduce arc-consistency computation. In Proc. of the 14th IJCAI, Montréal, Canada.

  2. Christian Bessière and Jean-Charles Régin (1996). MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In Proc. of the Second International Conference on Principles and Practice of Constraint Programming, Cambridge, MA.

  3. S. Bistarelli, U. Montanari, and F. Rossi (1995). Constraint solving over semirings. In Proc. of the 14th IJCAI, Montréal, Canada.

  4. Ir. A.A.F. Bloemen (1992). Frequency assignment in mobile telecommunication networks. Technical report, Tech. Universiteit Eindhoven.

  5. B. Cabon (1996). Problèmes d'optimisation combinatoire: évaluation deméthodes de la physique statistique. Thèse, ENSAE, Toulouse, France.

    Google Scholar 

  6. S. de Givry, G. Verfaillie, and T. Schiex (1997). Bounding the Optimum of Constraint Optimization Problems. In Proc. of the 3rd International Conference on Principles and Practice of Constraint Programming (CP-97), Schloss Hagenberg, Austria.

  7. E.C. Freuder and R.J. Wallace (1992). Partial constraint satisfaction. Artificial Intelligence, 58:21–70.

    Google Scholar 

  8. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi (1983). Optimization by simulated annealing. Science, 220:671–680.

    Google Scholar 

  9. A. Kolen (1994). A constraint satisfaction approach to the radio link frequency assignment problem. Technical Report 2.2.2, EUCLID CALMA project, 1994. Available at ftp://ftp.win.tue.nl/pub/ techreports/ CALMA/222.ps.

  10. A. Kolen (1996). Results on infeasible instances of the RLFAP. Personal communication.

  11. A. Kolen (forthcoming). A genetic algorithm for the partial binary satisfaction problem: An application to a frequency assignment problem. Technical report, University of Maastricht, Maastricht, The Netherlands.

  12. T.A. Lanfear (1989). Graph theory and radio frequency assignment. Technical report, NATO, Allied Radio Frequency Agency.

  13. A. K. Mackworth (1977). Consistency in networks of relations. Artificial Intelligence, 8:99–118.

    Google Scholar 

  14. C. Peterson and B. Soderberg (1989). A new method for mapping optimization problems onto neural networks. Int. Journal of Neural Systems, 1(1):3–22.

    Google Scholar 

  15. C. Roisnel (1993). Étude comparative d'outils de programmation par contraintes – synthèse et résultats.Technical Report ITES/555-93/RS 10539, CELAR.

  16. T. Schiex, H. Fargier, and G. Verfaillie (1995). Valued constraint satisfaction problems: hard and easy problems. In Proc. of the 14th IJCAI, pages 631–637, Montréal, Canada.

  17. T. Schiex, J.-C. Régin, C. Gaspin, and G. Verfaillie (1996). Lazy arc consistency. In Proc. of AAAI-96, Portland, OR, AAAI Press.

    Google Scholar 

  18. S. Tiourine, C. Hurkens, and J.K. Lenstra (1995). An overview of algorithmic approaches to frequency assignment problems. Technical report, EUCLID CALMA project, Eindhoven University of Technology.Available at ftp://ftp.win.tue.nl/pub/techreports/CALMA/overview.ps.

  19. H.P. Van Benthem (1995). GRAPH: Generating radio link frequency assignment problems heuristically. Master's thesis, Faculty of Technical Mathematics and Informatics, Delft University of Technology, Delft, The Netherlands.

    Google Scholar 

  20. D.E. Van den Bout and T.K. Miller (1989). Graph Partitioning using Annealed Neural Networks. In Proc. of IJCNN-89, pages 521–528, Washington.

  21. J.P. Warners (1996). A nonlinear approach to a class of combinatorial optimization problems. Technical Report 96–119, Delft University of Technology, Delft, The Netherlands. To appear in Statistica Neerlandica.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, National Office for Aerospatial Studies and Research (ONERA), Studies and Research Center of Toulouse (CERT), Toulouse, France

    L. Lobjois

  2. Department of Biometry and Artificial Intelligence, National Institute for Agronomical Research (INRA), Toulouse, France

    T. Schiex

  3. Department of Technical Mathematics and Informatics, Faculty of Information Technology and Systems, Delft University of Technology, Delft, The Netherlands

    J.P. Warners

Authors
  1. B. Cabon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. de Givry
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. L. Lobjois
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. T. Schiex
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. J.P. Warners
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cabon, B., de Givry, S., Lobjois, L. et al. Radio Link Frequency Assignment. Constraints 4, 79–89 (1999). https://doi.org/10.1023/A:1009812409930

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009812409930

Search

Navigation

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy