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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109–133 (1995)
Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP. Technical Report TD-5WYSEW, AT&T Labs Research (2004)
Gourdin, E., Labbé, M., Yaman, H.: Telecommunication and location. In: Drezner, Z., Hamacher, H. (eds.) Facility Location: applications and theory, pp. 275–305. Springer, Heidelberg (2002)
Hansen, P., Mladenović, N.: Variable neighborhood search. Computers & Operations Research 24(11), 1097–1100 (1997)
Hansen, P., Mladenović, N.: Variable neighbourhood search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 145–184. Kluwer, Dordrecht (2003)
Labbé, M., Laporte, G., Martín, I.R., González, J.J.S.: The ring star problem: Polyhedral analysis and exact algorithm. Networks 43(3), 177–189 (2004)
Labbé, M., Laporte, G., Martín, I.R., González, J.J.S.: Locating median cycles in networks. European Journal of Operational Research 160(2), 457–470 (2005)
Martins, S.L., Ribeiro, C.C.: Metaheuristics and applications to optimization problems in telecommunications. In: Resende, M.G.C., Pardalos, P.M. (eds.) Handbook of Optimization in Telecommunications, pp. 103–128. Springer, Heidelberg (2006)
Pérez, J.M., Moreno Vega, M., Martín, I.R.: Variable neighbourhood tabu search and its application to the median cycle problem. European Journal of Operational Research 151, 365–378 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dias, T.C.S., de Sousa Filho, G.F., Macambira, E.M., dos Anjos F. Cabral, L., Fampa, M.H.C. (2006). An Efficient Heuristic for the Ring Star Problem. In: Àlvarez, C., Serna, M. (eds) Experimental Algorithms. WEA 2006. Lecture Notes in Computer Science, vol 4007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11764298_3
Download citation
DOI: https://doi.org/10.1007/11764298_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34597-8
Online ISBN: 978-3-540-34598-5
eBook Packages: Computer ScienceComputer Science (R0)