Advanced Search
MyIDEAS: Login to save this article or follow this journal

Hierarchical approach for survivable network design

Contents:

Author Info

  • Balakrishnan, Anantaram
  • Banciu, Mihai
  • Glowacka, Karolina
  • Mirchandani, Prakash
Registered author(s):

    Abstract

    A central design challenge facing network planners is how to select a cost-effective network configuration that can provide uninterrupted service despite edge failures. In this paper, we study the Survivable Network Design (SND) problem, a core model underlying the design of such resilient networks that incorporates complex cost and connectivity trade-offs. Given an undirected graph with specified edge costs and (integer) connectivity requirements between pairs of nodes, the SND problem seeks the minimum cost set of edges that interconnects each node pair with at least as many edge-disjoint paths as the connectivity requirement of the nodes. We develop a hierarchical approach for solving the problem that integrates ideas from decomposition, tabu search, randomization, and optimization. The approach decomposes the SND problem into two subproblems, Backbone design and Access design, and uses an iterative multi-stage method for solving the SND problem in a hierarchical fashion. Since both subproblems are NP-hard, we develop effective optimization-based tabu search strategies that balance intensification and diversification to identify near-optimal solutions. To initiate this method, we develop two heuristic procedures that can yield good starting points. We test the combined approach on large-scale SND instances, and empirically assess the quality of the solutions vis-à-vis optimal values or lower bounds. On average, our hierarchical solution approach generates solutions within 2.7% of optimality even for very large problems (that cannot be solved using exact methods), and our results demonstrate that the performance of the method is robust for a variety of problems with different size and connectivity characteristics.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712007242
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal European Journal of Operational Research.

    Volume (Year): 225 (2013)
    Issue (Month): 2 ()
    Pages: 223-235

    as in new window
    Handle: RePEc:eee:ejores:v:225:y:2013:i:2:p:223-235

    Contact details of provider:
    Web page: http://www.elsevier.com/locate/eor

    Related research

    Keywords: Metaheuristics; Survivable network design; Heuristic analysis; Tabu search;

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Gallo, Mariano & D'Acierno, Luca & Montella, Bruno, 2010. "A meta-heuristic approach for solving the Urban Network Design Problem," European Journal of Operational Research, Elsevier, vol. 201(1), pages 144-157, February.
    2. Jiefeng Xu & Steve Y. Chiu & Fred Glover, 1999. "Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search," Management Science, INFORMS, vol. 45(3), pages 330-345, March.
    3. Costa, Alysson M. & Cordeau, Jean-François & Laporte, Gilbert, 2008. "Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints," European Journal of Operational Research, Elsevier, vol. 190(1), pages 68-78, October.
    4. Naji-Azimi, Zahra & Salari, Majid & Toth, Paolo, 2010. "A heuristic procedure for the Capacitated m-Ring-Star problem," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1227-1234, December.
    5. Tuzun, Dilek & Burke, Laura I., 1999. "A two-phase tabu search approach to the location routing problem," European Journal of Operational Research, Elsevier, vol. 116(1), pages 87-99, July.
    6. Terblanche, S.E. & Wessäly, R. & Hattingh, J.M., 2011. "Survivable network design with demand uncertainty," European Journal of Operational Research, Elsevier, vol. 210(1), pages 10-26, April.
    7. Skorin-Kapov, Darko & Skorin-Kapov, Jadranka, 1994. "On tabu search for the location of interacting hub facilities," European Journal of Operational Research, Elsevier, vol. 73(3), pages 502-509, March.
    8. Fortz, Bernard & Soriano, Patrick & Wynants, Christelle, 2003. "A tabu search algorithm for self-healing ring network design," European Journal of Operational Research, Elsevier, vol. 151(2), pages 280-295, December.
    9. Cordeau, Jean-François & Laporte, Gilbert & Pasin, Federico, 2008. "An iterated local search heuristic for the logistics network design problem with single assignment," International Journal of Production Economics, Elsevier, vol. 113(2), pages 626-640, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:225:y:2013:i:2:p:223-235. 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: (Zhang, Lei).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 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.