Abstract
This study considers the dynamic frequency assignment problem, where new requests gradually become known and frequencies need to be assigned to those requests effectively and promptly with the minimum number of reassignments. The problem can be viewed as a combination of three underlying problems: the initial problem, the online problem, and the repair problem. In this study, a heuristic approach is proposed to solve this problem using different solution methods for each underlying problem. Moreover, the efficiency of this approach is improved by means of the Gap technique, which aims to identify a good frequency to be assigned to a given request. For the purpose of this study, new dynamic datasets are generated from static benchmark datasets. It was found that the performance of our approach is better than the state-of-the-art approach in the literature across the same set of instances.
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 datasets are available at https://dynamicfap.wordpress.com/.
References
Dupont, A., Vasquez, M.: Solving the dynamic frequency assignment problem. In: Proceedings of the 6th International Conference of Meta-heuristics (2005)
Dupont, A., Linhares, A., Artigues, C., Feillet, D., Michelon, P., Vasquez, M.: The dynamic frequency assignment problem. Eur. J. Oper. Res. 195(1), 75–88 (2008)
Kouvelis, P., Yu, G.: Robust Discrete Optimization and its Applications. Kluwer Academic Publishers, Boston (1997)
Halldorsson, M., Szegedy, M.: Lower bounds for on-line graph coloring: SODA1992. In: Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 211–216 (1992)
Hale, W.: Frequency assignment: theory and applications. Proc. IEEE 68, 1497–1514 (1980)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman W.H. and Company, San Francisco (1979)
Alrajhi, K., Thompson, J., Padungwech, W.: Tabu search hybridized with multiple neighbourhood structures for the static frequency assignment problem. In: Proceedings of the 10th International Workshop on Hybrid Meta-heuristics, HM 2016. Lecture Notes in Computer Science, vol. 9668, pp. 157–170. Springer (2016)
Alrajhi, K., Padungwech, W.: A dynamic tabu search approach for solving the static frequency assignment problem. In: Advances in Computational Intelligence Systems, pp. 59–70. Springer (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Alrajhi, K., Thompson, J., Padungwech, W. (2018). A Heuristic Approach for the Dynamic Frequency Assignment Problem. In: Chao, F., Schockaert, S., Zhang, Q. (eds) Advances in Computational Intelligence Systems. UKCI 2017. Advances in Intelligent Systems and Computing, vol 650. Springer, Cham. https://doi.org/10.1007/978-3-319-66939-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-66939-7_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-66938-0
Online ISBN: 978-3-319-66939-7
eBook Packages: EngineeringEngineering (R0)