Abstract
In telecommunications, a traditional method to connect multiterminal systems is to use rings. The goal of the Capacitated m Ring Star Problem (CmRSP) is to connect terminals by m rings which meet at a distinguished node, and possibly by some pendant links, at minimum cost. In this paper, we introduce a relaxation for the CmRSP, called Capacitated m Two-Node Survivable Star Problem (CmTNSSP for short). The CmTNSSP belongs to the \(\mathcal {NP}\)-Hard class of computational problems. Therefore, we address a GRASP hybrid metaheuristic which alternates local searches that obtain incrementally better solutions, and exact resolution local searches based on Integer Linear Programming models. In consonance with predictions provided by Clyde Monma, the network can be equally robust but cheaper than in the original CmRSP.
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
References
Baldacci, R., Dell’Amico, M., González, J.J.S.: The capacitated m-ring-star problem. Oper. Res. 55(6), 1147–1162 (2007)
Mantani, G.B.: Diseño Topológico de Redes. Caso de Estudio: Capacitated m Two-Node Survivable Star Problem. Master’s thesis, Universidad de la República. Pedeciba Informática, Montevideo, Uruguay (2014)
Bhandari, R.: Optimal physical diversity algorithms and survivable networks. In: 1997 Second IEEE Symposium on Computers and Communications, pp. 433–441 (1997)
Canale, E., Monzón, P., Robledo, F.: Global synchronization properties for different classes of underlying interconnection graphs for Kuramoto coupled oscillators. In: Lee, Y., Kim, T., Fang, W., Ślęzak, D. (eds.) FGIT 2009. LNCS, vol. 5899, pp. 104–111. Springer, Heidelberg (2009)
Hoshino, E.A., de Souza, C.C.: A branch-and-cut-and-price approach for the capacitated m-ring-star problem. Discrete Appl. Math. 160(18), 2728–2741 (2012)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)
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)
Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)
Monma, C., Munson, B.S., Pulleyblank, W.R.: Minimum-weight two-connected spanning networks. Math. Program. 46(1–3), 153–171 (1990)
Resende, M., Ribeiro, C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Methaheuristics. Kluwer Academic Publishers, Norwell (2003)
Resende, M., Ribeiro, C.: GRASP: Greedy randomized adaptive search procedures. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, pp. 287–312. Springer, US (2014)
Robledo, F.: GRASP heuristics for Wide Area Network design. Ph.D. thesis, INRIA/IRISA, Université de Rennes I, Rennes, France (2005)
Zizhen Zhang, H., Qin, A.L.: A memetic algorithm for the capacitated m-ring-star problem. Appl. Intell. 40(2), 305–321 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Bayá, G., Mauttone, A., Robledo, F., Romero, P. (2016). The Capacitated m Two-Node Survivable Star Problem: A Hybrid Metaheuristic Approach. In: Blesa, M., et al. Hybrid Metaheuristics. HM 2016. Lecture Notes in Computer Science(), vol 9668. Springer, Cham. https://doi.org/10.1007/978-3-319-39636-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-39636-1_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-39635-4
Online ISBN: 978-3-319-39636-1
eBook Packages: Computer ScienceComputer Science (R0)