Adaptive local search for a new military frequency hopping planning problem

Authors:
I. Devarenne;A. Caminada;H. Mabed;T. Defaix
Affiliations:
UTBM, SET Lab, Belfort Cedex, France;UTBM, SET Lab, Belfort Cedex, France;UTBM, SET Lab, Belfort Cedex, France;DGA, CELAR Lab, Rennes Cedex, France
Venue:
Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
Year:
2008

Citing 2
Cited 0

Tabu Search for Frequency Assignment in Mobile Radio Networks

Journal of Heuristics
Study of Genetic Search for the Frequency Assignment Problem

AE '95 Selected Papers from the European conference on Artificial Evolution

Quantified Score

Hi-index	0.00

Visualization

Abstract

The military radio stations with frequency hopping propose new problems of frequency assignment which must take into account the size of the deployment, the limited resources and also new interferences constraints on transmitters. This new problem is public since the publication [1] with a set of 10 instances. The computing resources and the computing times are imposed. We tackle this problem with a method based on adaptive local search coming from the graph-coloring which manages phases of intensive research and diversified research. We developed several alternatives that are tested and compared on the scenarios.