Asignación de frecuencias en telefonía celular aplicando el problema de coloracion robusta

    The Robust Coloring Problem (RCP) is a NP-Hard Problem for which fast andefficient heuristic algorithms has been developed. In this work we present as a PCRthe problem of assignment of frequencies for a cellphone grid. Some instances for thismodel are proposed and solved using a GRASP algorithm....

Descripción completa

Autores Principales: Lara Velázquez, Pedro, Gallardo López, Lizbeth, Gutiérrez Andrade, Miguel Ángel, de los Cobos Silva, Sergio Gerardo
Formato: Artículo
Idioma: Español
Publicado: 2015
Acceso en línea: http://revistas.ucr.ac.cr/index.php/matematica/article/view/303
http://hdl.handle.net/10669/12960
Sumario:     The Robust Coloring Problem (RCP) is a NP-Hard Problem for which fast andefficient heuristic algorithms has been developed. In this work we present as a PCRthe problem of assignment of frequencies for a cellphone grid. Some instances for thismodel are proposed and solved using a GRASP algorithm. Evidence shows that theintermittent interruptions in service can be eliminated and the overall capacity can beincreased in approximately 25%.Keywords: Graph coloring, Robust coloring problem, Heuristics, GRASP.