IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v349y2025i3d10.1007_s10479-025-06609-5.html
   My bibliography  Save this article

Biased random-key genetic algorithms for the weighted minimum broadcast time problem

Author

Listed:
  • Alfredo Lima

    (Universidade Federal Fluminense
    Universidade Federal de Alagoas)

  • Luiz Satoru Ochi

    (Universidade Federal Fluminense)

  • Bruno Nogueira

    (Universidade Federal de Alagoas
    Universidade de Pernambuco)

  • Rian G. S. Pinheiro

    (Universidade Federal de Alagoas)

Abstract

Broadcasting is an essential operation in distributed systems, with a wide range of applications. This study is focused on solving the Weighted Minimum Broadcast Time (WMBT), a problem that extends the classical Minimum Broadcast Time problem (MBT) by incorporating costs associated with each communication operation. We propose five contributions to the WMBT: (i) an integer linear programming model, (ii) two greedy algorithms, (iii) two Biased Random-Key Genetic Algorithms (BRKGAs), (iv) a lower bound algorithm, (v) a reduction rule to decrease an instance size, and (vi) a method to create instances with known optimal solutions. Our novel approaches are compared with state-of-the-art methods using large-scale synthetic instances. The experimental results demonstrate the effectiveness of our proposals. The greedy algorithms attains the best known solutions in a significant number of instances, while the two BRKGAs further enhance this performance, surpassing the greedy algorithms in many of the tested instances.

Suggested Citation

  • Alfredo Lima & Luiz Satoru Ochi & Bruno Nogueira & Rian G. S. Pinheiro, 2025. "Biased random-key genetic algorithms for the weighted minimum broadcast time problem," Annals of Operations Research, Springer, vol. 349(3), pages 1749-1783, June.
    • Handle: RePEc:spr:annopr:v:349:y:2025:i:3:d:10.1007_s10479-025-06609-5
    DOI: 10.1007/s10479-025-06609-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-025-06609-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/s10479-025-06609-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.

    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:annopr:v:349:y:2025:i:3:d:10.1007_s10479-025-06609-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.

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