基于量子粒子群算法的时延受限组播路由问题研究  

ON MULTICAST ROUTING PROBLEM WITH DELAY CONSTRAINT BASED ON QUANTUM PARTICLE SWARM OPTIMIZATION

作　　者：宋书强[1] 叶春明[1] 

机构地区：[1]上海理工大学管理学院,上海200093

出　　处：《计算机应用与软件》2009年第10期186-188,共3页Computer Applications and Software

摘　　要：对具有延时约束的最小代价的组播路由问题进行研究,提出一种收敛速度快、全局性能好、不易陷入局部最优的智能迭代算法—量子粒子群算法来实现该问题的求解。该算法采用整数编码方式,将路由优化问题转化成准连续优化,并采用惩罚函数处理约束条件。最后通过具体算例,对该算法进行了仿真验证,结果表明,在求解延时约束的组播路由问题时,量子粒子群算法要优于遗传算法、克隆算法,从而验证了该算法的可行性和有效性。To study the delay constrained least-cost muhicast routing problem, we use quantum particle swarm optimization （QPSO） to solve this problem, which has good convergence speed, good global performance and less easily to be trapped in avoiding to be trapped in local optimum. We change the multicast routing optimization problem into a quasi-continuous optimization problem by using an integer coding, and we process the constrained terms by penalty function. Finally we use a practical analysis to confirm the performance of the method. The results of simulation indicate that QPSO performs better than the genetic algorithm and the cloning algorithm in solving the studying problem, hence its feasibility and effectiveness is proved.

关 键 词：量子粒子群算法 组播路由 路由优化 延时约束 

分 类 号：TP393.4[自动化与计算机技术—计算机应用技术] TS210.3[自动化与计算机技术—计算机科学与技术]