基于混合遗传算法的多约束组播路由问题的求解

Solution of QoS Multicast Routing Problems Based on HGA

研究了延时、延时抖动约束的最小费用组播路由问题,并且提出了一种混合遗传算法。遗传算法是一种模拟生物进化过程的并行最优算法,适合在大型、复杂的空间中寻找最优解。遗传算法并不需要求解问题具有连续性,因而适宜于约束组播路由问题的求解。此外,遗传算法的并行分布式处理实现简单,因而用遗传算法解决约束组播路由问题十分有效。并通过计算分析,表明本算法能够快速有效的构造出所要求的满足延时、延时抖动约束的最优组播树。

A hybrid genetic algorithm(HGA)was presented to solve the delay and delay jitter-constrained least-cost multicast routing problem.Genetic algorithm(CA)is a kind of parallel optimization algorithm that simulates the evolution process of a creature,and is suitable for finding optimal solution in a large and complicated search space.GA does not need continous solution to the problem,and can be easily implemented in parallel distributed process,so that it is effective in solving QoS multicast routing.