IDEAS home Printed from https://ideas.repec.org/p/cor/louvco/2011037.html
   My bibliography  Save this paper

Benders decomposition for the hop-constrained survivable network design problem

Author

Listed:
  • BOTTON, Quentin

    (Université catholique de Louvain, CESCM-LSM and CORE, B-1348 Louvain-la-Neuve, Belgium)

  • FORTZ, Bernard

    (GOM, Université Libre de Bruxelles, Belgium)

  • GOUVEIA, Luis

    (Universidade de Lisboa, DEIO, P-1749-016 Lisbon, Portugal)

  • POSS, Michael

    (GOM, Université Libre de Bruxelles, Belgium)

Abstract

Given a graph with nonnegative edge weights and node pairs Q, we study the problem of constructing a minimum weight set of edges so that the induced subgraph contains at least K edge-disjoint paths containing at most L edges between each pair in Q. Using the layered representation introduced by Gouveia (1998), we present a formulation for the problem valid for any K, L ≥ 1. We use a Benders decomposition method to efficiently handle the big number of variables and constraints. We show that our Benders cuts contain the constraints used by Huygens et al. to formulate the problem for L = 2,3,4, as well as new inequalities when L ≥ 5. While some recent works on Benders decomposition study the impact of the normalization constraint in the dual subproblem, we focus here on when to generate the Benders cuts. We present a thorough computational study of various branch-and-cut algorithms on a large set of instances including the real based instances from SNDlib. Our best branch-and-cut algorithm combined with an efficient heuristic is able to solve the instances significantly faster than CPLEX 12 on the extended formulation.

Suggested Citation

  • BOTTON, Quentin & FORTZ, Bernard & GOUVEIA, Luis & POSS, Michael, 2011. "Benders decomposition for the hop-constrained survivable network design problem," LIDAM Discussion Papers CORE 2011037, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvco:2011037
    as

    Download full text from publisher

    File URL: https://sites.uclouvain.be/core/publications/coredp/coredp2011.html
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Fleurbaey,Marc & Maniquet,François, 2011. "A Theory of Fairness and Social Welfare," Cambridge Books, Cambridge University Press, number 9780521715348.
    2. Belleflamme,Paul & Peitz,Martin, 2015. "Industrial Organization," Cambridge Books, Cambridge University Press, number 9781107687899.
    3. Gouveia, Luis, 1996. "Multicommodity flow models for spanning trees with hop constraints," European Journal of Operational Research, Elsevier, vol. 95(1), pages 178-190, November.
    4. Gernot Grabher & Walter W. Powell (ed.), 2004. "Networks," Books, Edward Elgar Publishing, volume 0, number 2771.
    5. Geir Dahl & Mechthild Stoer, 1998. "A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems," INFORMS Journal on Computing, INFORMS, vol. 10(1), pages 1-11, February.
    6. Belleflamme,Paul & Peitz,Martin, 2010. "Industrial Organization," Cambridge Books, Cambridge University Press, number 9780521681599, November.
    7. Duranton, Gilles & Martin, Philippe & Mayer, Thierry & Mayneris, Florian, 2010. "The Economics of Clusters: Lessons from the French Experience," OUP Catalogue, Oxford University Press, number 9780199592203.
    8. Luís Gouveia & Pedro Patrício & Amaro Sousa, 2008. "Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM," Networks and Spatial Economics, Springer, vol. 8(1), pages 3-21, March.
    9. Huriot,Jean-Marie & Thisse,Jacques-François (ed.), 2009. "Economics of Cities," Cambridge Books, Cambridge University Press, number 9780521118279.
    10. Luis Gouveia, 1998. "Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 180-188, May.
    11. Pirkul, Hasan & Soni, Samit, 2003. "New formulations and solution procedures for the hop constrained network design problem," European Journal of Operational Research, Elsevier, vol. 148(1), pages 126-140, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Grigory Pastukhov & Alexander Veremyev & Vladimir Boginski & Eduardo L. Pasiliao, 2014. "Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks," Journal of Combinatorial Optimization, Springer, vol. 27(3), pages 462-486, April.
    2. Souza, Fernanda S.H. & Gendreau, Michel & Mateus, Geraldo R., 2014. "Branch-and-price algorithm for the Resilient Multi-level Hop-constrained Network Design," European Journal of Operational Research, Elsevier, vol. 233(1), pages 84-93.
    3. Alexander Veremyev & Vladimir Boginski & Eduardo Pasiliao, 2015. "Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra," Journal of Global Optimization, Springer, vol. 61(1), pages 109-138, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dimitri Paolini & Pasquale Pistone & Giuseppe Pulina & Martin Zagler, 2016. "Tax treaties with developing countries and the allocation of taxing rights," European Journal of Law and Economics, Springer, vol. 42(3), pages 383-404, December.
    2. Pierre Pestieau & Gregory Ponthiere, 2012. "The Public Economics of Increasing Longevity," Hacienda Pública Española / Review of Public Economics, IEF, vol. 200(1), pages 41-74, March.
    3. Luc Bauwens & Dimitris Korobilis, 2013. "Bayesian methods," Chapters, in: Nigar Hashimzade & Michael A. Thornton (ed.), Handbook of Research Methods and Applications in Empirical Macroeconomics, chapter 16, pages 363-380, Edward Elgar Publishing.
    4. Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Østerdal, Lars Peter, 2012. "A unifying framework for the problem of adjudicating conflicting claims," Journal of Mathematical Economics, Elsevier, vol. 48(2), pages 107-114.
    5. Pierre M. Picard & Tim Worrall, 2010. "Sustainable Migration Policies," DEM Discussion Paper Series 10-12, Department of Economics at the University of Luxembourg.
    6. Bocart, Fabian Y.R.P. & Hafner, Christian M., 2012. "Econometric analysis of volatile art markets," Computational Statistics & Data Analysis, Elsevier, vol. 56(11), pages 3091-3104.
    7. Julio Dávila, 2011. "Optimal population and education," Documents de travail du Centre d'Economie de la Sorbonne 11069, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    8. VAN VYVE, Mathieu, 2011. "Linear prices for non-convex electricity markets: models and algorithms," LIDAM Discussion Papers CORE 2011050, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    9. DEVOLDER, Olivier, 2011. "Stochastic first order methods in smooth convex optimization," LIDAM Discussion Papers CORE 2011070, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    10. CHANDER, Parkash & TULKENS, Henry, 2011. "The kyoto Protocol, the Copenhagen Accord, the Cancun Agreements, and beyond: an economic and game theoretical exploration and interpretation," LIDAM Discussion Papers CORE 2011051, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    11. Rombouts, Jeroen & Stentoft, Lars & Violante, Franceso, 2014. "The value of multivariate model sophistication: An application to pricing Dow Jones Industrial Average options," International Journal of Forecasting, Elsevier, vol. 30(1), pages 78-98.
    12. Quentin Botton & Bernard Fortz & Luis Gouveia & Michael Poss, 2013. "Benders Decomposition for the Hop-Constrained Survivable Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 13-26, February.
    13. GAHUNGU, Joachim & SMEERS, Yves, 2011. "A real options model for electricity capacity expansion," LIDAM Discussion Papers CORE 2011044, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    14. BAUWENS, Luc & DUFAYS, Arnaud & DE BACKER, Bruno, 2011. "Estimating and forecasting structural breaks in financial time series," LIDAM Discussion Papers CORE 2011055, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    15. BAUWENS, Luc & HAFNER, Christian & LAURENT, Sébastien, 2011. "Volatility models," LIDAM Discussion Papers CORE 2011058, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
      • Bauwens, L. & Hafner, C. & Laurent, S., 2012. "Volatility Models," LIDAM Reprints ISBA 2012028, Université catholique de Louvain, Institute of Statistics, Biostatistics and Actuarial Sciences (ISBA).
      • Bauwens, L. & Hafner C. & Laurent, S., 2011. "Volatility Models," LIDAM Discussion Papers ISBA 2011044, Université catholique de Louvain, Institute of Statistics, Biostatistics and Actuarial Sciences (ISBA).
    16. GABSZEWICZ, Jean & TAROLA, Ornella, 2011. "Migration, wage differentials and fiscal competition," LIDAM Discussion Papers CORE 2011065, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    17. CALCIANO, Filippo L., 2011. "Oligopolistic competition with general complementarities," LIDAM Discussion Papers CORE 2011054, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    18. Per J. Agrell & Axel Gautier, 2012. "Rethinking Regulatory Capture," Chapters, in: Joseph E. Harrington Jr & Yannis Katsoulacos (ed.), Recent Advances in the Analysis of Competition Policy and Regulation, chapter 14, Edward Elgar Publishing.
    19. GABSZEWICZ, Jean J. & VAN YPERSELE, Tanguy & ZANAJ, Skerdilajda, 2011. "Does the seller of a house facing a large number of buyers always decrease its price when its first offer is rejected?," LIDAM Discussion Papers CORE 2011049, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    20. Florian MAYNERIS & Sandra PONCET, 2011. "Entry on difficult export markets by Chinese domestic firms: the role of foreign export spillovers," LIDAM Discussion Papers IRES 2011041, Université catholique de Louvain, Institut de Recherches Economiques et Sociales (IRES).

    More about this item

    Keywords

    network design; survivability; hop-constraints; benders decomposition; branch-and-cut algorithms;
    All these keywords.

    JEL classification:

    • M10 - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics - - Business Administration - - - General
    • C57 - Mathematical and Quantitative Methods - - Econometric Modeling - - - Econometrics of Games and Auctions
    • C10 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods and Methodology: General - - - General

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cor:louvco:2011037. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.