基于量子遗传退火策略的多播路由优化模型及其算法  

Optimal Multicast Routing Model and Its Algorithm Based on the Quantum Genetic Annealing Strategy

作　　者：蔡奎生[1] 

机构地区：[1]苏州经贸职业技术学院,江苏苏州215000

出　　处：《计算机工程与科学》2009年第10期12-14,共3页Computer Engineering & Science

基　　金：江苏省教委科学基金资助项目(JS2007021)

摘　　要：针对网络通信中带时延约束的多播路由问题,提出了一种基于量子遗传退火策略的路由算法。文中对路由选择问题的优化模型进行了描述,并深入研究了量子遗传退火及其在多播路由选择优化问题中的应用。仿真实验表明,与基于遗传算法的多播路由算法相比,该算法具有更快的收敛速度和更好的全局寻优能力。A method based on the quantum genetic annealing algorithm （QGAA） is presented to deal with the delay-constrained muhicast routing problem. The optimal model of the multicast routing problem is introduced, and QGAA and its application in the multicast routing problem are investigated deeply. Simulations show that compared with those based on the genetic algorithm, the multicast routing based on QGAA has a faster converging speed and better ability of global search.

关 键 词：多播路由 遗传算法 模拟退火算法 量子计算 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]