A genetic algorithm for the minimum broadcast time problem using a global precedence vector

The problem of broadcasting a message through a network is considered. The objective is to minimize the number of time steps necessary to complete the broadcast. This problem is known as the Minimum Broadcast Time Problem or the Local Broadcasting Problem. Finding an optimal broadcast using a local broadcasting scheme is known to be NP-Complete. A genetic algorithm (GA) is used as a heuristic technique to find near optimal solutions to this problem. The GA is compared to a variant of a recent heuristic technique presented in the literature.

• Type: Conference
• Year: 1996
• Where: SAC
• Authors: Cory J. Hoelting, Dale A. Schoenefeld, Roger L. Wainwright
• Keywords: Applied Computing, Broadcast Time Problem, Local Broadcasting, Local Broadcasting Problem, SAC 1996