A Heuristic approach for the Dynamic Frequency Assignment problem

Alrajhi, Khaled, Thompson, Jonathan and Padungwech, Wasin ORCID: https://orcid.org/0000-0002-4842-5222 2017. A Heuristic approach for the Dynamic Frequency Assignment problem. Chao, F, Schockaert, S and Zhang, Q, eds. Advances in Computational Intelligence Systems, Vol. 650. Advances in Intelligent Systems and Computing, Springer, pp. 91-103. (10.1007/978-3-319-66939-7_8)

Full text not available from this repository.

Abstract

This study considers the dynamic frequency assignment problem, where new requests gradually become known and frequencies need to be as-signed to those requests effectively and promptly with the minimum number of reassignments. The problem can be viewed as a combination of three underly-ing 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.

Item Type:	Book Section
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Publisher:	Springer
ISBN:	9783319669380
ISSN:	2194-5357
Date of Acceptance:	6 September 2017
Last Modified:	03 Nov 2022 09:42
URI:	https://orca.cardiff.ac.uk/id/eprint/105790

Citation Data

Cited 1 time in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item