Abstract
In this paper, we proposed an algorithm based on variable neighborhood search (VNS) for the capacitated m-Ring-Star problem. This problem has several real applications in communications networks, rapid transit system planning and optical fiber networks. The problem consists in design m rings or cycles that begins of a central depot and visits a set of customers and transition or steiner nodes. While the nodes don’t belong to a ring these must be allocated or assign to a customer or steiner node that belongs to a ring. The number of customers allocated or visited in each ring must not exceed the maximum capacity. The goal is to minimize the visiting and allocation cost. For solving the problem, we propose a VNS approach based on random perturbation for escaping from the local optimal solutions. Our method reached the optimal solution in a reasonable amount of time in a set of instances from the literature.
Keywords
- m-Ring-Star problem
- Variable neighborhood search
- Network design
- Combinatorial optimization
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Baldacci, R., Dell’Amicoy, M., González, J.S.: The capacitated m-Ring-Star problem. Oper. Res. 55, 1147–1162 (2007)
Calvetea, H.I., Galéy, C., Iranzo, J.A.: MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem. Eur. J. Oper. Res. 250, 377–388 (2016)
Calvetea, H.I., Galéy, C., Iranzo, J.A.: An efficient evolutionary algorithm for the ring star problem. Eur. J. Oper. Res. 231, 22–33 (2013)
Liefooghe, A., Jourdany, L., Talbi, E.G.: Metaheuristics and cooperative approaches for the bi-objective ring star problem. Comput. Oper. Res. 37, 1033–1044 (2010)
Labbé, M., Laporte, G., Martíny, I., González, J.S.: The ring star problem polyhedral analysis and exact algorithm. Networks 43, 177–189 (2004)
Lee, Y., Chiu, S.Y., Sanchez, J.: A branch and cut algorithm for the steiner ring star problem. Int. J. Manag. Sci. 4, 21–34 (1998)
Naji-Azimi, Z., Salariy, M., Toth, P.: An integer linear programming based heuristic for the capacitated m-Ring-Star problem. Eur. J. Oper. Res. 217, 17–25 (2012)
Azimi, Z.N., Salariy, M., Toth, P.: A heuristic procedure for the capacitated m-Ring-Star problem. Eur. J. Oper. Res. 207, 1227–1234 (2010)
Hoshinoay, E.A., de Souza, C.C.: A branch-and-cut-and-price approach for the capacitated m-Ring-Star problem. Discrete Appl. Math. 160, 2728–2741 (2012)
Hoshinoay, E.A., de Souza, C.C.: A branch-and-cut-and-price approach for the capacitated m-Ring-Star problem. Electron. Notes Discrete Math. 35, 103–108 (2009)
Berinskyy, H., Zabala, P.: An integer linear programming formulation and branch-and-cut algorithm for the capacitated m-Ring-Star problem. Electron. Notes Discrete Math. 37, 273–278 (2011)
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
Franco, C., López-Santana, E., Mendez-Giraldo, G. (2016). A Variable Neighborhood Search Approach for the Capacitated m-Ring-Star Problem. In: Huang, DS., Bevilacqua, V., Premaratne, P. (eds) Intelligent Computing Theories and Application. ICIC 2016. Lecture Notes in Computer Science(), vol 9771. Springer, Cham. https://doi.org/10.1007/978-3-319-42291-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-42291-6_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42290-9
Online ISBN: 978-3-319-42291-6
eBook Packages: Computer ScienceComputer Science (R0)