IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v42y2010i4p273-287.html
   My bibliography  Save this article

Design of reliable communication networks: A hybrid ant colony optimization algorithm

Author

Listed:
  • Berna Dengiz
  • Fulya Altiparmak
  • Onder Belgin

Abstract

This article proposes a hybrid approach based on Ant Colony Optimization (ACO) and Simulated Annealing (SA), called ACO_SA, for the design of communication networks. The design problem is to find the optimal network topology for which the total cost is a minimum and the all-terminal reliability is not less than a given level of reliability. The proposed ACO_SA has the advantages of the ability to find higher performance solutions, created by the ACO, and the ability to jump out of local minima to find better solutions, created by the SA. The effectiveness of ACO_SA is investigated by comparing its results with those obtained by individual application of SA and ACO, which are basic forms of ACO_SA, two different genetic algorithms and a probabilistic solution discovery algorithm given in the literature for the design problem. Computational results show that ACO_SA has a better performance than its basic forms and the investigated heuristic approaches.

Suggested Citation

  • 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.
  • Handle: RePEc:taf:uiiexx:v:42:y:2010:i:4:p:273-287
    DOI: 10.1080/07408170903039836
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/07408170903039836
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/07408170903039836?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.

    Citations

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


    Cited by:

    1. 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.
    2. Coit, David W. & Zio, Enrico, 2019. "The evolution of system reliability optimization," Reliability Engineering and System Safety, Elsevier, vol. 192(C).

    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:taf:uiiexx:v:42:y:2010:i:4:p:273-287. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.