为提高粒子群算法的搜索能力和优化效率并避免早熟收敛,将量子进化算法融合到粒子群算法中,提出一种求解连续空间优化问题的量子粒子群优化算法.用量子位的概率幅对粒子位置编码,用量子旋转门实现粒子移动,完成粒子搜索;用量子非门实现变异,提高种群多样性.因每个量子位有两个概率幅,故每个粒子同时占据空间两个位置,在粒子数目相同时,能加速粒子的搜索进程.实验结果表明,本算法优于基本粒子群算法.
参考文献
| [1] | Kennedy J,Eberhart R C.Particle swarms optimization[C].Proc.IEEE International Conference on Neural Networks[M].USA:IEEE Press,1995.4:1942-1948. |
| [2] | van den Bergh F,Engelbrecht A P.Cooperative learning in neural networks using particle swarm optimizers[J].South African Computer Journal,2000,11:84-90. |
| [3] | Shi Y H,Eberhart R C.A modified particle swarm optimizer[C].IEEE World Congress on Computational Intelligence[M].Anchorage,1998.69-73. |
| [4] | Lovbjerg M,Rasmussen T K,Krink T.Hybrid particle swarm optimizer with breeding and subpopulations[C].Proc of the 3rd Genetic and Evolutionary Computation Conference[M].Sanfrancisco,2001.469-476. |
| [5] | Lu Z S,Hou Z R.Particle swarm optimization with adaptive mutation[J].Acta Electronica Sinica (电子学报),2004,32(3):416-420. |
| [6] | Eberhart R C,Shi Y H.Comparing inertia weights and constriction factors in particle swarm optimization[C].Proc 2000 Congress Evolutionary Computation[M].Piscataway:IEEE Press,2000.84-88. |
| [7] | Chen B R,Feng X T.Particle swarm optimization with contracted ranges of both search space and velocity[J].Journal of Northeastern University (Natural Science) (东北大学学报(自然科学版)),2005,26(5):488-491. |
| [8] | Hyun K,Kim J H.Quantum-inspired evolutionary algorithm for a class of combinational optimization[J].IEEE Transactions on Evolutionary Computing,2002,6(6):580-593. |
上一张
下一张
上一张
下一张
计量
- 下载量()
- 访问量()
文章评分
- 您的评分：
-
10%
-
20%
-
30%
-
40%
-
50%