Asignación de frecuencias en telefonía celular aplicando el problema de coloración robusta
Αποθηκεύτηκε σε:
| Συγγραφείς: | , , , |
|---|---|
| Μορφή: | artículo original |
| Κατάσταση: | Versión publicada |
| Ημερομηνία έκδοσης: | 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%. |
| Χώρα: | Portal de Revistas UCR |
| Ίδρυμα: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Γλώσσα: | Español |
| OAI Identifier: | oai:archivo.portal.ucr.ac.cr:article/303 |
| Διαθέσιμο Online: | https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/303 |
| Λέξη-Κλειδί : | Graph coloring Robust coloring problem Heuristics GRASP Coloración de gráficas Coloración Robusta Heurísticas |