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

The problem of broadcasting a message through a net work is considered The objective is to minimize the number of time steps necessary to complete the broad cast This problem is known as the Minimum Broad cast Time Problem or the Local Broadcasting Problem Finding an optimal broadcast using a local broadcasting scheme is known to be NP Complete A genetic algo rithm GA is used as a heuristic technique to nd near optimal solutions to this problem The GA is compared to a variant of a recent heuristic technique presented in the literature