Heuristics for the Minimum Broadcast Time

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

“…Firstly, some researchers designed exact approaches. This includes a dynamic programming algorithm suggested in [24] and the ILP models suggested in [25]. Currently, the ILP method suggested in [25] is believed to be the best exact method.…”

“…This includes a dynamic programming algorithm suggested in [24] and the ILP models suggested in [25]. Currently, the ILP method suggested in [25] is believed to be the best exact method. These exponential methods can only effectively solve this problem for networks with up to around 50 nodes in a reasonable amount of time, making them unsuitable for use in real-world networks.…”

“…Finally, there is a long list of heuristics and approximation algorithms for this problem. Several heuristic [25], [32]- [35] and approximation algorithms for arbitrary graphs [36]- [38], or a specific family of graphs [39], [40] have been proposed in the literature. The algorithm with the best approximation ratio is proposed in [41] which guarantees a ( log |V | log log |V | )approximation for this problem.…”

“…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.…”

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