Three Local Search Meta-Heuristics for the Minimum Interference Frequency Assignment Problem (MI-FAP) in Cellular Networks

Yasmine Lahsinat, Dalila Boughaci and Belaid Benhamou
Additional contact information
Yasmine Lahsinat: LRIA-FEI- Computer Science Department, USTHB, BP 32 El-Alia Bab-Ezzouar, 16111, Algiers, Algeria
Dalila Boughaci: LRIA-FEI- Computer Science Department, USTHB, BP 32 El-Alia Bab-Ezzouar, 16111, Algiers, Algeria
Belaid Benhamou: AIX-Marseille University (AMU), LIS, Domaine Universitaire de Saint Jérôme Avenue Escadrille Normandie Niemen 13397 Marseille Cedex 20, Marseille, France

International Journal of Applied Metaheuristic Computing (IJAMC), 2019, vol. 10, issue 3, 134-150

Abstract: The minimum interference frequency assignment problem (MI-FAP) plays an important role in cellular networks. MI-FAP is the problem of finding an assignment of a small number of frequencies to a large number of transceivers (TRXs) that minimizes the interferences level. The MI-FAP is known to be NP-Hard, thus it cannot be solved in polynomial time. To remedy this, researchers usually use meta-heuristic techniques to find an approximate solution in reasonable time. Here, the authors propose three meta-heuristics for the MI-FAP: a variable neighborhood search (VNS) and a stochastic local search (SLS) that are combined to obtain a third and a new one, which is called VNS-SLS. The SLS method is incorporated into the VNS process as a subroutine in order to enhance the solution quality. All three proposed methods are evaluated on some well-known datasets to measure their performance. The empirical experiments show that the proposed method VNS-SLS succeeds in finding good results compared to both VNS and SLS confirming a good balance between intensification and diversification.

Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/IJAMC.2019070107 (application/pdf)

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:igg:jamc00:v:10:y:2019:i:3:p:134-150

Access Statistics for this article

International Journal of Applied Metaheuristic Computing (IJAMC) is currently edited by Peng-Yeng Yin

More articles in International Journal of Applied Metaheuristic Computing (IJAMC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().