A genetic algorithm for multicasting routing problem

Abstract

A developed genetic algorithm (GA) for the multicasting routing problem is presented. The algorithm is based on bit string encoding of selected Steiner vertices and the corresponding Steiner tree is computed using a deterministic heuristic. The scheme ensures that every bit string corresponds to a valid solution and eliminates the need for penalty terms in the cost measure, thereby avoiding potential problems of assigning a suitable cost value to an invalid solution. It is possible that the initial tree may be dynamically reorganized in response to changes in the multicast group set in a way that is minimally disruptive to the multicast session.