Advertisement

A Heuristic Approach for the Dynamic Frequency Assignment Problem

  • Khaled Alrajhi
  • Jonathan Thompson
  • Wasin Padungwech
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 650)

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.

References

  1. 1.
    Dupont, A., Vasquez, M.: Solving the dynamic frequency assignment problem. In: Proceedings of the 6th International Conference of Meta-heuristics (2005)Google Scholar
  2. 2.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Kouvelis, P., Yu, G.: Robust Discrete Optimization and its Applications. Kluwer Academic Publishers, Boston (1997)CrossRefzbMATHGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Hale, W.: Frequency assignment: theory and applications. Proc. IEEE 68, 1497–1514 (1980)CrossRefGoogle Scholar
  6. 6.
    Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman W.H. and Company, San Francisco (1979)zbMATHGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Khaled Alrajhi
    • 1
  • Jonathan Thompson
    • 2
  • Wasin Padungwech
    • 2
  1. 1.King Khalid Military AcademyRiyadhSaudi Arabia
  2. 2.School of MathematicsCardiff UniversityCardiffWales, UK

Personalised recommendations