Asignación de frecuencias en telefonía celular aplicando el problema de coloración robusta
Guardado en:
| Autores: | , , , |
|---|---|
| 格式: | artículo original |
| 狀態: | Versión publicada |
| Fecha de Publicación: | 2009 |
| 實物特徵: | The Robust Coloring Problem (RCP) is a NP-Hard Problem for which fast and efficient heuristic algorithms has been developed. In this work we present as a PCR the problem of assignment of frequencies for a cellphone grid. Some instances for this model are proposed and solved using a GRASP algorithm. Evidence shows that the intermittent interruptions in service can be eliminated and the overall capacity can be increased in approximately 25%. |
| País: | Portal de Revistas UCR |
| 機構: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| 語言: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/303 |
| 在線閱讀: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/303 |
| Palabra clave: | Graph coloring Robust coloring problem Heuristics GRASP Coloración de gráficas Coloración Robusta Heurísticas |