计算机科学 ›› 2014, Vol. 41 ›› Issue (Z11): 39-42.

• 智能计算 • 上一篇    下一篇

基于改进的量子粒子群算法在QoS组播路由中的研究

万振凯,曾蕾   

  1. 天津工业大学 天津300387;天津工业大学 天津300387
  • 出版日期:2018-11-14 发布日期:2018-11-14

Solving QoS Multicast Routing Problem Based on Improved Quantum-behaved Particle Swarm Optimization Algorithm

WAN Zhen-kai and ZENG Lei   

  • Online:2018-11-14 Published:2018-11-14

摘要: 针对QoS组播路由问题,提出了一种改进的量子粒子群优化算法。为了更好地求解 该问题,算法采用预处理机制。首先将图形网络拓扑转换为树形网络拓扑,在此基础上进行粒子的编解码,从而杜绝了坏粒子及环路的产生,减少了重复粒子;并利用量子粒子群算法进行粒子群遍历寻优,同时在每次粒子位置移动后,均进行粒子群体的交叉和选择操作,以提高粒子群个体的多样性,增强算法的全局寻优能力,加快算法的收敛速度。最后,将该算法与传统的粒子群优化算法进行编程对比。实验仿真结果表明:改进后的量子粒子群优化算法能获得比传统粒子群优化算法更优的解,同时具有更快的收敛速度及全局寻优能力。

关键词: 服务质量,组播路由,预处理机制,量子行为,粒子群优化算法

Abstract: For QoS multicast routing problem,an improved quantum particle swarm optimization algorithm was proposed.In order to solve the problem better,the algorithm uses the preprocessing mechanism.Firstly,the graphical network topology is converted to the tree network topology.On this basis,the codec of particles can easily be established.It is conducive to eliminating the bad particles and loops,also reduces duplication of the particle.Then the quantum-behaved particle swarm optimization was used to update the position of particles.After updating the position of particles,crossover and selection operator enhancing the diversity of particle populations and accelerating the convergence speed were made for particle populations.Finally,for comparison,the algorithm and the traditional particle swarm optimization algorithm were programmed.Simulation results show that the improved quantum-behaved particle swarm optimization algorithm can not only get better solutions than traditional particle swarm optimization algorithm,but also has faster convergence and global optimization capability.

Key words: Quality of server(QoS),Multicast routing,Preprocessing mechanism,Quantum behavior,Particle swarm optimization(PSO) algorithm

[1] WANG Zheng,CORWCROFT J.Quality-of-service routing for supporting multimedia applications[J].IEEE Journal on SelectedAreas in Communications,1996,4(7):1228-1234
[2] 孙俊.量子行为粒子群优化算法研究[D].无锡:江南大学,2009
[3] Clerc M,Kennedy J.The particle swarm:explosion,stability and convergence in a multi-dimensional complex space[J].IEEE Transaction on Evolutionary Computation,2002,6(2),58-73
[4] Gen M,Cheng R W.Genetic algorithms and engineering des-ign[M].New York:John Wiley & Sons,1996
[5] Leela R,Thanulekshmi N,Selvakumar S.Multi-constraint QoS unicast routing using genetic algorithm(MURUGA)[J].Applied Soft Computing,2011(11):1753-1761
[6] Wang Hua,Xu Hong,Yi Shan-wen,et al.A tree-growth based ant colony algorithm for QoS multicast routing problem[J].Expert Systems with Applications,2011(38):11787-11795
[7] 刘萍,高飞,杨云.基于遗传算法和蚁群算法融合的QoS路由算法[J].计算机应用研究,2007,24(9):224-227
[8] 王征应,石冰心.基于启发式遗传算法的QoS组播路由问题求解[J].计算机学报,2001,4(1):55-61

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!