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.
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
Preview
Unable to display preview. Download preview PDF.
References
Defaix, T.: SFH-FP Slow Frequency Hopping - Frequency Planning. In: Septième Congrès de la Société ROADEF 2006, Lille, France (2006)
Milstein, L.B., Simon, M.K.: Spread spectrum communications. In: The mobile communications handbook, pp. 152–165. IEEE Press, Los Alamitos (1996)
Aardal, K., van Hoesel, C., Koster, A., et al.: Models and Solution Techniques for Frequency Assignment Problems. ZIB-report, Berlin, pp. 01–40 (2001)
Koster, A.M.C.A.: Frequency Assignment: Models and Algorithms. PHDThesis Universiteit Maastricht (1999)
Comellas, F., Ozón, J.: Graph Coloring Algorithms for Assignment Problems in Radio Networks. In: Alspector, J., et al. (eds.) Applic. of Neural Nets, pp. 49–56 (1995)
Dorne, R., Hao, J.: Tabu Search for graph coloring, T-coloring and Set T-colorings. In: Osman, I., et al. (eds.) Theory and Applications. Theory and Applications, Kluwer, Dordrecht (1998)
Avanthay, C., Hertz, A., Zufferey, N.: A variable neighborhood search for graph coloring. European Journal of Operational Research 151, 379–388 (2003)
Eisenblätter, A., Grötschel, M., Koster, A.: Frequency Planning and Ramifications of Coloring. Discussiones Mathematicae, Graph Theory 22, 51–88 (2002)
Hao, J.-K., Dorne, R.: Study of Genetic Search for the Frequency Assignment Problem. In: Alliot, J.-M., Ronald, E., Lutton, E., Schoenauer, M., Snyers, D. (eds.) AE 1995. LNCS, vol. 1063, pp. 333–344. Springer, Heidelberg (1996)
Renaud, D., Caminada, A.: Evolutionary Methods and Operators for Frequency Assignment Problem. SpeedUp Journal 11(2), 27–32
Weinberg, B., Bachelet, V., Talbi, G.: A co-evolutionist meta-heuristic for the FAP. In: Frequency Assignment Workshop, London, England (2000)
Palpant, M., Artigues, C., Michelon, P.: A Large Neighborhood Search method for solving the frequency assignment problem. LIA report 385 (2003)
Hao, J.-K., Dorne, R., Galinier, P.: Tabu search for Frequency Assignment in Mobile Radio Networks. Journal of Heuristics 4(1), 47–62 (1998)
Montemanni, R., Moon, J., Smith, D.H.: An Improved Tabu search Algorithm for the Fixed-Spectrum FAP. IEEE Trans. on VT 52(4), 891–901 (2003)
Montemanni, R., Smith, D.H.: A Tabu search Algorithm with a dynamic tabu list for the FAP. Technical Report, University of Glamorgan (2001)
Dupont, A., Vasquez, M., Habet, D.: Consistent Neighbourhood in a Tabu search. In: Workshop on Constraint Programming techniques, Nantes (2005)
Schulz, M.: Solving Frequency Assignment Problem with Constraint Programming. Technische Universität Berlin, Institut für Mathematik (2003)
Yokoo, M., Hirayama, K.: Frequency Assignment for Cellular Mobile Systems Using Constraint Satisfaction Techniques. In: Proc. of IEEE VTC Spring (2000)
Moon, J., Hughes, L., Smith, D.: Assignment of Frequency Lists in Frequency Hopping Networks. IEEE Trans. on Vehicular Technology 54(3), 1147–1159 (2005)
Devarenne, I., Caminada, A., Mabed, H.: Analysis of Adaptive Local Search for the Graph Coloring Problem. In: 6th MIC 2005, Vienne, Autriche (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Devarenne, I., Caminada, A., Mabed, H., Defaix, T. (2008). Adaptive Local Search for a New Military Frequency Hopping Planning Problem. In: Giacobini, M., et al. Applications of Evolutionary Computing. EvoWorkshops 2008. Lecture Notes in Computer Science, vol 4974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78761-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-78761-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78760-0
Online ISBN: 978-3-540-78761-7
eBook Packages: Computer ScienceComputer Science (R0)