Solving the Frequency Assignment Problem by Site Availability and Constraint Programming

TL;DR

This paper introduces a novel approach to solving the static Frequency Assignment Problem using Constraint Programming combined with site availability concepts, demonstrating promising results through simulations.

Contribution

It integrates site availability with constraint programming to improve static FAP solutions, a novel combination in this context.

Findings

Numerical simulations show promising results.

Effective integration of site availability and constraint programming.

Potential for improved bandwidth management in radio communications.

Abstract

The efficient use of bandwidth for radio communications becomes more and more crucial when developing new information technologies and their applications. The core issues are addressed by the so-called Frequency Assignment Problems (FAP). Our work investigates static FAP, where an attempt is first made to configure a kernel of links. We study the problem based on the concepts and techniques of Constraint Programming and integrate the site availability concept. Numerical simulations conducted on scenarios provided by CELAR are very promising.