Solving the regenerator location problem with an iterated greedy approach
The evolution of digital communications has resulted in new services that require from secure and robust connections. Nowadays, a signal must be transmitted to distant nodes, and the quality of the signal deteriorates as the distance between the endpoints increases. Regenerators are special componen...
| Autores: | , , , |
|---|---|
| Tipo de documento: | artigo |
| Data de publicação: | 2021 |
| País: | España |
| Recursos: | Universidad Rey Juan Carlos |
| Repositório: | BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos |
| OAI Identifier: | oai:burjcdigital.urjc.es:10115/18633 |
| Acesso em linha: | http://hdl.handle.net/10115/18633 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Regenerator location problem GRASP Iterated greedy Metaheuristic |
| Resumo: | The evolution of digital communications has resulted in new services that require from secure and robust connections. Nowadays, a signal must be transmitted to distant nodes, and the quality of the signal deteriorates as the distance between the endpoints increases. Regenerators are special components that are able to restore the signal, in order to increase the distance that the signal can travel without losing quality. These special components are very expensive to deploy and maintain and, for this reason, it is desirable to deploy the minimum number of regenerators in a network. We propose a metaheuristic algorithm based on the Iterated Greedy methodology to tackle the Regenerator Location Problem, whose objective is to minimize the number of regenerators required in a network. The extensive computational experiments show the performance of the proposed method compared with the best previous algorithm found in the state of the art. |
|---|