基于QPSO算法的信道分配方法

Channel Assignment Based on QPSO Algorithm

由于传统的信道分配方法存在频率利用率低下和处理速度慢的缺点,为此,提出基于量子计算的PSO算法(QPSO)来快速实现信道最优化分配方法。这种优化方法利用了量子计算的并行计算能力强、全局收敛、运算速度极快等特点,主要包括初始化代表每个信道的粒子的速度和位置,根据信道分配的数学模型计算保证信道各种约束条件的适应度函数,根据量子粒子群的规律进行粒子位置更新,直至找到最佳信道分配方案等步骤。仿真结果表明其方法是行之有效的,优化效果优于基于遗传算法和PSO算法的信道分配方法。

The traditional approach to channel assignment problem has such disadvantages as the low processing speed and low efficiency for available frequency. In order to quickly realize the channel assignment optimization, an approach based on quantum -behaved particle swarm optimization（QPSO） algorithm is presented according to the advantages of quantum computation, including strong ability of parallel calculation, global convergence and fast operating speed. The main processing procedure includes initialization speed and position of particles representing status of each channel, then calculates fitness function satisfying restricting condition based on mathematic model of channel assignment, and updates the position of particle swarm on the evolutionary law of quantum-behaved particle swarm, finally finds out the best channel assignment. Simulation shows that the approach is effective, and the optimization result is superior to that of 6A and PSO algorithms.