Solving the regenerator location problem with an iterated greedy approach

Abstract

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.

Publication
Applied Soft Computing
Raúl Martín Santamaría
Raúl Martín Santamaría
Artificial Intelligence Phd Student

My research interests include…

Jesús Sánchez-Oro
Jesús Sánchez-Oro
Associate Professor

Associate Professor at the Computer Science Department, being one of the senior researchers of the Group for Research on Algorithms For Optimization GRAFO.

Abraham Duarte
Abraham Duarte
Full Professor

Abraham Duarte is Full Professor in the Computer Science Department at the Rey Juan Carlos University (Madrid, Spain). He has done extensive research in the interface between computer science, artificial intelligence, and operations research to develop solution methods based on Computational Intelligence (metaheuristics) for practical problems in operations-management areas such as logistics and supply chains, telecommunications, decision-making under uncertainty and optimization of simulated systems.