Radio Link Frequency Assignment

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...

Full description

Saved in:
Bibliographic Details
Published in:Constraints : an international journal Vol. 4; no. 1; pp. 79 - 89
Main Authors: Cabon, B., de Givry, S., Lobjois, L., Schiex, T., Warners, J.P.
Format: Journal Article
Language:English
Published: Heidelberg Springer 1999
Springer Verlag
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Artificial intelligence
Computer science; control theory; systems
Exact sciences and technology
Humanities and Social Sciences
Learning and adaptive systems
Library and information sciences
Office automation, teleprocessing
Software
Theoretical computing
Allocation
Algorithm performance
Constraint satisfaction
NP complete problem
Constraint logic programming
Radiofrequency
Algorithm
Optimization
Remote data processing
radio link frequency assignment
benchmarks
optimization
constraint satisfaction
ISSN:1383-7133, 1572-9354
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1383-7133
1572-9354
DOI:10.1023/A:1009812409930