Solving Delay Constrained Multicast Routing Problem with Genetic Algorithm Based on Accuracy Penalty Function
Yugeng Xi · Dianzi xuebao · 2001
Delay constrained multicast problem is an important part of multipoint routing optimization problem and has been proved to be a NP-Complete problem.The paper provides a heuristic genetic algorithm based on penalty function method to solve the problem,and discusses how to select the penalty function for infeasible solutions which violate the constraint.Dynamic cross probability and mute probability suiting for this kind of problems have been adopted to accelerate the convergence speed.And algorithm complexity is analyzed.Simulations show that the algorithm is effective and stable.