Abstract
The problem considered in this paper consists in defining an assignment of frequencies to radio link between transmitters which minimize the number of frequency used to solve a CSP very well referenced as ROADEF’01 challenge. This problem is NP-hard and few results have been reported on techniques for solving it optimally. We applied to this version of the frequency assignment problem an original hybrid method which combines constraint propagation and Tabu search. Two Tabu lists are used to filter the search space and to avoid algorithm cycles. Computational results, obtained on a number of standard problem instances, show the efficiency of the proposed approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Dib, M., Caminada, A., Mabed, H.: Constraint Propagation with Tabu List for Min-Span Frequency Assignment Problem. In: Le Thi, H.A., Bouvry, P., Pham Dinh, T. (eds.) MCO 2008. CCIS, vol. 14, pp. 97–106. Springer, Heidelberg (2008)
Jussien, N., Lhomme, O.: Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence 139(1), 21–45 (2002)
Dupont, A.: Étude d’une méta-heuristique hybride pour l’affectation de fréquences dans les réseaux tactiques évolutifs. PhD thesis, Université Montpellier II (October 2005)
Devarenne, I., Mabed, H., Caminada, A.: Analysis of Adaptive Local Search for the Graph Coloring Problem. In: 6th Metaheuristic International Conference, MIC (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dib, M., Caminada, A., Mabed, H. (2009). A Fast Algorithm to Solve the Frequency Assignment Problem. In: van Hoeve, WJ., Hooker, J.N. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2009. Lecture Notes in Computer Science, vol 5547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01929-6_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-01929-6_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01928-9
Online ISBN: 978-3-642-01929-6
eBook Packages: Computer ScienceComputer Science (R0)