An efficient heuristic for the ring star problem

  • Authors:

  • Thayse Christine S. Dias;Gilberto F. De Sousa Filho;Elder M. Macambira;Lucidio dos Anjos F. Cabral;Marcia Helena C. Fampa

  • Affiliations:

  • Programa de Engenharia de Sistemas e Computação, Universidade Federal do Rio de Janeiro, Rio de Janeiro, RJ, Brasil;Departamento de Informática, Universidade Federal da Paraíba, João Pessoa, PB, Brasil;Departamento de Estatística, Universidade Federal da Paraíba, João Pessoa, PB, Brasil;Departamento de Estatística, Universidade Federal da Paraíba, João Pessoa, PB, Brasil;Programa de Engenharia de Sistemas e Computação, Universidade Federal do Rio de Janeiro, Rio de Janeiro, RJ, Brasil

  • Venue:
  • WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we consider a combinatorial optimization problem that arises in the design of telecommunications network. It is known as the Ring Star Problem. In this problem the aim is to locate a simple cycle through a subset of vertices of a graph with the objective of minimizing the sum of two costs: a routing cost proportional to the length of the cycle, and an assignment cost from the vertices not in the cycle to their closest vertex on the cycle. We propose a new hybrid metaheuristic approach to solve the Ring Star Problem. In the hybrid metaheuristic, we use a General Variable Neighborhood Search (GVNS) to improve the quality of the solution obtained with a Greedy Randomized Adaptive Search Procedure (GRASP). A set of extensive computational experiments on instances from the classical TSP library and randomly generated are reported, comparing the GRASP/GVNS heuristic with other heuristic found in the literature. These results indicate that the proposed hybrid metaheuristic is highly efficient and superior to the other available method proposed for the Ring Star Problem.