Abstract
Consider a rooted directed graph G with a subset of vertices called terminals, where each arc has a positive integer capacity and a non-negative cost. For a given positive integer k, we say that G is k-survivable if every of its subgraphs obtained by removing at most k arcs admits a feasible flow that routes one unit of flow from the root to every terminal. We aim at determining a k-survivable subgraph of G of minimum total cost. We focus on the case where the input graph G is planar and propose a tabu search algorithm whose main procedure takes advantage of planar graph duality properties. In particular, we prove that it is possible to test the k-survivability of a planar graph by solving a series of shortest path problems. Experiments indicate that the proposed tabu search algorithm produces optimal solutions in a very short computing time, when these are known.
Similar content being viewed by others
References
Bellman, R.: On a routing problem. Q. Appl. Math. 16, 87–90 (1958)
Bentz, C., Costa, M.C., Hertz, A.: On the edge capacitated Steiner tree problem. CoRR (2016). arXiv:1607.07082
Bentz, C., Costa, M.C., Poirion, P., Ridremont, T.: Formulations for designing robust networks. An application to wind power collection. In: Proceedings of the 8th International Network Optimization Conference (INOC), February 2017, Lisbonne, Portugal, Electronic Notes in Discrete Mathematics Special Issue
Bienstock, D., Muratore, G.: Strong inequalities for capacitated survivable network design problems. Math. Program. 89–1, 127–147 (2000)
Botton, Q., Fortz, B., Gouveia, L., Poss, M.: Benders decomposition for the hop-constrained survivable network design problem. INFORMS J. Comput. 25–1, 13–26 (2013)
Botton, Q., Fortz, B., Gouveia, L.: On the hop-constrained survivable network design problem with reliable edges. Comput. Oper. Res. 64, 159–167 (2015)
Dahl, G., Stoer, M.: A cutting plane algorithm for multicommodity survivable network design problems. INFORMS J. Comput. 10–1, 1–11 (1998)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Norwell (1997)
Goemans, M., Bertsimas, D.: Survivable networks, linear programming relaxations and the parsimonious property. Math. Program. 60–1–3, 145–166 (1993)
Grotschel, M., Monma, C.L., Stoer, M.: Design of survivable networks. Handb. Oper. Res. Manag. Sci. 7, 617–672 (1995)
Hertz, A., Marcotte, O., Mdimagh, A., Carreau, M., Welt, F.: Optimizing the design of a wind farm collection network. INFOR Inf. Syst. Oper. Res. 50–2, 95–104 (2012)
Kerivin, H., Nace, D., Geffard, J.: Design of survivable networks with a single facility, Universal Multiservice Networks. In: 2nd European Conference on 2002, ECUMN 2002. IEEE, pp. 208–218 (2002)
Kerivin, H., Mahjoub, A.R.: Design of survivable networks: a survey. Networks 46–1, 1–21 (2005)
Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York (1976)
LocalSolver. https://www.localsolver.com/
Phillips, C.: The network inhibition problem. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, vol. 1, pp. 776–785 (1993)
Rajan, D., Atamtürk, A.: A directed cycle-based column-and-cut generation method for capacitated survivable network design. Networks 43–4, 201–211 (2004)
Stoer, M., Dahl, G.: A polyhedral approach to multicommodity survivable network design. Numer. Math. 68–1, 149–167 (1994)
Wood, K.: Deterministic network interdiction. Math. Comput. Model. 17–2, 1–18 (1993)
Zenklusen, R.: Network flow interdiction on planar graphs. Discrete Appl. Math. 158–13, 1441–1455 (2010)
Acknowledgements
This work was done with the support of the Gaspard Monge Program for Optimization and operations research (PGMO) http://www.fondation-hadamard.fr/fr/pgmo.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Hertz, A., Ridremont, T. A tabu search for the design of capacitated rooted survivable planar networks. J Heuristics 26, 829–850 (2020). https://doi.org/10.1007/s10732-020-09453-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-020-09453-x