scholarly journals Multi-Neighborhood Simulated Annealing for the Minimum Interference Frequency Assignment Problem

2021 ◽  
pp. 100024
Author(s):  
Sara Ceschia ◽  
Luca Di Gaspero ◽  
Roberto Maria Rosati ◽  
Andrea Schaerf
Keyword(s):  
Simulated Annealing ◽  
Assignment Problem ◽  
Frequency Assignment ◽  
Frequency Assignment Problem ◽  
Interference Frequency ◽  
Minimum Interference

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

2019 ◽  
Vol 10 (3) ◽  
pp. 134-150
Author(s):  
Yasmine Lahsinat ◽  
Dalila Boughaci ◽  
Belaid Benhamou
Keyword(s):  
Local Search ◽  
Cellular Networks ◽  
Assignment Problem ◽  
Frequency Assignment ◽  
Neighborhood Search ◽  
Stochastic Local Search ◽  
Frequency Assignment Problem ◽  
Solution Quality ◽  
Interference Frequency ◽  
Minimum Interference

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.

Engineering-Oriented Hybrid Genetic Algorithm for Frequency Assignment Problem

2010 ◽  
Vol 40-41 ◽  
pp. 410-418
Author(s):  
Ting Ting Zhou ◽  
Ying Zheng ◽  
Ming Chen
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Assignment Problem ◽  
Hybrid Genetic Algorithm ◽  
Mobile Telephone ◽  
Frequency Assignment ◽  
Real Word ◽  
Frequency Assignment Problem ◽  
Swarm Optimization

Since the usable range of the frequency spectrum is limited, the frequency assignment problem (FAP) is important in mobile telephone communication. In this paper, according to the characteristics of engineering- oriented FAP, an engineering-oriented hybrid genetic algorithm (EHGA) based on traditional genetic algorithm (TGA) is proposed, combined with particle swarm optimization (PSO) and simulated annealing (SA). The results obtained by the simulation to a real-word FAP case in GSM show that the algorithm we proposed is a better approach to solve the engineering-oriented FAP.

scholarly journals El problema de asignación de frecuencias generalizado con pesos y su solución

2018 ◽  
pp. 80-87
Keyword(s):  
Simulated Annealing ◽  
Channel Assignment ◽  
Assignment Problem ◽  
Experimental Results ◽  
Frequency Assignment ◽  
Frequency Assignment Problem ◽  
Coloring Problem ◽  
E Mail

El problema de asignación de frecuencias generalizado con pesos y su solución The generalized frequency assignment problem and its solution David F. Muñoz Departamento de Ingeniería Industrial y Operaciones, Instituto Tecnológico Autónomo de México, Río Hondo 1, 01080 Ciudad de México, México E-mail: [email protected] Recibido 17 de octubre del 2016; aceptado el 10 de diciembre del 2016 DOI: https://doi.org/10.33017/RevECIPeru2016.0012/  Resumen En este artículo se reporta el desempeño de 15 métodos heurísticos para encontrar soluciones iniciales y 4 meta-heurísticas para resolver un problema de asignación de frecuencias en el que el valor de las frecuencias asignadas depende de pesos correspondientes a los sitios donde se asigna la frecuencia. Los diferentes algoritmos fueron probados en un conjunto de problemas que se generaron utilizando un generador que representa situaciones similares a la asignación de frecuencias FM en México. Los resultados experimentales mostraron que las heurísticas que consideran los pesos de los sitios tienen un mejor desempeño y, de entre las 4 meta-heurísticas probadas, el mejor desempeño lo obtuvo el algoritmo basado en templado simulado. Descriptores: asignación de frecuencias, asignación de canales, problema de T-coloreo, meta-heurísticas Abstract We report performance of 15 heuristics and 4 metaheuristics to solve a frequency assignment problem where the value of an assigned frequency depends on the weights of the corresponding site where the frequency is assigned. Different algorithms where tested on two sets of problems, the first one corresponds to the well-known Philadelphia problems and the second one to situations similar to the assignment of FM frequencies in Mexico. Experimental results showed that the heuristics that take into account the site weights performed the best and, among the four metaheuristics tested, the algorithm based on simulated annealing performed the best. Keywords: frequency assignment, channel assignment, T-coloring problem, metaheuristics

Sign in / Sign up

Export Citation Format

Share Document