摘要
有时延约束的组播问题是通信网络多点路由优化问题中的重要部分 ,已被证明是NP complete问题 .本文提出了一种基于罚函数法的启发式遗传算法以求解该问题 ,并讨论了违反时延约束不可行解的罚函数选取问题 ,进化过程中采用适于此类问题的动态交配概率、变异概率以提高算法的收敛速度 .最后分析了算法的复杂度 .仿真表明 ,本文算法是有效的。
Delay constrained multicast problem is an important part of multipoint routing optimization problem and is 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 mutate probability suiting for this kind of problems are adopted to accelerate the convergence speed. And algorithm complexity is analyzed. Simulations show that the algorithm is effective and stable.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2001年第4期506-509,共4页
Acta Electronica Sinica
基金
国家973项目! (No .G1 9980 30 4 1 5)
关键词
时延约束
组播路由
遗传算法
精确罚函数
Computational complexity
Computer simulation
Constraint theory
Convergence of numerical methods
Functions
Genetic algorithms
Heuristic methods
Probability
Routers
