El problema de asignación de frecuencias generalizado con pesos y su solución
DOI:
https://doi.org/10.33017/RevECIPeru2016.0012/Keywords:
frequency assignment, channel assignment, T-coloring problem, metaheuristicsAbstract
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.
Downloads
Published
2018-12-27
Issue
Section
ARTÍCULOS ORIGINALES