A genetic algorithm for solving the delay-constrained multicast routing problem

الملخص EN

This study deals with the delay-constrained multicast routing problem.

This problem is known to be NP-complete.

We propose a genetic algorithm approach to solve this problem.

In this approach, we introduced a new representation for the chromosome which contributed in the improvement of the GA results.

Then we compare the proposed approach with one of the known heuristic algorithms to solve the considered problem.

The experimental results showed that the proposed genetic algorithm is more efficient in finding a good solution of the delay constrained multicast routing problem than the heuristic algorithm.