改进型量子蚁群算法求解QoS单播路由

Improved quantum ant colony algorithm for QoS unicast routing algorithm

针对遗传以及蚁群算法在求解QoS单播路由问题时收敛速度慢和易于陷入局部最优的问题。采用量子蚁群算法求解QoS单播路由,采用量子旋转门实现蚂蚁的移动,用量子非门来实现蚂蚁位置的变异,同时为了确保算法不陷于局部最优,对量子蚁群算法做了改进,并进行了对比实验。实验表明该算法不但克服了遗传以及蚁群算法的易限于局部最优解的缺陷,在收敛速度上也优于相关算法,能较好地解决QoS单播路由问题。

For the genetic algorithm and ant colony algorithm solving QoS unicast routing problem is easily trapped into local optimization and has slow convergence.Ant colony algorithm is used to solve the quantum QoS unicast routing,quantum revolving doors are used to complete the ant movement,quantum nongates are used to realize ant location variation,and in order to ensure the algorithm is not trapped in local optimum,quantum ant colony algorithm is improved,and conductes comparative experiments related to the simulation.Experiments show that this algorithm not only overcomes the defects that the genetic algorithm and ant colony algorithm is easily trapped into local optimization and the convergence speed is also better than the ant colony algorithm.The QoS unicast routing problem can be better solved.