IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v31y2016i4d10.1007_s10878-015-9834-5.html
   My bibliography  Save this article

Heuristics for the network design problem with connectivity requirements

Author

Listed:
  • Roman E. Shangin

    (South Ural State University)

  • Panos Pardalos

    (University of Florida)

Abstract

We consider the NP-complete problem of finding a spanning $$k$$ k -tree of minimum weight in a complete weighted graph. This problem has a number of applications in designing reliable backbone telecommunication networks. We propose effective algorithms based on a greedy strategy and several variable neighborhood search metaheuristics. We also develop an integer linear programming model for calculating a lower bound. Preliminary numerical experiments using random and real-word data sets are reported to show the effectiveness of our approach. In addition, we compare our approach with known metaheuristics.

Suggested Citation

  • Roman E. Shangin & Panos Pardalos, 2016. "Heuristics for the network design problem with connectivity requirements," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1461-1478, May.
    • Handle: RePEc:spr:jcomop:v:31:y:2016:i:4:d:10.1007_s10878-015-9834-5
    DOI: 10.1007/s10878-015-9834-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9834-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-015-9834-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Abdullah Konak & Alice E. Smith, 2011. "Efficient Optimization of Reliable Two-Node Connected Networks: A Biobjective Approach," INFORMS Journal on Computing, INFORMS, vol. 23(3), pages 430-445, August.
    2. Álvarez-Miranda, Eduardo & Ljubić, Ivana & Toth, Paolo, 2013. "Exact approaches for solving robust prize-collecting Steiner tree problems," European Journal of Operational Research, Elsevier, vol. 229(3), pages 599-612.
    3. Berna Dengiz & Fulya Altiparmak & Onder Belgin, 2010. "Design of reliable communication networks: A hybrid ant colony optimization algorithm," IISE Transactions, Taylor & Francis Journals, vol. 42(4), pages 273-287.
    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. Kai Yang & Cong Tian & Nan Zhang & Zhenhua Duan & Hongwei Du, 2019. "A temporal logic programming approach to planning," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 402-420, August.

    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. Coit, David W. & Zio, Enrico, 2019. "The evolution of system reliability optimization," Reliability Engineering and System Safety, Elsevier, vol. 192(C).
    2. Alcaraz, Javier & Landete, Mercedes & Monge, Juan F. & Sainz-Pardo, José L., 2020. "Multi-objective evolutionary algorithms for a reliability location problem," European Journal of Operational Research, Elsevier, vol. 283(1), pages 83-93.
    3. Alibeyg, Armaghan & Contreras, Ivan & Fernández, Elena, 2016. "Hub network design problems with profits," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 40-59.
    4. Markus Leitner & Ivana Ljubić & Markus Sinnl, 2015. "A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 118-134, February.

    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:spr:jcomop:v:31:y:2016:i:4:d:10.1007_s10878-015-9834-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.