IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v66y2015i7p1101-1114.html
   My bibliography  Save this article

A self-tuning heuristic for the design of communication networks

Author

Listed:
  • Berna Dengiz

    (Baskent University, Ankara, Turkey)

  • Cigdem Alabas-Uslu

    (Marmara University, Istanbul, Turkey)

Abstract

This paper addresses the design of communication networks that has a large application area. The problem is to design a minimum cost network subject to a given reliability level. Complexity of the problem is twofold: (1) finding a minimum-cost network topology that every pair of nodes can communicate with each other and (2) computing overall reliability to provide the reliability constraint. Over the last two decades, metaheuristic algorithms have been widely applied to solve this problem due to its NP-hardness. In this study, a self-tuning heuristic (STH), which is a new approach free from parameter tuning, is applied to the design of communication networks. Extensive computational results confirm that STH generates superior solutions to the problem in comparison to some well-known local search metaheuristics, and also more sophisticated metaheuristics proposed in the literature. The practical advantage of STH lies in both its effectiveness and simplicity in application to the design problem.

Suggested Citation

  • Berna Dengiz & Cigdem Alabas-Uslu, 2015. "A self-tuning heuristic for the design of communication networks," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(7), pages 1101-1114, July.
    • Handle: RePEc:pal:jorsoc:v:66:y:2015:i:7:p:1101-1114
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n7/pdf/jors201474a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v66/n7/full/jors201474a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    More about this item

    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:pal:jorsoc:v:66:y:2015:i:7:p:1101-1114. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.palgrave-journals.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.