A Novel Ant Algorithm for Solving the Minimum Broadcast Time Problem

HUB-GA: A heuristic for universal lists broadcasting using genetic algorithm

“…They compared their results with the approximation matching (AM) algorithm presented in [24], and claimed that their algorithm outperforms AM, particularly considering the contrived networks. Moreover, Hasson and Sipper [4] proposed ACS: an ant colony system for the MBT problem. They compared the performance of their algorithm with that of [94] and AM [24] for random graphs on 15 to 250 nodes and edge probability in the range of (0.05 − 0.1).…”

“…They suggested various versions of their algorithm while combining it with different decoders, such as first receive first send (FRFS) or an integer linear programming (ILP) method. They compared their results with various methods such as Tree Block [25], NTBA [34], NEWH [35], and ACS [4] for several graph families of up to 1024 nodes. Their results show that BRKGA is able to outperform all counterpart heuristics for the MBT problem, while it can also be an alternative for larger networks where the exact methods cannot be applied.…”

“…Their results show that BRKGA is able to outperform all counterpart heuristics for the MBT problem, while it can also be an alternative for larger networks where the exact methods cannot be applied. Finally, we should point out that the goal of [4], [94], [95] is to minimize the classical broadcast time of a particular vertex under the classical model, not to optimize the broadcast time of all network members at the same time.…”

“…On the other hand, studying the algorithms that move data around a network plays a significant role in the scalability of HPC applications [1], [2], and the network's quality of service (QoS). In particular, the time it takes to transmit a message between two communication sites, or the message delay, is one of several factors that affect a network's performance [4]. In this study, we present a method to reduce the message delay in the process Manuscript received August 19, 2022 revised October 17, 2022; approved for publication by Chien-Ming Chen, Division 2 Editor, November 3, 2022.1 S. Gholami and H. A. Harutyunyan are with Computer Science and Software Engineering, Concordia University Ringgold Standard Institution, Guy st, Montreal, Quebec H3G 1M8, Canada, email: sabergholami72@gmail.com and haruty@cs.concordia.ca.…”

Um modelo de programação matemática para o problema Weighted Minimum Broadcast Time

“…Os problemas MBT e WMBT atraíram interesse de vários pesquisadores devido ao seu potencial para modelar muitas aplicac ¸ões do mundo real. Para o MBT, existem prospostas de algoritmos exatos [Scheuermann and Wu 1984, de Sousa et al 2018, Ivanova 2019, algoritmos aproximados [Elkin andKortsarz 2003, Kortsarz andPeleg 1992], heurísticas, metaheurísticas e matheuristic [Scheuermann and Wu 1984, Hoelting et al 1996, de Sousa et al 2018, Hasson and Sipper 2004, Harutyunyan and Wang 2010, Harutyunyan and Jimborean 2014, Lima et al 2022.…”