摘要
通过在蚂蚁选路的概率中加入成本因素,只增加优秀路径上的信息素,实现了对现有蚁群算法的改进,加快了其收敛速度。将改进的蚁群优化算法与分层图相结合,提出了一种构造时延受限的最小代价组播树的并行算法。
By adding cost factor of probability in ants election path, and increasing only the fine quality of information, this paper improves the existing ant colony algorithm to speed up its convergence speed. Combining the improved ant colony optimization algorithms and the tiered plan, it presents a parallel algorithm for constructing minimum price multicast trees under transmission constraints.
出处
《计算机工程》
CAS
CSCD
北大核心
2007年第11期206-208,212,共4页
Computer Engineering
关键词
蚁群算法
WDM网络
组播树
并行算法
Ant colony algorithm
WDM network
Multicast tree
Parallel algorithms
