计算机工程 ›› 2013, Vol. 39 ›› Issue (4): 234-238.doi: 10.3969/j.issn.1000-3428.2013.04.054

• 人工智能及识别技术 • 上一篇    下一篇

一种改进的量子旋转门量子遗传算法

张小锋a,睢贵芳a,郑 冉a,李志农b,杨国为a   

  1. (南昌航空大学 a. 图像处理与模式识别科技厅重点实验室;b. 无损检测技术教育部重点实验室,南昌 330063)
  • 收稿日期:2012-04-24 出版日期:2013-04-15 发布日期:2013-04-12
  • 作者简介:张小锋(1963-),男,副教授、博士,主研方向:机器视觉,神经网络;睢贵芳,硕士研究生;郑 冉,硕士; 李志农、杨国为,教授、博士后
  • 基金项目:
    国家自然科学基金资助项目(51075372, 60973048);江西省自然科学基金资助项目(2009GZS0084, 20114BAB2010 34);江西省教育厅科学技术研究基金资助项目(GJJ12413);江西省研究生创新基金资助项目(YC2011038, YC2011-S097, YC20 11003)

An Improved Quantum Genetic Algorithm of Quantum Revolving Gate

ZHANG Xiao-feng a, SUI Gui-fang a, ZHENG Ran a, LI Zhi-nong b, YANG Guo-wei a   

  1. (a. Key Laboratory of Image Processing and Pattern Recognition, Palace of Science; b. Key Laboratory of Nondestructive Testing, Ministry of Education, Nanchang Hangkong University, Nanchang 330063, China)
  • Received:2012-04-24 Online:2013-04-15 Published:2013-04-12

摘要: 量子遗传算法易陷入局部极值。为此,提出一种改进量子旋转门的量子遗传算法。将量子比特的概率幅值应用于染色体编码,使用量子旋转门实现染色体的更新操作,从而实现目标的优化求解。理论分析及实验结果表明,该算法以概率1收敛,强收敛于1?ε,与双链遗传算法相比,能增加算法复杂度,延长平均时间,对验证函数1收敛次数由3次增加到7次,对验证函数2收敛次数由8次增加到9次。

关键词: 量子比特, 量子遗传算法, 量子染色体, H?门, 收敛性

Abstract: Aiming at the problems that the Quantum Genetic Algorithm(QGA) easily falls into local extremum, an improved QGA algorithm of quantum revolving gate is proposed. In order to achieve the goal of optimization solving, quantum bit probability amplitude is applied to the chromosome encoding, and quantum rotation gate is used to chromosome updating. The theoretical derivation proves that the proposed algorithm converges with probability 1, and the algorithm converges strongly to 1?ε. Comparing with double QGA, simulation results show that the algorithm increases complexity, the average time extension, but convergence times increase, convergence times of the function 1 increases from 3 to 7, and convergence times of the function 2 increases from 8 to 9.

Key words: quantum bit, Quantum Genetic Algorithm(QGA), quantum chromosome, H? gate, convergence

中图分类号: