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," CORE Discussion Papers 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: http://uclouvain.be/cps/ucl/doc/core/documents/coredp2011_37web.pdf
    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. Gernot Grabher & Walter W. Powell (ed.), 2004. "Networks," Books, Edward Elgar Publishing, volume 0, number 2771.
    3. Belleflamme,Paul & Peitz,Martin, 2010. "Industrial Organization," Cambridge Books, Cambridge University Press, number 9780521681599, November.
    4. 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.
    5. 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.
    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. 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.
    2. 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.

    More about this item

    Keywords

    network design; survivability; hop-constraints; benders decomposition; branch-and-cut algorithms;

    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.

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

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.