The F/DR-D-10 Algorithm: A Novel Heuristic Strategy to Solve the Minimum Span Frequency Assignment Problem Embedded in Mobile Applications

Carlos-Iván Páez-Rueda (), Arturo Fajardo (), Manuel Pérez, German Yamhure and Gabriel Perilla
Additional contact information
Carlos-Iván Páez-Rueda: Department of Electronic Engineering, Pontificia Universidad Javeriana, Carrera 7 #40-62, Bogota 110311, Colombia
Arturo Fajardo: Department of Electronic Engineering, Pontificia Universidad Javeriana, Carrera 7 #40-62, Bogota 110311, Colombia
Manuel Pérez: Department of Electronic Engineering, Pontificia Universidad Javeriana, Carrera 7 #40-62, Bogota 110311, Colombia
German Yamhure: Department of Electronic Engineering, Pontificia Universidad Javeriana, Carrera 7 #40-62, Bogota 110311, Colombia
Gabriel Perilla: Department of Electronic Engineering, Pontificia Universidad Javeriana, Carrera 7 #40-62, Bogota 110311, Colombia

Mathematics, 2023, vol. 11, issue 20, 1-14

Abstract: Wireless communication supports various real-world applications, such as aeronautical navigation, satellite and TV broadcasting, wireless LANs, and mobile communications. The inherent characteristics of the electromagnetic spectrum impose constraints on telecommunication channels and their frequency bandwidths within mobile networks. A persistent challenge in these applications is providing high-demand services to mobile users, where frequency assignment problems, also known as channel assignment problems, assume significance. Researchers have developed several modeling approaches to address different facets of this problem, including the management of interfering radio signals, the assessment of available frequencies, and optimization criteria. In this paper, we present improved algorithms for solving the Minimum Span Frequency Assignment Problem in mobile communication systems using the greedy optimization approach known as F/DR. We solved and evaluated twenty well-known benchmark cases to assess the efficacy of our algorithms. Our findings consistently demonstrate that the modified algorithms outperform the F/DR approach with comparable computational complexity. The proposed algorithm notably achieves the following benchmarks: The modified algorithms consistently produce at least one local optimum better than the traditional algorithm in all benchmark tests. In 95% of the benchmarks evaluated, the probability of discovering a local optimum value (calculated by the modified algorithm) that is better than or equal to the one found by the conventional algorithm exceeds 50%.

Keywords: NP-hard problem; channel assignment problem; frequency assignment problem; minimum span frequency assignment problem; heuristic algorithms (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/20/4243/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/20/4243/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:20:p:4243-:d:1257496

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().