Abstract
This study proposes a tabu search hybridized with multiple neighborhood structures to solve a variant of the frequency assignment problem known as the minimum order frequency assignment problem. This problem involves assigning frequencies to a set of requests while minimizing the number of frequencies used. Several novel and existing techniques are used to improve the efficiency of this algorithm. This includes a novel technique that aims to determine a lower bound on the number of frequencies required from each domain for a feasible solution to exist, 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. Our tabu search algorithm 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 to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
These are available at http://fap.zib.de/problems/CALMA/ (last accessed 25 December 2015).
- 2.
http://fap.zib.de/problems/CALMA/ (last accessed 25 December 2015).
- 3.
http://fap.zib.de/problems/CALMA/ (last accessed 25 December 2015).
References
Metzger, B.H.: Spectrum management technique presented at 38th national orsa meeting. Detroit, MI (Fall 1970) (1970)
Garey, M.R., Johnson, D.S.: A Guide to the Theory of NP-Completeness. WH Freemann, New York (1979)
Kapsalis, A., Chardaire, P., Rayward-Smith, V.J., Smith, G.D.: The radio link frequency assignment problem: a case study using genetic algorithms. In: Fogarty, T.C. (ed.) AISB-WS 1995. LNCS, vol. 993, pp. 117–131. Springer, Heidelberg (1995)
Crisan, C., Mühlenbein, H.: The frequency assignment problem: a look at the performance of evolutionary search. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) AE 1997. LNCS, vol. 1363, pp. 263–273. Springer, Heidelberg (1998)
Parsapoor, M., Bilstrup, U.: Ant colony optimization for channel assignment problem in a clustered mobile ad hoc network. In: Tan, Y., Shi, Y., Mo, H. (eds.) ICSI 2013, Part I. LNCS, vol. 7928, pp. 314–322. Springer, Heidelberg (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., Boyce, J.F., Dimitropoulos, C.H.D., Vom Scheidt, G., Taylor, J.G.: Tabu search for the radio links frequency assignment problem. Applied Decision Technologies (ADT-95) (London) (1995)
Hao, J.-K., Dorne, R., Galinier, P.: Tabu search for frequency assignment in mobile radio networks. J. Heuristics 4(1), 47–62 (1998)
Bouju, A., Boyce, J.F., Dimitropoulos, C.H.D., Vom Scheidt, G., Taylor, J.G., Likas, A., Papageorgiou, G., Stafylopatis, A.: Intelligent search for the radio link frequency assignment problem. In: Proceedings of the International Conference on Digital Signal Processing, Cyprus (1995)
Glover, F., Laguna, M.: Tabu search applications. In: Glover, F., Laguna, M. (eds.) Tabu Search, pp. 267–303. Springer, Heidelberg (1997)
Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)
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. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 801–810. Springer, Heidelberg (1996)
Hao, J.-K., Perrier, L.: Tabu search for the frequency assignment problem in cellular radio networks. Technical report LGI2P, EMA-EERIE, Parc Scientifique Georges Besse, Nimes, France (1999)
Dowsland, K.A., Thompson, J.M.: An improved ant colony optimisation heuristic for graph colouring. Discrete Appl. Math. 156(3), 313–324 (2008)
Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Computing 39(4), 345–351 (1987)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Alrajhi, K., Thompson, J., Padungwech, W. (2016). Tabu Search Hybridized with Multiple Neighborhood Structures for the Frequency Assignment Problem. In: Blesa, M., et al. Hybrid Metaheuristics. HM 2016. Lecture Notes in Computer Science(), vol 9668. Springer, Cham. https://doi.org/10.1007/978-3-319-39636-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-39636-1_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-39635-4
Online ISBN: 978-3-319-39636-1
eBook Packages: Computer ScienceComputer Science (R0)