Solving degree-constrained multicast routing problem by a heuristic genetic algorithm
|更新时间:2024-10-14
|
Solving degree-constrained multicast routing problem by a heuristic genetic algorithm
Issue 1, Pages: 96-102(2007)
作者机构:
1. 中国传媒大学计算机科学与软件学院
2. 中国科学院计算技术研究所 3. 山东工商学院 4. 中国矿业大学(北京)
作者简介:
基金信息:
DOI:
CLC:TP18
Published:2007
稿件说明:
移动端阅览
PAN Yun1, WANG Xing-gang2, FENG Yan-li3, et al. Solving degree-constrained multicast routing problem by a heuristic genetic algorithm[J]. 2007, (1): 96-102.
DOI:
PAN Yun1, WANG Xing-gang2, FENG Yan-li3, et al. Solving degree-constrained multicast routing problem by a heuristic genetic algorithm[J]. 2007, (1): 96-102.DOI:
Solving degree-constrained multicast routing problem by a heuristic genetic algorithm
摘要
为了能够有效求解带有度约束的多播路由模型
融合启发式算法与遗传算法
利用染色体作为启发信息
设计了一种求解该模型的混合遗传算法。该算法不但避免了直接对树形数据结构编码所带来的困难
而且具有快速收敛的特点和全局寻优的能力。最后
大量的数字仿真从实践上支持了该算法的有效性。
Abstract
With the purpose to solve the degree constrained multicast routing model efficiently
the evolutionary strategy was introduced into heuristic search methods by employing the chromosome as the heuristic information for global searching
and then a hybrid genetic algorithm was proposed.The algorithm not only avoids the difficulty of coding for multicast trees
but also possesses fast convergency and global optimizing capability.Meanwhile
the efficiency of the method is supported by a great number of numerical experiments.