Abstract
This study proposes a novel approach to solve a variant of the frequency assignment problem known as the static minimum order frequency assignment problem. This problem involves assigning frequencies to a set of requests while minimizing the number of frequencies used. This approach solves the static problem by modeling it as a dynamic problem through dividing this static problem into smaller sub-problems, which are then solved in turn in a dynamic process using an improved tabu search algorithm. Several novel and existing techniques are used to improve the efficiency of this approach. This includes a technique that aims to determine a lower bound on the number of frequencies required from each domain for a feasible solution to exist in each sub-problem, based on the underlying graph coloring model. These lower bounds ensure that the search focuses on parts of the solution space that are likely to contain feasible solutions. Another technique, called the gap technique, aims to identify a good frequency to be assigned to a given request. Our approach was tested on real and randomly generated benchmark datasets of the static problem and achieved competitive results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
http://fap.zib.de/problems/CALMA/ (last accessed 25 December 2015).
- 2.
http://fap.zib.de/problems/CALMA/ (last accessed 25 December 2015).
References
Metzger, B.: Spectrum Management Technique presented at 38th National ORSA Meeting, Detroit, MI (Fall 1970)
Garey, M.R., Johnson, D.S.: A Guide to the Theory of NP-Completeness. WH Freemann, New York (1979)
Kapsalis, A., et al.: The Radio Link Frequency Assignment Problem: A Case Study Using Genetic Algorithms. Evolutionary Computing, pp. 117–131. Springer, Berlin (1995)
Crisan, C., Mühlenbein, H.: The frequency assignment problem: a look at the performance of evolutionary search. Artificial Evolution. Springer, (1997)
Parsapoor, M., Bilstrup, U.: Ant colony optimization for channel assignment problem in a clustered mobile ad hoc network. Advances in Swarm Intelligence, pp. 314–322. Springer, Berlin (2013)
Tiourine, S.R., Hurkens, C.A.J., Lenstra, J.K.: Local search algorithms for the radio link frequency assignment problem. Telecommun. Syst. 13(2–4), 293–314 (2000)
Bouju, A., et al.: Tabu search for the radio links frequency assignment problem. In: Applied Decision Technologies (ADT’95), London (1995)
Bouju, A., et al.: Intelligent search for the radio link frequency assignment problem. In: Proceedings of the International Conference on Digital Signal Processing, Cyprus (1995)
Hao, J.-K., Dorne, R., Galinier, P.: Tabu search for frequency assignment in mobile radio networks. J. Heuristics 4(1), 47–62 (1998)
Glover, F., Laguna, M.: Tabu Search Applications. Tabu Search, pp. 267–303. Springer, (1997)
Alrajhi, K., Thompson, J.M., Padungwech, W.: Tabu search hybridized with multiple neighborhood structures for the frequency assignment problem. In: 10th International Workshop on Hybrid Metaheuristics (HM2016). Lecture Notes in Computer Science (LNCS, vol. 9668). 2016. Springer, Plymouth, UK, pp. 157–170
Hale, W.K.: Frequency assignment: theory and applications. Proc. IEEE 68(12), 1497–1514 (1980)
Dorne, R., Hao, J.-K.: Constraint handling in evolutionary search: a case study of the frequency assignment. Parallel Problem Solving from Nature—PPSN IV, pp. 801–810. Springer, Berlin (1996)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Alrajhi, K., Padungwech, W. (2017). A Dynamic Tabu Search Approach for Solving the Static Frequency Assignment Problem. In: Angelov, P., Gegov, A., Jayne, C., Shen, Q. (eds) Advances in Computational Intelligence Systems. Advances in Intelligent Systems and Computing, vol 513. Springer, Cham. https://doi.org/10.1007/978-3-319-46562-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-46562-3_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46561-6
Online ISBN: 978-3-319-46562-3
eBook Packages: EngineeringEngineering (R0)