Radio Link Frequency Assignment

  • Authors:

  • B. Cabon;S. de Givry;L. Lobjois;T. Schiex;J. P. Warners

  • Affiliations:

  • -;-;Department of Computer Science, National Office for Aerospatial Studies and Research (ONERA), Studies and Research Center of Toulouse (CERT), Toulouse, France;Department of Biometry and Artificial Intelligence, National Institute for Agronomical Research (INRA), Toulouse, France;Department of Technical Mathematics and Informatics, Faculty of Information Technology and Systems, Delft University of Technology, Delft, The Netherlands

  • Venue:
  • Constraints
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of radio frequencyassignment is to provide communication channels from limitedspectral resources whilst keeping to a minimum the interferencesuffered by those whishing to communicate in a given radio communicationnetwork. This problem is a combinatorial (NP-hard) optimizationproblem. In 1993, the CELAR (the French ’’Centre d‘Electroniquede l‘Armement‘‘) built a suite of simplified versions of RadioLink Frequency Assignment Problems (RLFAP) starting from dataon a real network Roisnel93. Initially designed for assessingthe performances of several Constraint Logic Programming languages,these benchmarks have been made available to the public in theframework of the European EUCLID project CALMA (CombinatorialAlgorithms for Military Applications). These problems shouldlook very attractive to the CSP community: the problem is simpleto represent, all constraints are binary and involve finite domainvariables. They nevertheless have some of the flavors of realproblems (including large size and several optimization criteria).This paper gives essential facts about the CELAR instances andalso introduces the GRAPH instances which were generated duringthe CALMA project.